scholarly journals A generalization of a theorem of Rodgers and Saxl for simple groups of bounded rank

2020 ◽  
Vol 52 (3) ◽  
pp. 464-471
Author(s):  
N. Gill ◽  
L. Pyber ◽  
E. Szabó
Keyword(s):  
Simple Groups ◽  
Bounded Rank

Mixing, Communication Complexity and Conjectures of Gowers and Viola

2016 ◽  
Vol 26 (4) ◽  
pp. 628-640 ◽  
Author(s):  
ANER SHALEV
Keyword(s):  
Simple Group ◽  
Lower Bounds ◽  
Finite Simple Group ◽  
Decision Problem ◽  
Communication Complexity ◽  
Simple Groups ◽  
Finite Simple Groups ◽  
Quantitative Estimates ◽  
Complexity Lower Bounds ◽  
Bounded Rank

We study the distribution of products of conjugacy classes in finite simple groups, obtaining effective two-step mixing results, which give rise to an approximation to a conjecture of Thompson.Our results, combined with work of Gowers and Viola, also lead to the solution of recent conjectures they posed on interleaved products and related complexity lower bounds, extending their work on the groups SL(2,q) to all (non-abelian) finite simple groups.In particular it follows that, ifGis a finite simple group, andA,B⊆Gtfort⩾ 2 are subsets of fixed positive densities, then, asa= (a1, . . .,at) ∈Aandb= (b1, . . .,bt) ∈Bare chosen uniformly, the interleaved producta•b:=a1b1. . .atbtis almost uniform onG(with quantitative estimates) with respect to the ℓ∞-norm.It also follows that the communication complexity of an old decision problem related to interleaved products ofa,b∈Gtis at least Ω(tlog |G|) whenGis a finite simple group of Lie type of bounded rank, and at least Ω(tlog log |G|) whenGis any finite simple group. Both these bounds are best possible.

scholarly journals A diameter bound for finite simple groups of large rank

2017 ◽  
Vol 95 (2) ◽  
pp. 455-474 ◽  
Author(s):  
Arindam Biswas ◽  
Yilong Yang
Keyword(s):  
Simple Groups ◽  
Finite Simple Groups ◽  
Large Rank

scholarly journals Isomorphism, canonization, and definability for graphs of bounded rank width

2021 ◽  
Vol 64 (5) ◽  
pp. 98-105
Author(s):  
Martin Grohe ◽  
Daniel Neuen
Keyword(s):  
Fixed Point ◽  
Complexity Theory ◽  
Polynomial Time ◽  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Descriptive Complexity ◽  
Graph Isomorphism Problem ◽  
Structural Graph ◽  
Graph Classes ◽  
Bounded Rank

We investigate the interplay between the graph isomorphism problem, logical definability, and structural graph theory on a rich family of dense graph classes: graph classes of bounded rank width. We prove that the combinatorial Weisfeiler-Leman algorithm of dimension (3 k + 4) is a complete isomorphism test for the class of all graphs of rank width at most k. A consequence of our result is the first polynomial time canonization algorithm for graphs of bounded rank width. Our second main result addresses an open problem in descriptive complexity theory: we show that fixed-point logic with counting expresses precisely the polynomial time properties of graphs of bounded rank width.

scholarly journals The radical subgroups of the Fischer simple groups

2002 ◽  
Vol 255 (1) ◽  
pp. 22-58 ◽  
Author(s):  
Masaaki Kitazume ◽  
Satoshi Yoshiara
Keyword(s):  
Simple Groups

scholarly journals New Beauville surfaces and finite simple groups

2013 ◽  
Vol 142 (3-4) ◽  
pp. 391-408 ◽  
Author(s):  
Shelly Garion ◽  
Matteo Penegini
Keyword(s):  
Simple Groups ◽  
Finite Simple Groups ◽  
Beauville Surfaces
Sign in / Sign up

Export Citation Format

Share Document