Girth, words and diameter

Liebeck, Martin W.; Shalev, Aner

doi:10.1112/blms.12251

Search citation statements

Order By: Relevance

Paper Sections

Select...

For1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 17 publications

(65 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following lemma generalizes a key step from the argument of [36,Theorem 4]. Let w ∈ F k be a nontrivial word of length ≤ ( n 2 − 2)/r.…”

Section: Formentioning

confidence: 90%

Babai’s conjecture for high-rank classical groups with random generators

Eberhard¹,

Jezernik

2021

Invent. math.

View full text Add to dashboard Cite

Let $$G = {\text {SCl}}_n(q)$$ G = SCl n ( q ) be a quasisimple classical group with n large, and let $$x_1, \ldots , x_k \in G$$ x 1 , … , x k ∈ G be random, where $$k \ge q^C$$ k ≥ q C . We show that the diameter of the resulting Cayley graph is bounded by $$q^2 n^{O(1)}$$ q 2 n O ( 1 ) with probability $$1 - o(1)$$ 1 - o ( 1 ) . In the particular case $$G = {\text {SL}}_n(p)$$ G = SL n ( p ) with p a prime of bounded size, we show that the same holds for $$k = 3$$ k = 3 .

show abstract

“…The following lemma generalizes a key step from the argument of [36,Theorem 4]. Let w ∈ F k be a nontrivial word of length ≤ ( n 2 − 2)/r.…”

Section: Formentioning

confidence: 90%