Search arXivSearch

arXiv · 1308.5020

Automorphisms of decompositions

Abstract

Harding showed that the direct product decompositions of many different types of structures, such as sets, groups, vector spaces, topological spaces, and relational structures, naturally form orthomodular posets. When applied to the direct product decompositions of a Hilbert space, this construction yields the familiar orthomodular lattice of closed subspaces of the Hilbert space. In this note we consider orthomodular posets Fact X of decompositions of a finite set X. We consider the structure of these orthomodular posets, such as their size, shape, and connectedness, states, and begin a study of their automorphism groups in the context of the natural map Γfrom the group of permutations of X to the automorphism group of Fact X. We show Γis an embedding except when |X| is prime or 4, and completely describe the situation when |X| has two or fewer prime factors, when |X|=8 and when |X|=27. The bulk of our effort lies in a series of combinatorial arguments to show Γis an isomorphism when |X|=27. We conjecture that this is the case whenever |X| has sufficiently many prime factors of sufficient size, and hope that our arguments here might be adapted to the general case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tim Hannan, John Harding. 2013-08-23. Automorphisms of decompositions. https://arxiv.org/abs/1308.5020

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO