中文
相关论文

相关论文: On the diameter of Cayley graphs of classical grou…

200 篇论文

A well-known conjecture of Babai states that if $G$ is a finite simple group and $X$ is a generating set of $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded above by $(\log |G|)^c$ for some absolute constant $c$. The goal of…

群论 · 数学 2020-02-25 Zoltán Halasi

Let $G$ be a finite classical group generated by transvections, i.e., one of $\operatorname{SL}_n(q)$, $\operatorname{SU}_n(q)$, $\operatorname{Sp}_{2n}(q)$, or $\operatorname{O}^\pm_{2n}(q)$ ($q$ even), and let $X$ be a generating set for…

群论 · 数学 2024-05-14 Sean Eberhard

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

群论 · 数学 2019-08-14 Zoltán Halasi , Attila Maróti , László Pyber , Youming Qiao

Given a non-abelian finite simple group $G$ of Lie type, and an arbitrary generating set $S$, it is conjectured by Laszlo Babai that its Cayley graph $\Gamma (G,S)$ will have a diameter of $(\log |G|)^{O(1)}$. However, little progress has…

群论 · 数学 2017-11-29 Arindam Biswas , Yilong Yang

Let $G = \mathrm{SCl}_n(q)$ be a quasisimple classical group with $n$ large, and let $x_1, \dots, x_k \in G$ random, where $k \geq q^C$. We show that the diameter of the resulting Cayley graph is bounded by $q^2 n^{O(1)}$ with probability…

群论 · 数学 2021-11-18 Sean Eberhard , Urban Jezernik

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

群论 · 数学 2014-01-03 Harald A. Helfgott , Akos Seress

Babai's conjecture states that, for any finite simple non-abelian group $G$, the diameter of $G$ is bounded by $(\log|G|)^{C}$ for some absolute constant $C$. We prove that, for any untwisted classical group $G$ of rank $r$ defined over a…

群论 · 数学 2024-12-16 Jitendra Bajpai , Daniele Dona , Harald Andrés Helfgott

We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.

群论 · 数学 2019-01-30 Jakob Schneider

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

Let $\Gamma$ be a Cayley graph of the permutation group generated by a transposition tree $T$ on $n$ vertices. In an oft-cited paper \cite{Akers:Krishnamurthy:1989} (see also \cite{Hahn:Sabidussi:1997}), it is shown that the diameter of the…

离散数学 · 计算机科学 2015-12-11 Ashwin Ganesan

The unipotent subgroup of a finite group of Lie type over a prime field Z/pZ comes equipped with a natural set of generators; the properties of the Cayley graph associated to this set of generators have been much studied. In the present…

群论 · 数学 2007-05-23 Jordan S. Ellenberg , Julianna S. Tymoczko

Let $S\subset\text{GL}_n(\mathbb Z)$ be a finite symmetric set. We show that if the Zariski closure of $\Gamma=\langle S\rangle$ is a product of $\text{SL}_d$ or a special affine linear group, then the diameter of the Cayley graph…

群论 · 数学 2021-10-05 Lam Pham , Xin Zhang

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

组合数学 · 数学 2026-05-29 Demetres Christofides , Klas Markström , Christina Savvidou

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

群论 · 数学 2011-04-11 László Pyber , Endre Szabó

Given a group G, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any…

组合数学 · 数学 2011-08-18 Demetres Christofides , Klas Markström

Let $s$ be a positive integer. Our goal is to find all finite abelian groups $G$ that contain a $2$-subset $A$ for which the undirected Cayley graph $\Gamma(G,A)$ has diameter at most $s$. We provide a complete answer when $G$ is cyclic,…

组合数学 · 数学 2024-12-11 Bela Bajnok , W. Kyle Beatty

We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to…

几何拓扑 · 数学 2021-03-02 Dan Margalit , Andrew Putman

Let $G$ be a group such that $G/Z(G)$ is finite and simple. The non-commuting, non-generating graph $\Xi(G)$ of $G$ has vertex set $G \setminus Z(G)$, with edges corresponding to pairs of elements that do not commute and do not generate…

群论 · 数学 2026-02-20 Saul D. Freedman

Let $\Gamma$ be a Cayley graph generated by a transposition tree. A natural problem is to understand how the properties of the Cayley graph depend on those of the underlying transposition tree. We focus here on diameter and distance related…

组合数学 · 数学 2011-11-22 Ashwin Ganesan
‹ 上一页 1 2 3 10 下一页 ›