Words and mixing times in finite simple groups

Gili Schul; Aner Shalev

Words and mixing times in finite simple groups

Gili Schul, Aner Shalev

Einstein Institute of Mathematics

The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

Abstract

Let w ≠ 1 be a non-trivial group word, let G be a finite simple group, and let w.G/be the set of values of w in G. We show that if G is large, then the random walk on G with respect to w.G/ as a generating set has mixing time 2. This strengthens various known results, for example the fact that w(G) ² covers almost all of G.

Original language	English
Pages (from-to)	517-535
Number of pages	19
Journal	Groups, Geometry, and Dynamics
Volume	5
Issue number	2
State	Published - 2011

Keywords

Finite simple groups
Mixing time
Random walks
Words

All Science Journal Classification (ASJC) codes

Geometry and Topology
Discrete Mathematics and Combinatorics

Cite this

@article{4417e89ce6f74b4ab082a30cc9a1c6aa,

title = "Words and mixing times in finite simple groups",

abstract = "Let w ≠ 1 be a non-trivial group word, let G be a finite simple group, and let w.G/be the set of values of w in G. We show that if G is large, then the random walk on G with respect to w.G/ as a generating set has mixing time 2. This strengthens various known results, for example the fact that w(G) 2 covers almost all of G.",

keywords = "Finite simple groups, Mixing time, Random walks, Words",

author = "Gili Schul and Aner Shalev",

year = "2011",

language = "الإنجليزيّة",

volume = "5",

pages = "517--535",

journal = "Groups, Geometry, and Dynamics",

issn = "1661-7207",

publisher = "European Mathematical Society Publishing House",

number = "2",

}

TY - JOUR

T1 - Words and mixing times in finite simple groups

AU - Schul, Gili

AU - Shalev, Aner

PY - 2011

Y1 - 2011

N2 - Let w ≠ 1 be a non-trivial group word, let G be a finite simple group, and let w.G/be the set of values of w in G. We show that if G is large, then the random walk on G with respect to w.G/ as a generating set has mixing time 2. This strengthens various known results, for example the fact that w(G) 2 covers almost all of G.

AB - Let w ≠ 1 be a non-trivial group word, let G be a finite simple group, and let w.G/be the set of values of w in G. We show that if G is large, then the random walk on G with respect to w.G/ as a generating set has mixing time 2. This strengthens various known results, for example the fact that w(G) 2 covers almost all of G.

KW - Finite simple groups

KW - Mixing time

KW - Random walks

KW - Words

UR - http://www.scopus.com/inward/record.url?scp=79952462451&partnerID=8YFLogxK

M3 - مقالة

SN - 1661-7207

VL - 5

SP - 517

EP - 535

JO - Groups, Geometry, and Dynamics

JF - Groups, Geometry, and Dynamics

IS - 2

ER -

Words and mixing times in finite simple groups

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this