On the isomorphism problem for Coxeter groups and related topics

Similar documents
On the isomorphism problem of Coxeter groups and related topics

RIGIDITY OF COXETER GROUPS AND ARTIN GROUPS

Lecture 2.3: Symmetric and alternating groups

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

Citation for published version (APA): Nutma, T. A. (2010). Kac-Moody Symmetries and Gauged Supergravity Groningen: s.n.

5 Symmetric and alternating groups

PD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction

THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS

Enumeration of Pin-Permutations

Primitive permutation groups with finite stabilizers

Permutations and codes:

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

An improvement to the Gilbert-Varshamov bound for permutation codes

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

Section II.9. Orbits, Cycles, and the Alternating Groups

Reflection group counting and q-counting

A Course in Model Theory

A Course in Model Theory

THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) Contents

Edge-disjoint tree representation of three tree degree sequences

Simple permutations and pattern restricted permutations

Permutation groups, derangements and prime order elements

Classes of permutations avoiding 231 or 321

A theorem on the cores of partitions

Finite homomorphism-homogeneous permutations via edge colourings of chains

EXPLAINING THE SHAPE OF RSK

Generating indecomposable permutations

Pin-Permutations and Structure in Permutation Classes

arxiv: v1 [math.co] 11 Jul 2016

The Relationship between Permutation Groups and Permutation Polytopes

On uniquely k-determined permutations

A FAMILY OF t-regular SELF-COMPLEMENTARY k-hypergraphs. Communicated by Behruz Tayfeh Rezaie. 1. Introduction

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel

σ-coloring of the Monohedral Tiling

Biembeddings of Latin squares and Hamiltonian decompositions

The Perfect Binary One-Error-Correcting Codes of Length 15: Part I Classification

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA

Permutations with short monotone subsequences

Transitivity Action of A n on (n=4,5,6,7) on Unordered and Ordered Quadrupples

Graduate Texts in Mathematics. Editorial Board. F. W. Gehring P. R. Halmos Managing Editor. c. C. Moore

Asymptotic and exact enumeration of permutation classes

THE SIGN OF A PERMUTATION

THE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n. Communicated by S. Alikhani

Math 3560 HW Set 6. Kara. October 17, 2013

#A2 INTEGERS 18 (2018) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.

Combinatorics in the group of parity alternating permutations

Universal Cycles for Permutations Theory and Applications

A Course in Model Theory I:

Domination game and minimal edge cuts

A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs

Permutation Groups. Definition and Notation

Connected Permutations, Hypermaps and Weighted Dyck Words. Robert Cori Mini course, Maps Hypermaps february 2008

UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun

A combinatorial proof for the enumeration of alternating permutations with given peak set

Some Fine Combinatorics

Corners in Tree Like Tableaux

Some t-homogeneous sets of permutations

A stack and a pop stack in series

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

The Place of Group Theory in Decision-Making in Organizational Management A case of 16- Puzzle

A Complete Characterization of Maximal Symmetric Difference-Free families on {1, n}.

Analysis on the Properties of a Permutation Group

Evacuation and a Geometric Construction for Fibonacci Tableaux

On k-crossings and k-nestings of permutations

TOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1

EQUIPOPULARITY CLASSES IN THE SEPARABLE PERMUTATIONS

Introduction to Computational Manifolds and Applications

Universal graphs and universal permutations

Bibliography. S. Gill Williamson

The Sign of a Permutation Matt Baker

The number of mates of latin squares of sizes 7 and 8

ON SOME PROPERTIES OF PERMUTATION TABLEAUX

Permutations. = f 1 f = I A

A Few More Large Sets of t-designs

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

Permutation Tableaux and the Dashed Permutation Pattern 32 1

Symmetric Permutations Avoiding Two Patterns

CARD GAMES AND CRYSTALS

The Möbius function of separable permutations (extended abstract)

The E-series, Happel-Seidel symmetry, and Orlov s theorem

18 Completeness and Compactness of First-Order Tableaux

Reflections on the N + k Queens Problem

The Tiling Problem. Nikhil Gopalkrishnan. December 08, 2008

Unique Sequences Containing No k-term Arithmetic Progressions

Exploiting the disjoint cycle decomposition in genome rearrangements

Measure Preserving Isomorphisms

Zsombor Sárosdi THE MATHEMATICS OF SUDOKU

Perfect Octagon Quadrangle Systems with an upper C 4 -system and a large spectrum

COMBINATORICS ON BIGRASSMANNIAN PERMUTATIONS AND ESSENTIAL SETS

1.6 Congruence Modulo m

SUDOKU Colorings of the Hexagonal Bipyramid Fractal

Faithful Representations of Graphs by Islands in the Extended Grid

Received: 10/24/14, Revised: 12/8/14, Accepted: 4/11/15, Published: 5/8/15

CURRICULUM VITAE Dana P. Williams

Non-overlapping permutation patterns

On uniquely k-determined permutations

Cyclic, f-cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge.

Enumeration of Two Particular Sets of Minimal Permutations

Transcription:

On the isomorphism problem for Coxeter groups and related topics Koji Nuida (AIST, Japan) Groups and Geometries @Bangalore, Dec. 18 & 20, 2012 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 1/68

Contents of This Talk A survey of results on the isomorphism problem for Coxeter groups forgotten subject until about 15 years ago active subject in recent years Some relevant results on group theory on Coxeter groups finitely or non-finitely generated cases Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 2/68

Outline Preliminaries 1 Preliminaries 2 3 4 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 3/68

Preliminaries Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 4/68

Isomorphism Problem Given presentations of two mathematical objects in a class, decide whether these are isomorphic or not Here we do not concern computability, especially when studying infinite presentations Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 5/68

Isomorphism Problem for Groups General groups (of finite presentations): Uncomputable Finitely generated abelian groups: Textbook Free groups... Coxeter groups Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 6/68

