English
Related papers

Related papers: Symmetric Groups and Expanders

200 papers

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

Computational Complexity · Computer Science 2012-01-17 V. Arvind , Partha Mukhopadhyay , Prajakta Nimbhorkar , Yadu Vasudev

In this paper we study asymptotic behavior of regular subsets in a free group F of finite rank, compare their sizes at infinity, and develop techniques to compute the probabilities of sets relative to distributions on F that come naturally…

Group Theory · Mathematics 2009-06-17 Elizaveta Frenkel , Alexei G. Myasnikov , Vladimir N. Remeslennikov

We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. Most properties of the classical walk carry over to the quantum operation: degree becomes the number of Kraus operators,…

Quantum Physics · Physics 2008-06-15 Aram W. Harrow

In the present paper, as a continuation of our preceding paper [10], we study another kind of central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a viewpoint of discrete geometric analysis…

Probability · Mathematics 2021-08-17 Satoshi Ishiwata , Hiroshi Kawabi , Ryuya Namba

We show that pairs of generators for the family Sz(q) of Suzuki groups may be selected so that the corresponding Cayley graphs are expanders. By combining this with several deep works of Kassabov, Lubotzky and Nikolov, this establishes that…

Group Theory · Mathematics 2010-05-06 Emmanuel Breuillard , Ben Green , Terence Tao

Expander graphs are among the most useful combinatorial objects in theoretical computer science. A line of work studies random walks on expander graphs for their pseudorandomness against various classes of test functions, including…

Computational Complexity · Computer Science 2025-01-23 Emile Anand

An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…

Signal Processing · Electrical Eng. & Systems 2022-03-08 Kathryn Beck , Mahya Ghandehari

In this note we show that the family of Cayley graphs of a finitely generated subgroup of ${\rm GL}_{n_0}(\mathbb{F}_p(t))$ modulo some admissible square-free polynomials is a family of expanders under certain algebraic conditions. Here is…

Group Theory · Mathematics 2022-03-09 Brian Longo , Alireza Salehi Golsefidy

Let S be a fixed finite symmetric subset of SL_d(Z), and assume that it generates a Zariski-dense subgroup G. We show that the Cayley graphs of pi_q(G) with respect to the generating set pi_q(S) form a family of expanders, where pi_q is the…

Group Theory · Mathematics 2012-05-15 Jean Bourgain , Péter P. Varjú

Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution. In this work…

Computational Complexity · Computer Science 2016-09-15 Tali Kaufman , David Mass

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

Group Theory · Mathematics 2011-04-13 Jon McCammond , John Rhodes , Benjamin Steinberg

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

Group Theory · Mathematics 2010-04-22 Ben Fairbairn

We establish for the matrix group $G=\mathrm{SL}_{n}\left(\mathbb{F}_{p}\right)$ that there exist absolute constants $c\in\left(0,1\right)$ and $C>0$ such that any symmetric generating set $A$, with $\left|A\right|\geq\left|G\right|^{1-c}$…

Combinatorics · Mathematics 2024-11-05 Eitan Porat

We consider the family of undirected Cayley graphs associated with odd cyclic groups, and study statistics for the eigenvalues in their spectra. Our results are motivated by analogies between arithmetic geometry and graph theory.

Combinatorics · Mathematics 2024-09-04 Matilde Lalin , Anwesh Ray

The purpose of this article is to give a characterization of families of expander graphs via right-angled Artin groups. We prove that a sequence of simplicial graphs $\{\Gamma_i\}_{i\in\mathbb{N}}$ forms a family of expander graphs if and…

Group Theory · Mathematics 2021-10-11 Ramón Flores , Delaram Kahrobaei , Thomas Koberda

We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…

Combinatorics · Mathematics 2018-10-15 Ioannis Ivrissimtzis , Norbert Peyerimhoff , Alina Vdovina

In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…

Combinatorics · Mathematics 2021-01-13 Federico Vigolo

We show that families of coverings of an algebraic curve where the associated Cayley-Schreier graphs form an expander family exhibit strong forms of geometric (genus and gonality) growth. Combining this general result with finiteness…

Number Theory · Mathematics 2019-12-19 Jordan Ellenberg , Chris Hall , Emmanuel Kowalski

For fixed positive integers $n$ and $k$, the Kneser graph $KG_{n,k}$ has vertices labeled by $k$-element subsets of $\{1,2,\dots,n\}$ and edges between disjoint sets. Keeping $k$ fixed and allowing $n$ to grow, one obtains a family of…

Combinatorics · Mathematics 2017-11-27 Eric Ramos , Graham White

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…

Quantum Algebra · Mathematics 2022-03-25 Daniel Gromada