中文
相关论文

相关论文: Symmetric Groups and Expander Graphs

200 篇论文

We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…

群论 · 数学 2007-05-23 Martin Kassabov

Using the construction of a nonorientable Curtis-Tits group of type $\tilde A_n$, we obtain new explicit families of expander graphs of valency five for unitary groups over finite fields.

群论 · 数学 2011-10-31 Rieuwert Blok , Corneliu Hoffman , Alina Vdovina

We study how the spectral gap and diameter of Cayley graphs depend strongly on the choice of generating set. We answer a question of Pyber and Szab\'o (2013) by exhibiting a sequence of finite groups $G_n$ with $|G_n| \to \infty$ admitting…

群论 · 数学 2026-02-17 Sean Eberhard , Luca Sabatini

We construct new examples of expander Cayley graphs of finite groups, arising as congruence quotients of non-elementary subgroups of $SL_2 (\mathbb{F}_p [t])$ modulo certain square-free ideals. We describe some applications of our results…

群论 · 数学 2015-03-25 Henry Bradford

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

计算复杂性 · 计算机科学 2016-06-07 Tali Kaufman , David Mass

We study the representations of non-commutative universal lattices and use them to compute lower bounds for the \TauC for the commutative universal lattices $G_{d,k}= \SL_d(\Z[x_1,...,x_k])$ with respect to several generating sets. As an…

群论 · 数学 2007-05-23 Martin Kassabov

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

群论 · 数学 2017-01-09 Florent Jouve , Jean-Sébastien Sereni

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

组合数学 · 数学 2007-11-21 Jacob Steinhardt

We show that random Cayley graphs of finite simple (or semisimple) groups of Lie type of fixed rank are expanders. The proofs are based on the Bourgain-Gamburd method and on the main result of our companion paper, establishing strongly…

群论 · 数学 2014-02-10 Emmanuel Breuillard , Ben Green , Robert Guralnick , Terence Tao

An infinite family of bounded-degree 'unique-neighbor' expanders was constructed explicitly by Alon and Capalbo (2002). We present an infinite family F of bounded-degree unique-neighbor expanders with the additional property that every…

组合数学 · 数学 2016-05-11 Oren Becker

The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic Cayley graphs of the dihedral groups. Lubotzky, Samuels and…

组合数学 · 数学 2022-02-09 Arindam Biswas , Jyoti Prakash Saha

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…

群论 · 数学 2010-05-06 Emmanuel Breuillard , Ben Green , Terence Tao

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)$…

计算复杂性 · 计算机科学 2012-01-17 V. Arvind , Partha Mukhopadhyay , Prajakta Nimbhorkar , Yadu Vasudev

For every infinite sequence of simple groups of Lie type of growing rank we exhibit connected Cayley graphs of degree at most 10 such that the isoperimetric number of these graphs converges to 0. This proves that these graphs do not form a…

组合数学 · 数学 2013-02-12 Gabor Somlai

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

群论 · 数学 2007-05-23 Marc Lackenby

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…

量子代数 · 数学 2022-03-25 Daniel Gromada

We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…

群论 · 数学 2007-05-23 Thomas W. Mueller , Jan-Christoph Schlage-Puchta

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

组合数学 · 数学 2026-05-15 Sally Cockburn , Ryhory Hatavets , Will Swartz

The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.

组合数学 · 数学 2014-03-31 Cristóbal Camarero , Carmen Martínez , Ramón Beivide

In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…

量子物理 · 物理学 2007-05-23 Heath Gerhardt , John Watrous
‹ 上一页 1 2 3 10 下一页 ›