Coxeter Groups Preliminaries W is a Coxeter group ((W, S) is a Coxeter system) def Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 7/68

Coxeter Groups Preliminaries W is a Coxeter group ((W, S) is a Coxeter system) Generators: s S (possibly S = ) def Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 7/68

Coxeter Groups Preliminaries W is a Coxeter group ((W, S) is a Coxeter system) Generators: s S (possibly S = ) Fundamental relations: def Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 7/68

Coxeter Groups Preliminaries W is a Coxeter group ((W, S) is a Coxeter system) Generators: s S (possibly S = ) Fundamental relations: s 2 = 1 ( s S) def Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 7/68

Coxeter Groups Preliminaries W is a Coxeter group ((W, S) is a Coxeter system) Generators: s S (possibly S = ) Fundamental relations: s 2 = 1 ( s S) (st) m(s,t) = 1 ( s t S), where 2 m(s, t) = m(t, s) relations with m(s, t) = are ignored Such a presentation is expressed by a Coxeter graph def Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 7/68

Examples Preliminaries W = D m = W (I 2 (m)) (symmetry group of regular m-gon) S = {s, t}, m(s, t) = m with 3 m < s m t Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 8/68

Examples Preliminaries W = D = W (Ã1) (infinite dihedral group) S = {s, t}, m(s, t) = s t Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 9/68

Examples Preliminaries W = S n = W (A n 1 ) (symmetric group on n letters) S = {s 1, s 2,..., s n 1 }, s i = (i i + 1) m(s i, s i+1 ) = 3, m(s i, s j ) = 2 (if i j 2) s 1 s 2 s 3 s n 2 s n 1 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 10/68

Examples Preliminaries W = limit of S 2 S 3 S 4 (Here we call it W (A )) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 11/68

Examples Preliminaries W = limit of S 2 S 3 S 4 (Here we call it W (A )) There are another embeddings S 2 S 3 S 4 (Here we call the limit W (A, )) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 11/68

Examples Preliminaries W = PGL(2, Z) = GL(2, Z)/{±1} ( ) 1 0 S = {s 1, s 2, s 3 } = {, 0 1 ( ) 1 1, 0 1 m(s 1, s 2 ) =, m(s 1, s 3 ) = 2, m(s 2, s 3 ) = 3 s 1 s 2 s 3 ( ) 0 1 } 1 0 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 12/68

Direct/Free Product Decompositions If S = S 1 S 2 (disjoint) and m(s 1, s 2 ) = 2 ( s 1 S 1, s 2 S 2 ), then W = S 1 S 2 ; m(s 1, s 2 ) = ( s 1 S 1, s 2 S 2 ), then W = S 1 S 2 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 13/68

Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 14/68

Isomorphism Problem for Coxeter Groups Problem Given two Coxeter graphs Γ 1, Γ 2, decide whether W (Γ 1 ) W (Γ 2 ) (as abstract groups) or not Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 15/68

Isomorphism Problem for Coxeter Groups Problem Given two Coxeter graphs Γ 1, Γ 2, decide whether W (Γ 1 ) W (Γ 2 ) (as abstract groups) or not or: Given a Coxeter group W, determine the possible Coxeter generating sets S for W (or the types of (W, S)) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 15/68

Rigid Coxeter Groups W (Γ) is rigid def W (Γ ) W (Γ) implies Γ Γ Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 16/68

Rigid Coxeter Groups W (Γ) is rigid def W (Γ ) W (Γ) implies Γ Γ W is strongly rigid def all Coxeter generating sets for W are conjugate with each other Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 16/68

Rigid Coxeter Groups W (Γ) is rigid def W (Γ ) W (Γ) implies Γ Γ W is strongly rigid def all Coxeter generating sets for W are conjugate with each other Notes: strongly rigid rigid difference of two properties outer automorphisms of W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 16/68

Folklore Non-Rigid Example ( ) ( ) 6 W W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 17/68

