images of word maps in almost simple groups and
play

Images of word maps in almost simple groups and quasisimple groups - PowerPoint PPT Presentation

Nov 10, 2023 •163 likes •603 views

Introduction The Simple Groups Other Groups . . Images of word maps in almost simple groups and quasisimple groups . . . . . Matthew Levy Imperial College London, Supervisor: Nikolay Nikolov Groups St Andrews 2013 . . . . . .

  1. Introduction The Simple Groups Other Groups . . Images of word maps in almost simple groups and quasisimple groups . . . . . Matthew Levy Imperial College London, Supervisor: Nikolay Nikolov Groups St Andrews 2013 . . . . . .

  2. Introduction The Simple Groups Other Groups . Outline . . . Introduction 1 Word maps Images of Word Maps . . . The Simple Groups 2 . . . Other Groups 3 Almost Simple Groups Symmetric Groups Quasisimple Groups . . . . . .

  3. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Outline . . . Introduction 1 Word maps Images of Word Maps . . . The Simple Groups 2 . . . Other Groups 3 Almost Simple Groups Symmetric Groups Quasisimple Groups . . . . . .

  4. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Word maps Let w be an element of the free group of rank k and let G be a group. We can define a word map , w : G k → G , by substitution: w : G k − → G ; ( g 1 , ..., g k ) �− → w ( g 1 , ..., g k ) . For example: w ( x ) = x n ; w ( x , y ) = [ x , y ] . We will denote by G w the verbal image of w over G : G w := { w ( g 1 , ..., g k ) : g i ∈ G } . Define the verbal subgroup , w ( G ) = ⟨ G ± 1 w ⟩ . . . . . . .

  5. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Word maps Let w be an element of the free group of rank k and let G be a group. We can define a word map , w : G k → G , by substitution: w : G k − → G ; ( g 1 , ..., g k ) �− → w ( g 1 , ..., g k ) . For example: w ( x ) = x n ; w ( x , y ) = [ x , y ] . We will denote by G w the verbal image of w over G : G w := { w ( g 1 , ..., g k ) : g i ∈ G } . Define the verbal subgroup , w ( G ) = ⟨ G ± 1 w ⟩ . . . . . . .

  6. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Word maps Let w be an element of the free group of rank k and let G be a group. We can define a word map , w : G k → G , by substitution: w : G k − → G ; ( g 1 , ..., g k ) �− → w ( g 1 , ..., g k ) . For example: w ( x ) = x n ; w ( x , y ) = [ x , y ] . We will denote by G w the verbal image of w over G : G w := { w ( g 1 , ..., g k ) : g i ∈ G } . Define the verbal subgroup , w ( G ) = ⟨ G ± 1 w ⟩ . . . . . . .

  7. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Outline . . . Introduction 1 Word maps Images of Word Maps . . . The Simple Groups 2 . . . Other Groups 3 Almost Simple Groups Symmetric Groups Quasisimple Groups . . . . . .

  8. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Images of Word Maps . Theorem (M. Kassabov & N. Nikolov, Dec 2011) . . . For every n ≥ 7 , n ̸ = 13 there is a word w ( x 1 , x 2 ) ∈ F 2 such that Alt(n ) w consists of the identity and all 3 -cycles. When n = 13 there is word w ( x 1 , x 2 , x 3 ) ∈ F 3 with the same property. . . . . . . . . . . .

  9. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Images of Word Maps . Theorem (M. Kassabov & N. Nikolov, Dec 2011) . . . For every n ≥ 7 , n ̸ = 13 there is a word w ( x 1 , x 2 ) ∈ F 2 such that Alt(n ) w consists of the identity and all 3 -cycles. When n = 13 there is word w ( x 1 , x 2 , x 3 ) ∈ F 3 with the same property. . . . . . Clearly holds for Alt(5), e.g. w ( x ) = x 10 . Also holds for Sym( n ). They go on to give other explicit examples e.g. all p -cycles with p prime 3 < p < n . Similar results for SL( n , q ). More examples can be found in [L.]. They were motivated by verbal width . . . . . . .

  10. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Images of Word Maps . Theorem (M. Kassabov & N. Nikolov, Dec 2011) . . . For every n ≥ 7 , n ̸ = 13 there is a word w ( x 1 , x 2 ) ∈ F 2 such that Alt(n ) w consists of the identity and all 3 -cycles. When n = 13 there is word w ( x 1 , x 2 , x 3 ) ∈ F 3 with the same property. . . . . . Clearly holds for Alt(5), e.g. w ( x ) = x 10 . Also holds for Sym( n ). They go on to give other explicit examples e.g. all p -cycles with p prime 3 < p < n . Similar results for SL( n , q ). More examples can be found in [L.]. They were motivated by verbal width . . . . . . .

  11. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Verbal Width Say w has finite width in G if there exists m such that = { g 1 ... g m : g i ∈ G ± 1 w ( G ) = G ∗ m w } . w Otherwise we say w has infinite width . Define the width to be the least such m . Clearly, if G is finite we always have finite width bounded by | G | . . Theorem (Larsen, Shalev, Tiep) . . . For any w ̸ = 1 we have G = G w G w when G is a sufficiently large finite simple group. . . . . . The requirement of the size of G cannot be removed. . Corollary (Kassabov & Nikolov) . . . For any k, there exists a word w and a finite simple group G, such that w is not an identity in G, but G ̸ = G ∗ k w . . . . . . . . . . . .

  12. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Verbal Width Say w has finite width in G if there exists m such that = { g 1 ... g m : g i ∈ G ± 1 w ( G ) = G ∗ m w } . w Otherwise we say w has infinite width . Define the width to be the least such m . Clearly, if G is finite we always have finite width bounded by | G | . . Theorem (Larsen, Shalev, Tiep) . . . For any w ̸ = 1 we have G = G w G w when G is a sufficiently large finite simple group. . . . . . The requirement of the size of G cannot be removed. . Corollary (Kassabov & Nikolov) . . . For any k, there exists a word w and a finite simple group G, such that w is not an identity in G, but G ̸ = G ∗ k w . . . . . . . . . . . .

  13. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Verbal Width Say w has finite width in G if there exists m such that = { g 1 ... g m : g i ∈ G ± 1 w ( G ) = G ∗ m w } . w Otherwise we say w has infinite width . Define the width to be the least such m . Clearly, if G is finite we always have finite width bounded by | G | . . Theorem (Larsen, Shalev, Tiep) . . . For any w ̸ = 1 we have G = G w G w when G is a sufficiently large finite simple group. . . . . . The requirement of the size of G cannot be removed. . Corollary (Kassabov & Nikolov) . . . For any k, there exists a word w and a finite simple group G, such that w is not an identity in G, but G ̸ = G ∗ k w . . . . . . . . . . . .

  14. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Verbal Width Say w has finite width in G if there exists m such that = { g 1 ... g m : g i ∈ G ± 1 w ( G ) = G ∗ m w } . w Otherwise we say w has infinite width . Define the width to be the least such m . Clearly, if G is finite we always have finite width bounded by | G | . . Theorem (Larsen, Shalev, Tiep) . . . For any w ̸ = 1 we have G = G w G w when G is a sufficiently large finite simple group. . . . . . The requirement of the size of G cannot be removed. . Corollary (Kassabov & Nikolov) . . . For any k, there exists a word w and a finite simple group G, such that w is not an identity in G, but G ̸ = G ∗ k w . . . . . . . . . . . .

  15. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Question Fix a group G and let A be a subset of G . Does there exist a word w such that G w = A ? i.e. What are the verbal images of G ? Two necessary conditions: Clearly we must have e ∈ A (since w ( e , ..., e ) = e ). For every α ∈ Aut( G ), α ( A ) = A (since α ( w ( g 1 , ..., g k )) = w ( α ( g 1 ) , ..., α ( g k )) . If we assume G is a simple group, are these conditions sufficient? . . . . . .

  16. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Question Fix a group G and let A be a subset of G . Does there exist a word w such that G w = A ? i.e. What are the verbal images of G ? Two necessary conditions: Clearly we must have e ∈ A (since w ( e , ..., e ) = e ). For every α ∈ Aut( G ), α ( A ) = A (since α ( w ( g 1 , ..., g k )) = w ( α ( g 1 ) , ..., α ( g k )) . If we assume G is a simple group, are these conditions sufficient? . . . . . .

  17. Introduction Word maps The Simple Groups Images of Word Maps Other Groups . Question Fix a group G and let A be a subset of G . Does there exist a word w such that G w = A ? i.e. What are the verbal images of G ? Two necessary conditions: Clearly we must have e ∈ A (since w ( e , ..., e ) = e ). For every α ∈ Aut( G ), α ( A ) = A (since α ( w ( g 1 , ..., g k )) = w ( α ( g 1 ) , ..., α ( g k )) . If we assume G is a simple group, are these conditions sufficient? . . . . . .

  18. Introduction The Simple Groups Other Groups . The Simple Groups . Theorem (Lubotzky, June 2012) . . . Let G be a finite simple group and A a subset of G such that e ∈ A and for every α ∈ Aut(G), α ( A ) = A. Then there exists a word w ∈ F 2 such that G w = A. . . . . . . . . . . .

Recommend

On decomposition of factor maps between shift spaces on groups - Z to countable amenable groups

On decomposition of factor maps between shift spaces on groups - Z to countable amenable groups

On decomposition of factor maps between shift spaces on groups - Z to countable amenable groups (joint with Kevin McGoff (Charlotte, NC) and Ronnie Pavlov (Denver)) Uijin Jung Ajou University, South Korea Minisymposium on discrete dynamical

428 views • 22 slides
Coxeter groups and Artin groups Day 2: Symmetric Spaces and Simple Groups Jon McCammond (U.C.

Coxeter groups and Artin groups Day 2: Symmetric Spaces and Simple Groups Jon McCammond (U.C.

Coxeter groups and Artin groups Day 2: Symmetric Spaces and Simple Groups Jon McCammond (U.C. Santa Barbara) 1 Symmetric Spaces Def: A Riemannian manifold is called a symmetric space if at each point p there exists an isometry fixing p and

295 views • 25 slides
Surface maps into free groups Alden Walker November 10, 2014 Free groups A wedge X of two

Surface maps into free groups Alden Walker November 10, 2014 Free groups A wedge X of two

Surface maps into free groups Alden Walker November 10, 2014 Free groups A wedge X of two circles: a b Set F = 1 ( X ) = a , b . We write capital letters for inverse, so A = a 1 . e.g. ( abAABB ) 1 = bbaaBA Commutators Let x

728 views • 54 slides
Word posets, with applications to Coxeter groups Matthew J. Samuel Rutgers UniversityNew

Word posets, with applications to Coxeter groups Matthew J. Samuel Rutgers UniversityNew

Word posets, with applications to Coxeter groups Matthew J. Samuel Rutgers UniversityNew Brunswick WORDS 2011 Matthew J. Samuel Word posets, with applications to Coxeter groups Introduction Word posets are partially ordered sets that

563 views • 23 slides
Adventures! ! What did I learn last class? Use simple dictionaries Word Banks Word Walls Sound

Adventures! ! What did I learn last class? Use simple dictionaries Word Banks Word Walls Sound

Adventures! ! What did I learn last class? Use simple dictionaries Word Banks Word Walls Sound of the letters nn Adventures ! What will I learn today? Draw a picture of a story Descriptive adjectives Sounds of the letter MM

815 views • 50 slides
PRESENTATIONS OF FINITE SIMPLE GROUPS: A COMPUTATIONAL APPROACH R. M. GURALNICK, W. M. KANTOR, M.

PRESENTATIONS OF FINITE SIMPLE GROUPS: A COMPUTATIONAL APPROACH R. M. GURALNICK, W. M. KANTOR, M.

PRESENTATIONS OF FINITE SIMPLE GROUPS: A COMPUTATIONAL APPROACH R. M. GURALNICK, W. M. KANTOR, M. KASSABOV, AND A. LUBOTZKY Abstract. All nonabelian finite simple groups of rank n over a field of size q , with the possible exception of the Ree

614 views • 47 slides
What about maps in complex reflection groups? Guillaume Chapuy ( CNRS Universit e Paris 7)

What about maps in complex reflection groups? Guillaume Chapuy ( CNRS Universit e Paris 7)

What about maps in complex reflection groups? Guillaume Chapuy ( CNRS Universit e Paris 7) joint work Christian Stump ( Hannover ) Journ ees Cartes, June 2013. Factorizations of a Coxeter element in complex reflection groups

902 views • 64 slides
PRESENTATIONS OF FINITE SIMPLE GROUPS: A QUANTITATIVE APPROACH R. M. GURALNICK, W. M. KANTOR, M.

PRESENTATIONS OF FINITE SIMPLE GROUPS: A QUANTITATIVE APPROACH R. M. GURALNICK, W. M. KANTOR, M.

PRESENTATIONS OF FINITE SIMPLE GROUPS: A QUANTITATIVE APPROACH R. M. GURALNICK, W. M. KANTOR, M. KASSABOV, AND A. LUBOTZKY Abstract. There is a constant C 0 such that all nonabelian finite simple groups of rank n over F q , with the possible

837 views • 64 slides
Capturing data and use of GPS Capturing data GIS GPS Paper maps Coordinates Satellite images

Capturing data and use of GPS Capturing data GIS GPS Paper maps Coordinates Satellite images

Capturing data and use of GPS Capturing data GIS GPS Paper maps Coordinates Satellite images What is a GPS? Global Positioning System A network of satellites that continuosly transmit informations Making possible to identify locations How

579 views • 26 slides
A simple model of trees for unicellular maps Guillaume Chapuy ( LIAFA, Paris-VII) joint work with

A simple model of trees for unicellular maps Guillaume Chapuy ( LIAFA, Paris-VII) joint work with

A simple model of trees for unicellular maps Guillaume Chapuy ( LIAFA, Paris-VII) joint work with Valentin F eray ( LaBRI, Bordeaux-I) Eric Fusy ( LIX, Polytechnique) FPSAC, August 2012, Nagoya, Japan Unicellular maps (a.k.a.

631 views • 49 slides
Automorphism groups of edge-transitive maps (Pilsen 2016) Gareth Jones University of

Automorphism groups of edge-transitive maps (Pilsen 2016) Gareth Jones University of

Automorphism groups of edge-transitive maps (Pilsen 2016) Gareth Jones University of Southampton, UK October 9, 2016 Recent history In 1997 Graver and Watkins showed how edge-transitive maps M can be partitioned into 14 classes T . These are

386 views • 37 slides
Supercritical causal maps: geodesics and simple random walk Thomas Budzinski ENS Paris et

Supercritical causal maps: geodesics and simple random walk Thomas Budzinski ENS Paris et

Supercritical causal maps: geodesics and simple random walk Thomas Budzinski ENS Paris et Universit Paris Saclay Journe Cartes, Orsay 11 Avril 2018 Thomas Budzinski Supercritical causal maps Supercritical causal maps Let t be an infinite

799 views • 54 slides
J is for Compsci 201 Maps and Midterms Java A simple, object-oriented, distributed,

J is for Compsci 201 Maps and Midterms Java A simple, object-oriented, distributed,

J is for Compsci 201 Maps and Midterms Java A simple, object-oriented, distributed, interpreted, robust, secure, architecture-neutral, portable, high performance, multi-threaded, and dynamic language. Just in Time Teaching

153 views • 11 slides
On finite groups isospectral to simple groups Andrey Vasil ev Sobolev Institute of Mathematics

On finite groups isospectral to simple groups Andrey Vasil ev Sobolev Institute of Mathematics

On finite groups isospectral to simple groups Andrey Vasil ev Sobolev Institute of Mathematics Group Theory Conference in Honour of Victor Mazurov Novosibirsk, 2013 1 / 23 G is a finite group | G | is the order of G ( G ) is the set of

616 views • 23 slides
Section 4: Maps between groups Matthew Macauley Department of Mathematical Sciences Clemson

Section 4: Maps between groups Matthew Macauley Department of Mathematical Sciences Clemson

Section 4: Maps between groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Section 4: Maps between groups Math 4120, Modern

899 views • 51 slides
Augmented reality and perception of analogue and digital images and maps Piotr A. Werner Spatial

Augmented reality and perception of analogue and digital images and maps Piotr A. Werner Spatial

Augmented reality and perception of analogue and digital images and maps Piotr A. Werner Spatial Information Systems Laboratory Faculty of Geography &amp; Regional Studies University of Warsaw Warsaw, Poland email: peter@uw.edu.pl Augmented

638 views • 31 slides
Performance Eric McCreath Increasing Word Size A simple way of improving performance is to

Performance Eric McCreath Increasing Word Size A simple way of improving performance is to

Performance Eric McCreath Increasing Word Size A simple way of improving performance is to increase the data word size. This means that each instruction operates on a larger amount of data. This will involve more gates within the CPU. Also it

429 views • 9 slides
PRESENTATIONS OF FINITE SIMPLE GROUPS: PROFINITE AND COHOMOLOGICAL APPROACHES ROBERT GURALNICK,

PRESENTATIONS OF FINITE SIMPLE GROUPS: PROFINITE AND COHOMOLOGICAL APPROACHES ROBERT GURALNICK,

PRESENTATIONS OF FINITE SIMPLE GROUPS: PROFINITE AND COHOMOLOGICAL APPROACHES ROBERT GURALNICK, WILLIAM M. KANTOR, MARTIN KASSABOV, AND ALEXANDER LUBOTZKY Abstract. We prove the following three closely related results: (1) Every finite simple

661 views • 44 slides
Dynamics of Schwarz reflections: mating rational maps with groups (Joint with Seung-Yeop Lee,

Dynamics of Schwarz reflections: mating rational maps with groups (Joint with Seung-Yeop Lee,

Dynamics of Schwarz reflections: mating rational maps with groups (Joint with Seung-Yeop Lee, Mikhail Lyubich, and Nikolai Makarov) Sabyasachi Mukherjee Stony Brook University TCD 2019, Barcelona Quadrature Domains Every real-analytic

654 views • 48 slides
Simple Polyadic Groups H. Khodabandeh, M. Shahryari AAD May 2012 H. Khodabandeh, M. Shahryari

Simple Polyadic Groups H. Khodabandeh, M. Shahryari AAD May 2012 H. Khodabandeh, M. Shahryari

Simple Polyadic Groups C ES ME Simple Polyadic Groups H. Khodabandeh, M. Shahryari AAD May 2012 H. Khodabandeh, M. Shahryari Simple Polyadic Groups C ES ME Simple Polyadic Groups C ES ME A simple notation During

600 views • 26 slides
Simple nonunifilar binary word generators Sarah Marzen June 1, 2013 Outline Motivation

Simple nonunifilar binary word generators Sarah Marzen June 1, 2013 Outline Motivation

Simple nonunifilar binary word generators Sarah Marzen June 1, 2013 Outline Motivation Results Simple nonunifilar source (SNS) Variation on the SNS A different set of nonunifilar binary word generators (preliminary)

521 views • 29 slides
ON THE PRONORMALITY OF SUBGROUPS OF ODD INDICES IN FINITE SIMPLE GROUPS Natalia V. Maslova IMM

ON THE PRONORMALITY OF SUBGROUPS OF ODD INDICES IN FINITE SIMPLE GROUPS Natalia V. Maslova IMM

ON THE PRONORMALITY OF SUBGROUPS OF ODD INDICES IN FINITE SIMPLE GROUPS Natalia V. Maslova IMM UB RAS, UrFU Joint work with Anatoly Kondratev and Danila Revin Yekaterinburg, August 11, 2015 Natalia V. Maslova On the finite groups

476 views • 19 slides
Large element orders and the characteristic of finite simple symplectic and orthogonal groups

Large element orders and the characteristic of finite simple symplectic and orthogonal groups

Large element orders and the characteristic of finite simple symplectic and orthogonal groups Daniel Lytkin Novosibirsk State University Groups St Andrews 3rd 11th August 2013 Dan Lytkin (Novosibirsk) 1 / 10 Matrix group recognition

530 views • 38 slides
Simple Maps A Concept of Plain Cartography within a Mobile Context for Elderly Users Kovanen

Simple Maps A Concept of Plain Cartography within a Mobile Context for Elderly Users Kovanen

Simple Maps A Concept of Plain Cartography within a Mobile Context for Elderly Users Kovanen J., Oksanen J., Sarjakoski L. T. and T. Sarjakoski Finnish Geodetic Institute, P.O. Box 15, 02431 Masala, Finland firstname.lastname@fgi.fi Summary:

342 views • 5 slides

More recommend