Search arXivSearch

arXiv · 2410.02913

Conditional Non-Soficity of p-adic Deligne Extensions: on a Theorem of Gohla and Thom

Abstract

A long standing problem asks whether every group is sofic, i.e., can be separated by almost-homomorphisms to the symmetric group $Sym(n)$. Similar problems have been asked with respect to almost-homomorphisms to the unitary group $U(n)$, equipped with various norms. One of these problems has been solved for the first time in [De Chiffre, Gelbsky, Lubotzky, Thom, 2020]: some central extensions $\widetildeΓ$ of arithmetic lattices $Γ$ of $Sp(2g,\mathbb{Q}_p)$ were shown to be non-Frobenius approximated by almost homomorphisms to $U(n)$. Right after, it was shown that similar results hold with respect to the $p$-Schatten norms in [Lubotzky, Oppenheim, 2020]. It is natural, and has already been suggested in [Chapman, Lubotzky, 2024] and [Gohla, Thom, 2024], to check whether the $\widetildeΓ$ are also non-sofic. In order to show that they are (also) non-sofic, it suffices: (a) To prove that the permutation Cheeger constant of the simplicial complex underlying $Γ$ is positive, generalizing [Evra, Kaufman, 2016]. This would imply that $Γ$ is stable. (b) To prove that the (flexible) stability of $Γ$ implies the non-soficity of $\widetildeΓ$. Clause (b) was proved by Gohla and Thom. Here we offer a more algebraic/combinatorial treatment to their theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Chapman, Yotam Dikstein, Alexander Lubotzky. 2024-12-16. Conditional Non-Soficity of p-adic Deligne Extensions: on a Theorem of Gohla and Thom. https://arxiv.org/abs/2410.02913

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO