Search arXivSearch

arXiv · 2203.03687

Hamming sandwiches

Abstract

We describe primitive association schemes $\mathfrak{X}$ of degree $n$ such that $\mathrm{Aut}(\mathfrak{X})$ is imprimitive and $|\mathrm{Aut}(\mathfrak{X})| \geq \exp(n^{1/8})$, contradicting a conjecture of Babai. This and other examples we give are the first known examples of nonschurian primitive coherent configurations (PCC) with more than a quasipolynomial number of automorphisms. Our constructions are "Hamming sandwiches", association schemes sandwiched between the $d$th tensor power of the trivial scheme and the $d$-dimensional Hamming scheme. We study Hamming sandwiches in general, and exhaustively for $d \leq 8$. We revise Babai's conjecture by suggesting that any PCC with more than a quasipolynomial number of automorphisms must be an association scheme sandwiched between a tensor power of a Johnson scheme and the corresponding full Cameron scheme. If true, it follows that any nonschurian PCC has at most $\exp O(n^{1/8} \log n)$ automorphisms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean Eberhard. 2022-08-19. Hamming sandwiches. https://doi.org/10.1007/s00493-023-00004-z

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