Non-Rigid Examples (Finite Cases) ( ) ( ) 4k + 2 W W 2k + 1 ( ) ( ) 4 W W }{{} 2k+1 vertices }{{} 2k+1 vertices These are only non-rigid finite irreducible Coxeter groups Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 18/68

Krull Remak Schmidt-like Property Write W = W fin W inf, where W fin : Product of finite irreducible components W inf : Product of other components Fact [N. 2006] The subset W fin is uniquely determined by W, independent of S (possibly when S = ) K. Nuida, On the direct indecomposability of infinite irreducible Coxeter groups and the isomorphism problem of Coxeter groups, Comm. Algebra 34(7) (2006) pp.2559 2595 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 19/68

Krull Remak Schmidt-like Property Fact If W is infinite and irreducible, then W is directly indecomposabie (as an abstract group) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 20/68

Krull Remak Schmidt-like Property Fact If W is infinite and irreducible, then W is directly indecomposabie (as an abstract group) [Paris 2004 (preprint)] for S < extended in [Paris 2007] to finite index subgroups of W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 20/68

Krull Remak Schmidt-like Property Fact If W is infinite and irreducible, then W is directly indecomposabie (as an abstract group) [Paris 2004 (preprint)] for S < extended in [Paris 2007] to finite index subgroups of W [N. 2006] for general cases Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 20/68

Krull Remak Schmidt-like Property Fact If W is infinite and irreducible, then W is directly indecomposabie (as an abstract group) [Paris 2004 (preprint)] for S < extended in [Paris 2007] to finite index subgroups of W [N. 2006] for general cases (Note: [Mihalik Ratcliffe Tschantz 2005 (preprint)] showed free product decomposition version of the fact) L. Paris, Irreducible Coxeter groups, Int. J. Algebra Comput. 17(3) (2007) 427 447 M. Mihalik, J. Ratcliffe, S. Tschantz, On the isomorphism problem for finitely generated Coxeter groups. I: Basic matching, arxiv:math.gr/0501075v1 (2005) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 20/68

Krull Remak Schmidt-like Property Tool in [Paris 2004]: Essential elements in W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 21/68

Krull Remak Schmidt-like Property Tool in [Paris 2004]: Essential elements in W def not contained in any parabolic H W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 21/68

Krull Remak Schmidt-like Property Tool in [Paris 2004]: Essential elements in W def not contained in any parabolic H W cannot be used when S = (there are no essential elements!) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 21/68

Krull Remak Schmidt-like Property Tool in [Paris 2004]: Essential elements in W def not contained in any parabolic H W cannot be used when S = (there are no essential elements!) Tool in [N. 2006]: centralizers of normal subgroups generated by involutions in W 1 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 21/68

Krull Remak Schmidt-like Property Tool in [Paris 2004]: Essential elements in W def not contained in any parabolic H W cannot be used when S = (there are no essential elements!) Tool in [N. 2006]: centralizers of normal subgroups generated by involutions in W 1 If W = H 1 H 2, then H j are generated by involutions 2 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 21/68

Krull Remak Schmidt-like Property Tool in [Paris 2004]: Essential elements in W def not contained in any parabolic H W cannot be used when S = (there are no essential elements!) Tool in [N. 2006]: centralizers of normal subgroups generated by involutions in W 1 If W = H 1 H 2, then H j are generated by involutions 2 Key Fact If H W is generated by involutions, then its centralizer Z W (H) is either W or too small 3 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 21/68

Krull Remak Schmidt-like Property Tool in [Paris 2004]: Essential elements in W def not contained in any parabolic H W cannot be used when S = (there are no essential elements!) Tool in [N. 2006]: centralizers of normal subgroups generated by involutions in W 1 If W = H 1 H 2, then H j are generated by involutions 2 Key Fact If H W is generated by involutions, then its centralizer Z W (H) is either W or too small 3 Since H j Z W (H 3 j ), at least one of H j should be W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 21/68

Krull Remak Schmidt-like Property Theorem [N. 2006] (informal) Any f : W W is approximately decomposed into isomorphisms between infinite irreducible components of W and W, and an isomorphism W fin W fin Hence the isomorphism problem (including the case S = ) is essentially reduced to infinite irreducible cases Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 22/68

A Natural Question [Cohen 1991] Is the isomorphism problem for irreducible, finite-rank Coxeter groups trivial? I.e., does W (Γ) W (Γ ), with Γ, Γ finite and connected, imply Γ Γ? A. M. Cohen, Coxeter groups and three related topics, in: Generators and Relations in Groups and Geometries (A. Barlotti et al., eds.), NATO ASI Series, Kluwer Acad. Publ. (1991) pp.235 278 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 23/68

A Counterexample [Mühlherr 2000] (1-page paper!) ( ) ( ) W W B. Mühlherr, On isomorphisms between Coxeter groups, Des. Codes Cryptogr. 21 (2000) p.189 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 24/68

Rigidity and Reflections w W is a reflection def conjugate to an s S Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 25/68

Rigidity and Reflections w W is a reflection def conjugate to an s S in the standard geometric representation of W, w acts as a reflection w.r.t. a hyperplane Ref(W ) = Ref S (W ) := {s w := wsw 1 s S, w W }: set of reflections Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 25/68

Rigidity and Reflections W (Γ) is reflection rigid def f : W (Γ ) W (Γ) and f (Ref(W (Γ ))) = Ref(W (Γ)) implies Γ Γ Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 26/68

Rigidity and Reflections W (Γ) is reflection rigid def f : W (Γ ) W (Γ) and f (Ref(W (Γ ))) = Ref(W (Γ)) implies Γ Γ W is strongly reflection rigid def all Coxeter generating sets for W defining the same set of reflections are conjugate with each other strongly rigid rigid Note: strongly reflection rigid reflection rigid Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 26/68

Rigidity and Reflections Rigidity and strong reflection rigidity are incomparable D 6 = W (I 2 (6)) is strongly reflection rigid, but not rigid D 5 = W (I 2 (5)) is rigid, but not strongly reflection rigid [Brady McCammond Mühlherr Neumann 2002] N. Brady, J. P. McCammond, B. Mühlherr, W. D. Neumann, Rigidity of Coxeter groups and Artin groups, Geom. Dedicata 94 (2002) pp.91 109 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 27/68

Rigidity and Reflections W is reflection independent by W (independent of S) def Ref S (W ) is uniquely determined Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 28/68

Rigidity and Reflections W is reflection independent by W (independent of S) def Ref S (W ) is uniquely determined Note: (strongly) reflection rigid & reflection independent (strongly) rigid Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 28/68

Rigidity and Reflections W is reflection independent by W (independent of S) def Ref S (W ) is uniquely determined Note: (strongly) reflection rigid & reflection independent (strongly) rigid Intuitively, the isomorphism problem can be divided into two parts Given W, how far from being reflection independent? Given W, how far from being reflection rigid? Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 28/68

Rigidity and Reflections [Bahls Mihalik 2005] ( S < ) Reflection independent & even ( def m(s, t) is not odd ( s t)) rigid Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 29/68

Rigidity and Reflections [Bahls Mihalik 2005] ( S < ) Reflection independent & even ( def m(s, t) is not odd ( s t)) rigid Counterexample for non-even case: Mühlherr s example [Bahls 2003] W is reflection independent if s, t s.t., m(s, t) 2 (mod 4) P. Bahls, M. Mihalik, Reflection independence in even Coxeter groups, Geom. Dedicata 110 (2005) pp.63 80 P. Bahls, A new class of rigid Coxeter groups, Int. J. Algebra Comput. 13(1) (2003) pp.87 94 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 29/68

( S < ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 30/68

Strongly Rigidity: Geometric Arguments [Charney Davis 2000] W is strongly rigid if W is capable of acting effectively, properly and cocompactly on some contractible manifold Affine Weyl groups Cocompact hyperbolic reflection groups... Tool: complex, cohomology, CAT(0) space, etc. (Detail omitted (due to lack of my geometric knowledge...)) R. Charney, M. Davis, When is a Coxeter system determined by its Coxeter group?, J. London Math. Soc. (2) 61 (2000) pp.441 461 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 31/68

Strongly Rigidity: Geometric Arguments State-of-the-art result in this direction: Theorem [Caprace Przytycki 2011] Bipolar Coxeter groups are strongly rigid, where Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 32/68

Strongly Rigidity: Geometric Arguments State-of-the-art result in this direction: Theorem [Caprace Przytycki 2011] Bipolar Coxeter groups are strongly rigid, where def (W, S) is bipolar in the Cayley graph X of (W, S), s S, any tubular neighbourhood of the s-invariant wall separates X into exactly two connected components Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 32/68

Strongly Rigidity: Geometric Arguments State-of-the-art result in this direction: Theorem [Caprace Przytycki 2011] Bipolar Coxeter groups are strongly rigid, where def (W, S) is bipolar in the Cayley graph X of (W, S), s S, any tubular neighbourhood of the s-invariant wall separates X into exactly two connected components Precise definition and Coxeter graph characterization for bipolar Coxeter groups are also given P.-E. Caprace, P. Przytycki, Bipolar Coxeter groups, J. Algebra 338 (2011) pp.35 55 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 32/68

Strongly Rigidity: Geometric Arguments Bipolar Coxeter groups include the following cases Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 33/68

Strongly Rigidity: Geometric Arguments Bipolar Coxeter groups include the following cases [Charney Davis 2000] Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 33/68

Strongly Rigidity: Geometric Arguments Bipolar Coxeter groups include the following cases [Charney Davis 2000] virtual Poincaré duality groups Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 33/68

Strongly Rigidity: Geometric Arguments Bipolar Coxeter groups include the following cases [Charney Davis 2000] virtual Poincaré duality groups infinite irreducible 2-spherical ( def m(s, t) < ( s, t)) [Franzsen Howlett Mühlherr 2006; Caprace Mühlherr 2007] a subclass appeared in [Kaul 2002] W. N. Franzsen, R. B. Howlett, B. Mühlherr, Reflections in abstract Coxeter groups, Comment. Math. Helv. 81 (2006) pp.665 697 P.-E. Caprace, B. Mühlherr, Reflection rigidity of 2-spherical Coxeter groups, Proc. London Math. Soc. (3) 94 (2007) pp.520 542 A. Kaul, A class of rigid Coxeter groups, J. London Math. Soc. (2) 66 (2002) pp.592 604 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 33/68

Maximal Finite Subgroups def H W is standard parabolic H = W I := I for some I S def H W is parabolic conjugate to some W I Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 34/68

Maximal Finite Subgroups def H W is standard parabolic H = W I := I for some I S def H W is parabolic conjugate to some W I Facts: Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 34/68

Maximal Finite Subgroups def H W is standard parabolic H = W I := I for some I S def H W is parabolic conjugate to some W I Facts: Any finite intersection of parabolic subgroups is parabolic Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 34/68

Maximal Finite Subgroups def H W is standard parabolic H = W I := I for some I S def H W is parabolic conjugate to some W I Facts: Any finite intersection of parabolic subgroups is parabolic Any finite H W is contained in a maximal finite G W, which is parabolic Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 34/68

Maximal Finite Subgroups def H W is standard parabolic H = W I := I for some I S def H W is parabolic conjugate to some W I Facts: Any finite intersection of parabolic subgroups is parabolic Any finite H W is contained in a maximal finite G W, which is parabolic Any maximal finite standard parabolic subgroup is a maximal finite subgroup Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 34/68

Maximal Finite Subgroups Application: A strategy to show that f : W W maps s S into Ref(W ) 1 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 35/68

Maximal Finite Subgroups Application: A strategy to show that f : W W maps s S into Ref(W ) 1 Find a finite number of I j S s.t. W Ij are maximal finite standard parabolic and j I j = {s} 2 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 35/68

Maximal Finite Subgroups Application: A strategy to show that f : W W maps s S into Ref(W ) 1 Find a finite number of I j S s.t. W Ij are maximal finite standard parabolic and j I j = {s} 2 s = j W I j is the intersection of maximal finite subgroups 3 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 35/68

Maximal Finite Subgroups Application: A strategy to show that f : W W maps s S into Ref(W ) 1 Find a finite number of I j S s.t. W Ij are maximal finite standard parabolic and j I j = {s} 2 s = j W I j is the intersection of maximal finite subgroups 3 so is f (s) = j f (W I j ) 4 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 35/68

Maximal Finite Subgroups Application: A strategy to show that f : W W maps s S into Ref(W ) 1 Find a finite number of I j S s.t. W Ij are maximal finite standard parabolic and j I j = {s} 2 s = j W I j is the intersection of maximal finite subgroups 3 so is f (s) = j f (W I j ) 4 each f (W Ij ) is parabolic, so is f (s) 5 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 35/68

Maximal Finite Subgroups Application: A strategy to show that f : W W maps s S into Ref(W ) 1 Find a finite number of I j S s.t. W Ij are maximal finite standard parabolic and j I j = {s} 2 s = j W I j is the intersection of maximal finite subgroups 3 so is f (s) = j f (W I j ) 4 each f (W Ij ) is parabolic, so is f (s) 5 hence f (s) is conjugate to some s S, i.e., f (s) Ref(W ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 35/68

Maximal Finite Subgroups Some results using maximal finite subgroups: [Radcliffe 2001] W is rigid if W is right-angled ( def m(s, t) {2, } ( s t)) [Hosaka 2006] generalized to a wider class D. G. Radcliffe, Unique presentation of Coxeter groups and related groups, Ph.D. thesis, Univ. Wisconsin-Milwaukee (2001) T. Hosaka, A class of rigid Coxeter groups, Houston J. Math. 32(4) (2006) pp.1029 1036 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 36/68

Maximal Finite Subgroups Notes: Radcliffe mentioned (without proof) that the rank may be infinite [Radcliffe 2003] extended to graph products of directly indecomposable groups [Castella 2006] gave a new proof, with structural result on Aut(W ) D. G. Radcliffe, Rigidity of graph products of groups, Algebraic & Geom. Top. 3 (2003) pp.1079 1088 A. Castella, Sur les automorphismes et la rigidité des groupes de Coxeter à angles droits, J. Algebra 301 (2006) pp.642 669 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 37/68

Maximal Finite Subgroups The above strategy to show f (s) Ref(W ) can be enhanced Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 38/68

Maximal Finite Subgroups The above strategy to show f (s) Ref(W ) can be enhanced by using maximal finite subgroups, instead of maximal finite standard parabolic subgroups FC(w) := {H w H W maximal finite} (finite continuation of w W ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 38/68

Maximal Finite Subgroups The above strategy to show f (s) Ref(W ) can be enhanced by using maximal finite subgroups, instead of maximal finite standard parabolic subgroups FC(w) := {H w H W maximal finite} (finite continuation of w W ) FC(s) is determined for every s S [Franzsen et al. 2006] Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 38/68

Maximal Finite Subgroups The above strategy to show f (s) Ref(W ) can be enhanced by using maximal finite subgroups, instead of maximal finite standard parabolic subgroups FC(w) := {H w H W maximal finite} (finite continuation of w W ) FC(s) is determined for every s S [Franzsen et al. 2006] Example: For infinite irreducible 2-spherical (W, S), FC(s) = s for every s S Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 38/68

Maximal Finite Subgroups The above strategy to show f (s) Ref(W ) can be enhanced by using maximal finite subgroups, instead of maximal finite standard parabolic subgroups FC(w) := {H w H W maximal finite} (finite continuation of w W ) FC(s) is determined for every s S [Franzsen et al. 2006] Example: For infinite irreducible 2-spherical (W, S), FC(s) = s for every s S hence W is reflection independent Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 38/68

Maximal Finite Subgroups The above strategy to show f (s) Ref(W ) can be enhanced by using maximal finite subgroups, instead of maximal finite standard parabolic subgroups FC(w) := {H w H W maximal finite} (finite continuation of w W ) FC(s) is determined for every s S [Franzsen et al. 2006] Example: For infinite irreducible 2-spherical (W, S), FC(s) = s for every s S hence W is reflection independent [Caprace Mühlherr 2007] W is strongly reflection rigid, hence strongly rigid Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 38/68

Relations with Even Orders [Radcliffe 2001] W is rigid if m(s, t) {2, } 4Z ( s t) Tool: projection to abelianization of W [Brady et al. 2002] W (Γ) is reflection rigid if it is even D. G. Radcliffe, Unique presentation of Coxeter groups and related groups, Ph.D. thesis, Univ. Wisconsin-Milwaukee (2001) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 39/68

Relations with Even Orders [Bahls Mihalik 2005] gave characterizations of reflection independent cases among even Coxeter systems even Coxeter systems having other non-even generating set Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 40/68

Relations with Even Orders [Bahls Mihalik 2005] gave characterizations of reflection independent cases among even Coxeter systems even Coxeter systems having other non-even generating set [Mihalik 2007] gave an algorithm to determine possible types of generating sets for W, when W is even Hence the isomorphism problem is solved for even Coxeter systems M. Mihalik, The even isomorphism theorem for Coxeter groups, Trans. AMS 359(9) (2007) pp.4297 4324 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 40/68

Diagram Twisting Recall the example in [Mühlherr 2000] ( ) ( ) W W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 41/68

Diagram Twisting [Brady et al. 2002] generalized as diagram twisting to generate non-reflection-rigid examples Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 42/68

Diagram Twisting [Brady et al. 2002] generalized as diagram twisting to generate non-reflection-rigid examples Let U, V S be disjoint subsets with the conditions: W V is finite, with longest element w = w V if s 1 S \ (U V ) is adjacent to V, then m(s 1, s 2 ) = ( s 2 U) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 42/68

Diagram Twisting [Brady et al. 2002] generalized as diagram twisting to generate non-reflection-rigid examples Let U, V S be disjoint subsets with the conditions: W V is finite, with longest element w = w V if s 1 S \ (U V ) is adjacent to V, then m(s 1, s 2 ) = ( s 2 U) Then (W, S ) is a Coxeter system with Coxeter graph Γ, where S := (S \ U) U w Ref S (W ), U w := {u w u U} Γ is obtained from Γ by replacing each edge U u v V with an edge from u w U w to v w V Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 42/68

Diagram Twisting Example: 2 2 ( ) ( ) W 2 W 2 2 : Elements of V : Element of U (or U w ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 43/68

Diagram Twisting Conjecture [Brady et al. 2002] Coxeter systems are reflection rigid up to diagram twistings, i.e., if Ref S (W ) = Ref S (W ), then Γ(W, S) is converted to Γ(W, S ) by consecutive diagram twistings Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 44/68

Diagram Twisting Positive results on the conjecture: Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 45/68

Diagram Twisting Positive results on the conjecture: They proved the conjecture when the presentation graph (i.e., s, t S are joined when m(s, t) < ) is a tree Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 45/68

Diagram Twisting Positive results on the conjecture: They proved the conjecture when the presentation graph (i.e., s, t S are joined when m(s, t) < ) is a tree [Mühlherr Weidmann 2002] proved the conjecture for skew-angled cases ( def m(s, t) 3 ( s, t)) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 45/68

Diagram Twisting Positive results on the conjecture: They proved the conjecture when the presentation graph (i.e., s, t S are joined when m(s, t) < ) is a tree [Mühlherr Weidmann 2002] proved the conjecture for skew-angled cases ( def m(s, t) 3 ( s, t)) They also characterized reflection independent skew-angled cases, and gave a sufficient condition for strongly rigid skew-angled cases B. Mühlherr, R. Weidmann, Rigidity of skew-angled Coxeter groups, Adv. Geom. 2 (2002) pp.391 415 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 45/68

Diagram Twisting But there is a counterexample! [Ratcliffe Tschantz 2008] ( ) ( ) W W 5 5 by another kind of transformation, called 5-edge angle deformation J. G. Ratcliffe, S. T. Tschantz, Chordal Coxeter groups, Geom. Dedicata 136 (2008) pp.57 77 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 46/68

Some More Solved Cases def (W, S) is chordal every cycle of length 4 in the presentation graph of (W, S) has a shortcutting edge Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 47/68

Some More Solved Cases def (W, S) is chordal every cycle of length 4 in the presentation graph of (W, S) has a shortcutting edge Results by [Ratcliffe Tschantz 2008] The chordal property is independent of the choice of S An algorithm to decide whether or not two Chordal W (Γ), W (Γ ) are isomorphic; hence the isomorphism problem is solved for chordal cases Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 47/68

Some More Solved Cases (W, S) is twist-rigid def it admits no diagram twists Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 48/68

Some More Solved Cases (W, S) is twist-rigid def it admits no diagram twists Results by [Caprace Przytycki 2010] The twist-rigidity is independent of the choice of S An algorithm to output all possible Γ with W (Γ ) W (Γ) from given twist-rigid W (Γ); hence the isomorphism problem is solved for twist-rigid cases P.-E. Caprace, P. Przytycki, Twist-rigid Coxeter groups, Geom. Topology 14 (2010) pp.2243 2275 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 48/68

Reduction to Reflection-Preserving Cases [Hosaka 2005] studied 2-dimensional (W, S) ( def W I = for every I S with I > 2) the Davis Vinberg complex Σ(W, S) has dimension 2 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 49/68

Reduction to Reflection-Preserving Cases [Hosaka 2005] studied 2-dimensional (W, S) ( def W I = for every I S with I > 2) the Davis Vinberg complex Σ(W, S) has dimension 2 Theorem If (W, S) and (W, S ) are 2-dimensional, then (W, S) can be converted to (W, S ) s.t. Γ(W, S) Γ(W, S ) and Ref S (W ) = Ref S (W ) Hence the isomorphism problem for 2-dimensional (W, S) is reduced to reflection-preserving cases T. Hosaka, Coxeter systems with two-dimensional Davis Vinberg complexes, J. Pure Appl. Algebra 197 (2005) pp.159 170 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 49/68

Reduction to Reflection-Preserving Cases Results on general cases by [Howlett Mühlherr 2004 (preprint)]; cf. [Mühlherr 2006] Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 50/68

Reduction to Reflection-Preserving Cases Results on general cases by [Howlett Mühlherr 2004 (preprint)]; cf. [Mühlherr 2006] s S is a pseudo-transposition def s J S s.t. for each t S \ J, either m(s, t) = or t Z W (J) either Γ J = Γ J = Γ(I 2 (4k + 2)), or Γ J = Γ(B 2k+1 ) and s is the end vertex of Γ J adjacent to the 4-edge R. B. Howlett, B. Mühlherr, Isomorphisms of Coxeter groups which do not preserve reflections, preprint (2004) B. Mühlherr, The isomorphism problem for Coxeter groups, in: The Coxeter legacy (C. Davis, E. W. Ellers, eds.), AMS (2006) pp.1 15 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 50/68

Reduction to Reflection-Preserving Cases Recall the following relations: ( ) ( ) 4k + 2 2k + 1 W W ( ) ( ) 4 W W }{{} 2k+1 vertices }{{} 2k+1 vertices Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 51/68

Reduction to Reflection-Preserving Cases Then the pseudo-transposition can be removed by locally applying the relations W (I 2 (4k + 2)) W (A 1 I 2 (2k + 1)) and W (B 2k+1 ) W (A 1 D 2k+1 ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 52/68

Reduction to Reflection-Preserving Cases Then the pseudo-transposition can be removed by locally applying the relations W (I 2 (4k + 2)) W (A 1 I 2 (2k + 1)) and W (B 2k+1 ) W (A 1 D 2k+1 ) Iterating the process, we can convert (W, S) into (W, S ) having no pseudo-transpositions (called reduced Coxeter system) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 52/68

Reduction to Reflection-Preserving Cases Theorem For a reduced (W, S), there is a finite Σ Aut(W ) (determined by using finite continuations) s.t. Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 53/68

Reduction to Reflection-Preserving Cases Theorem For a reduced (W, S), there is a finite Σ Aut(W ) (determined by using finite continuations) s.t. if (W, S ) is reduced and f : W W, then f (σ(s)) Ref S (W ) for some σ Σ Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 53/68

Reduction to Reflection-Preserving Cases Theorem For a reduced (W, S), there is a finite Σ Aut(W ) (determined by using finite continuations) s.t. if (W, S ) is reduced and f : W W, then f (σ(s)) Ref S (W ) for some σ Σ Hence the isomorphism problem is reduced to reflection-preserving cases: Given W (Γ) and W (Γ ), 1 first convert them into reduced W (Γ ) and W (Γ ) 2 then for all (finitely many) σ Σ, decide whether or not ϕ: σ(w (Γ )) W (Γ ) with ϕ(ref(σ(w (Γ )))) = Ref(W (Γ )) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 53/68

Further Reduction Theorem [Marquis Mühlherr 2008] The isomorphism problem is reduced to the following problem: Given (W, S), find all S Ref S (W ) s.t. (W, S ) is a Coxeter system and S is sharp-angled w.r.t. S S is sharp-angled w.r.t. S def for all s, t S with m(s, t) <, {s, t} is conjugate to a subset of S Note: This is used by [Caprace Przytycki 2010] to give the complete solution for twist-rigid cases T. Marquis, B. Mühlherr, Angle-deformations in Coxeter groups, Algebraic & Geom. Top. 8 (2008) pp.2175 2208 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 54/68

Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 55/68

When S = Preliminaries Several key properties in finite rank cases do not hold when S =! Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 56/68

When S = Preliminaries Several key properties in finite rank cases do not hold when S =! Maximal finite (standard parabolic) subgroups do not necessarily exist Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 56/68

When S = Preliminaries Several key properties in finite rank cases do not hold when S =! Maximal finite (standard parabolic) subgroups do not necessarily exist Finite continuation is not well-defined in general Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 56/68

When S = Preliminaries Several key properties in finite rank cases do not hold when S =! Maximal finite (standard parabolic) subgroups do not necessarily exist Finite continuation is not well-defined in general The intersection of infinitely many parabolic subgroups is not necessarily parabolic Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 56/68

Centralizers and Reflection Independence [N. 2007] An alternative strategy to show that f : W W maps s S into Ref(W ) 1 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 57/68

Centralizers and Reflection Independence [N. 2007] An alternative strategy to show that f : W W maps s S into Ref(W ) 1 We may assume WLOG that f (s) is the central longest element of a finite W J, J S 2 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 57/68

Centralizers and Reflection Independence [N. 2007] An alternative strategy to show that f : W W maps s S into Ref(W ) 1 We may assume WLOG that f (s) is the central longest element of a finite W J, J S 2 f induces Z W (s) Z W (f (s)) = N W (W J ) 3 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 57/68

Centralizers and Reflection Independence [N. 2007] An alternative strategy to show that f : W W maps s S into Ref(W ) 1 We may assume WLOG that f (s) is the central longest element of a finite W J, J S 2 f induces Z W (s) Z W (f (s)) = N W (W J ) 3 This implies f ( s (W s ) fin ) W J, where W s is the subgroup generated by reflections orthogonal to s 4 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 57/68

Centralizers and Reflection Independence [N. 2007] An alternative strategy to show that f : W W maps s S into Ref(W ) 1 We may assume WLOG that f (s) is the central longest element of a finite W J, J S 2 f induces Z W (s) Z W (f (s)) = N W (W J ) 3 This implies f ( s (W s ) fin ) W J, where W s is the subgroup generated by reflections orthogonal to s 4 If (W s ) fin = 1, then J = 1, i.e., f (s) Ref(W ) The same conclusion holds when (W s ) fin = s w, w W K. Nuida, Almost central involutions in split extensions of Coxeter groups by graph automorphisms, J. Group Theory 10 (2) (2007) pp.139 166 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 57/68

Centralizers and Reflection Independence Theorem [N. 2006 (preprint)] Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68

Centralizers and Reflection Independence Theorem [N. 2006 (preprint)] (W s ) fin is completely determined Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68

Centralizers and Reflection Independence Theorem [N. 2006 (preprint)] (W s ) fin is completely determined Intuitively, (W s ) fin = 1 in generic cases Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68

Centralizers and Reflection Independence Theorem [N. 2006 (preprint)] (W s ) fin is completely determined Intuitively, (W s ) fin = 1 in generic cases In particular, W is reflection independent for the following cases: Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68

Centralizers and Reflection Independence Theorem [N. 2006 (preprint)] (W s ) fin is completely determined Intuitively, (W s ) fin = 1 in generic cases In particular, W is reflection independent for the following cases: Infinite irreducible 2-spherical Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68

Centralizers and Reflection Independence Theorem [N. 2006 (preprint)] (W s ) fin is completely determined Intuitively, (W s ) fin = 1 in generic cases In particular, W is reflection independent for the following cases: Infinite irreducible 2-spherical All reflections in W are conjugate K. Nuida, Centralizers of reflections and reflection-independence of Coxeter groups, arxiv:math/0602165v1 (2006) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68

Centralizers and Reflection Independence Note: W (A ) W (A, ), i.e., infinite irreducible 2-spherical (W, S) is not necessarily reflection rigid when S = W (A ) is the group of permutations on N fixing all but finitely many letters W (A, ) is the group of permutations on Z fixing all but finitely many letters A bijection N Z induces the desired W (A ) W (A, ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 59/68

On Finite Continuation Key properties in finite rank cases for using FC(w): Any finite intersection of parabolic subgroups is parabolic Any finite H W is contained in a maximal finite G W, which is parabolic Any maximal finite standard parabolic subgroup is a maximal finite subgroup How to generalize these properties to infinite rank cases? Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 60/68

On Finite Continuation [N. 2012] introduced the notion of locally parabolic subgroup Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 61/68

On Finite Continuation [N. 2012] introduced the notion of locally parabolic subgroup S(G): Canonical Coxeter generating set of a reflection subgroup G S(G) consists of reflections w.r.t. indecomposable positive roots of G Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 61/68

On Finite Continuation [N. 2012] introduced the notion of locally parabolic subgroup S(G): Canonical Coxeter generating set of a reflection subgroup G S(G) consists of reflections w.r.t. indecomposable positive roots of G def G W is locally parabolic G is a reflection subgroup, and any finite subset of S(G) is conjugate to a subset of S Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 61/68

On Finite Continuation [N. 2012] introduced the notion of locally parabolic subgroup S(G): Canonical Coxeter generating set of a reflection subgroup G S(G) consists of reflections w.r.t. indecomposable positive roots of G def G W is locally parabolic G is a reflection subgroup, and any finite subset of S(G) is conjugate to a subset of S Note: When S <, locally parabolic subgroups and parabolic subgroups coincide K. Nuida, Locally parabolic subgroups in Coxeter groups of arbitrary ranks, J. Algebra 350 (2012) pp.207 217 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 61/68

On Finite Continuation Facts: Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 62/68

On Finite Continuation Facts: The intersection of an arbitrary family of locally parabolic subgroups is locally parabolic, hence locally parabolic closure is well-defined Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 62/68

On Finite Continuation Facts: The intersection of an arbitrary family of locally parabolic subgroups is locally parabolic, hence locally parabolic closure is well-defined When S <, the locally parabolic closure coincides with the parabolic closure Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 62/68

On Finite Continuation Facts: The intersection of an arbitrary family of locally parabolic subgroups is locally parabolic, hence locally parabolic closure is well-defined When S <, the locally parabolic closure coincides with the parabolic closure Any locally finite subgroup of W is contained in a maximal locally finite subgroup of W, which is locally parabolic Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 62/68

On Finite Continuation Note: (for intersection of parabolic subgroups) s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {s 1 s 2 s 1, s 3 s 4 s 3, s 5 s 6 s 5,... } Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 63/68

On Finite Continuation Note: (for intersection of parabolic subgroups) s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {s 1 s 2 s 1, s 3 s 4 s 3, s 5 s 6 s 5,... } G is locally parabolic, but not parabolic Let G i := S(G) {s 2i+1, s 2i+2, s 2i+3,... } (1 i Z) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 63/68

On Finite Continuation Note: (for intersection of parabolic subgroups) s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {s 1 s 2 s 1, s 3 s 4 s 3, s 5 s 6 s 5,... } G is locally parabolic, but not parabolic Let G i := S(G) {s 2i+1, s 2i+2, s 2i+3,... } (1 i Z) Each G i is parabolic and G 1 G 2 G 3 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 63/68

On Finite Continuation Note: (for intersection of parabolic subgroups) s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {s 1 s 2 s 1, s 3 s 4 s 3, s 5 s 6 s 5,... } G is locally parabolic, but not parabolic Let G i := S(G) {s 2i+1, s 2i+2, s 2i+3,... } (1 i Z) Each G i is parabolic and G 1 G 2 G 3 i=1 G i = G Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 63/68

On Finite Continuation Note: (for intersection of parabolic subgroups) s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {s 1 s 2 s 1, s 3 s 4 s 3, s 5 s 6 s 5,... } G is locally parabolic, but not parabolic Let G i := S(G) {s 2i+1, s 2i+2, s 2i+3,... } (1 i Z) Each G i is parabolic and G 1 G 2 G 3 i=1 G i = G Hence i G i is not parabolic, though G i are parabolic Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 63/68

On Finite Continuation Note: The locally parabolic closure is not equal to the parabolic closure in general s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {u i := w i s i w i 1 } i=1, w i := s 1 s 2 s i s i+1 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 64/68

On Finite Continuation Note: The locally parabolic closure is not equal to the parabolic closure in general s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {u i := w i s i w i 1 } i=1, w i := s 1 s 2 s i s i+1 G is locally parabolic, hence the locally parabolic closure of G is G itself Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 64/68

On Finite Continuation Note: The locally parabolic closure is not equal to the parabolic closure in general s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {u i := w i s i w i 1 } i=1, w i := s 1 s 2 s i s i+1 G is locally parabolic, hence the locally parabolic closure of G is G itself The parabolic closure of G is W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 64/68

On Finite Continuation Note: The locally parabolic closure is not equal to the parabolic closure in general s 1 s 2 s 3 s 4 Let G be s.t. S(G) = {u i := w i s i w i 1 } i=1, w i := s 1 s 2 s i s i+1 G is locally parabolic, hence the locally parabolic closure of G is G itself The parabolic closure of G is W s 1 G, hence G W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 64/68

On Finite Continuation [Mühlherr N. (preprint)] introduced locally finite continuation of X W ; LFC(X ) := {H X H W maximal locally finite} Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 65/68

On Finite Continuation [Mühlherr N. (preprint)] introduced locally finite continuation of X W ; LFC(X ) := {H X H W maximal locally finite} Theorem For any reflection r, LFC(r) is completely determined LFC(r) is a parabolic subgroup for any reflection r B. Mühlherr, K. Nuida, Reflection independent Coxeter groups of arbitrary ranks, in preparation Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 65/68

On Finite Continuation We can also define reduced Coxeter systems (W, S) for arbitrary rank cases ( def having no exceptional s S) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 66/68

On Finite Continuation We can also define reduced Coxeter systems (W, S) for arbitrary rank cases ( def having no exceptional s S) An exceptional generator can be removed by some local transformation Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 66/68

On Finite Continuation We can also define reduced Coxeter systems (W, S) for arbitrary rank cases ( def having no exceptional s S) An exceptional generator can be removed by some local transformation Any (W, S) can be transformed into reduced one (by simultaneously performing infinitely many local transformations ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 66/68

On Finite Continuation We can also define reduced Coxeter systems (W, S) for arbitrary rank cases ( def having no exceptional s S) An exceptional generator can be removed by some local transformation Any (W, S) can be transformed into reduced one (by simultaneously performing infinitely many local transformations ) Hence the isomorphism problem is reduced to the class of reduced Coxeter systems Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 66/68

On Finite Continuation Theorem Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 67/68

On Finite Continuation Theorem Characterization of reduced (W, S) which is reflection independent among reduced Coxeter systems (by using locally finite continuations) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 67/68

On Finite Continuation Theorem Characterization of reduced (W, S) which is reflection independent among reduced Coxeter systems (by using locally finite continuations) (W, S) is reflection independent, if infinite irreducible and 2-spherical, or all reflections are conjugate Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 67/68

On Finite Continuation Theorem Characterization of reduced (W, S) which is reflection independent among reduced Coxeter systems (by using locally finite continuations) (W, S) is reflection independent, if infinite irreducible and 2-spherical, or all reflections are conjugate Characterization of reflection independent 2-dimensional Coxeter systems including skew-angled cases and cases with tree presentation graphs Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 67/68

Conclusion Preliminaries Isomorphism problem for Coxeter groups of finite ranks has been solved in some special cases has been reduced to reflection-preserving cases in general We have two kinds of elementary transformations ; are these enough? Isomorphism problem for Coxeter groups of infinite ranks has been almost reduced to reflection-preserving cases A new transformation: W (A ) W (A, ) How to proceed? Geometry? Combinatorics? Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 68/68