Quasi-Random profinite groups
Mohammad Bardestani, Keivan Mallahi-Karai

TL;DR
This paper explores the quasi-randomness properties of profinite groups, providing bounds on representation degrees and measure bounds for product-free subsets, using techniques from algebra and functional analysis.
Contribution
It introduces new bounds for representation degrees and measure estimates for profinite groups, advancing understanding of their quasi-random properties.
Findings
Bounds for minimal degrees of non-trivial representations.
Exponential bounds for measure of product-free subsets.
Lower bounds for faithful representation degrees.
Abstract
We will investigate quasi-randomness for profinite groups. We will obtain bounds for the mininal degree of non-trivial representations of and . Our method also delivers a lower bound for the minimal degree of a faithful representation for these groups. Using the suitable machinery from functional analysis, we establish exponential lower and upper bounds for the supremal measure of a product-free measurable subset of the profinite groups and . We also obtain analogous bounds for a special subgroup of the automorphism group of a regular tree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
