Search arXivSearch

arXiv · 2510.18351

Non-Abelian expansion of congruence KMS complexes

Abstract

Coboundary expansion with non-Abelian coefficients is a strong version of high-dimensional expansion for simplicial complexes. One motivation for studying this notion is that it was recently shown to have deep connections to problems in theoretical computer science. However, very few examples of families of simplicial complexes with this type of expansion are known. Namely, prior to our work, the only known examples were quotients of symplectic buildings and a slight variation of the Kaufman-Oppenheim coset complexes construction associated with $\operatorname{SL}_{n} (\mathbb{F}_p [t])$. In this paper, we show that the Grave de Peralta and Valentiner-Branth constructions of KMS complexes have coboundary expansion with non-Abelian coefficients when it is performed with respect to congruence subgroups of Chevalley groups of classical type, i.e., of type $A_n, B_n, C_n$ and $D_n$. This gives four new sources of examples to this expansion phenomenon, thus significantly enriching our list of constructions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Izhar Oppenheim, Inga Valentiner-Branth. 2025-10-21. Non-Abelian expansion of congruence KMS complexes. https://arxiv.org/abs/2510.18351

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