中文
相关论文

相关论文: An improved diameter bound for finite simple group…

200 篇论文

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

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

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

We prove strong and explicit diameter bounds for finite simple Lie algebras, which parallel Babai's conjecture for finite simple groups. Specifically, we show that any nonabelian finite simple Lie algebra $\mathfrak{g}$ over $\mathbf{F}_p$…

环与代数 · 数学 2025-09-30 Marco Barbieri , Urban Jezernik , Matevž Miščič

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

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

群论 · 数学 2022-03-08 Martino Garonzi , Zoltán Halasi , Gábor Somlai

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

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

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

群论 · 数学 2026-04-21 Sean Eberhard , Elena Maini , Luca Sabatini , Gareth Tracey

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

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

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

群论 · 数学 2007-05-23 Miklos Abert , Laszlo Babai

Fix a prime $p$ and an integer $m$ with $p> m \geq 2$. Define the family of finite groups \[ G_n :=SL_m (\mathbb{Z}/p^{n}\mathbb{Z}) \] for $n=1,2,... $. We will prove that there exist two positive constants $C$ and $d$ such that for any…

群论 · 数学 2007-05-23 Oren Dinai

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ó

Let $G$ be a finite group, and $\alpha$ a nontrivial character of $G$. The McKay graph ${\mathcal M}(G,\alpha)$ has the irreducible characters of $G$ as vertices, with an edge from $\chi_1$ to $\chi_2$ if $\chi_2$ is a constituent of…

群论 · 数学 2019-12-02 Martin W. Liebeck , Aner Shalev , Pham Huu Tiep

Given a graph $G$, let $\mathrm{diam}(G)$ be the greatest distance between any two vertices of $G$ which lie in the same connected component, and let $\mathrm{diam}^+(G)$ be the greatest distance between any two vertices of $G$; so…

概率论 · 数学 2025-12-08 Louigi Addario-Berry , Gabriel Crudele

The directed Cayley diameter of a finite group is investigated in terms of the monoid of product-one sequences over the group, via the new notion of directed geodesic atoms. Two quantities associated to the set of directed geodesic atoms…

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

A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…

组合数学 · 数学 2025-03-04 Saveliy V. Skresanov

Following partially a suggestion by Pyber, we prove that the diameter of a product of non-abelian finite simple groups is bounded linearly by the maximum diameter of its factors. For completeness, we include the case of abelian factors and…

群论 · 数学 2022-12-13 Daniele Dona
‹ 上一页 1 2 3 10 下一页 ›