On the isomorphism problem for Coxeter groups and related topics
|
|
- Rhoda Lynch
- 5 years ago
- Views:
Transcription
1 On the isomorphism problem for Coxeter groups and related topics Koji Nuida (AIST, Japan) Groups and Dec. 18 & 20, 2012 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 1/68
2 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
3 Outline Preliminaries 1 Preliminaries Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 3/68
4 Preliminaries Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 4/68
5 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
6 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
7 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
8 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
9 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
10 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
11 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
12 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
13 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
14 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
15 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
16 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
17 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
18 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
19 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 14/68
20 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
21 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
22 Rigid Coxeter Groups W (Γ) is rigid def W (Γ ) W (Γ) implies Γ Γ Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 16/68
23 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
24 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
25 Folklore Non-Rigid Example ( ) ( ) 6 W W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 17/68
26 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
27 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 19/68
28 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
29 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
30 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
31 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) M. Mihalik, J. Ratcliffe, S. Tschantz, On the isomorphism problem for finitely generated Coxeter groups. I: Basic matching, arxiv:math.gr/ v1 (2005) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 20/68
32 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
33 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
34 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
35 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
36 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
37 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
38 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
39 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
40 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 23/68
41 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
42 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
43 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
44 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
45 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
46 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 27/68
47 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
48 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
49 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
50 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
51 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 P. Bahls, A new class of rigid Coxeter groups, Int. J. Algebra Comput. 13(1) (2003) pp Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 29/68
52 ( S < ) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 30/68
53 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 31/68
54 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
55 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
56 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 32/68
57 Strongly Rigidity: Geometric Arguments Bipolar Coxeter groups include the following cases Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 33/68
58 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
59 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
60 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 P.-E. Caprace, B. Mühlherr, Reflection rigidity of 2-spherical Coxeter groups, Proc. London Math. Soc. (3) 94 (2007) pp A. Kaul, A class of rigid Coxeter groups, J. London Math. Soc. (2) 66 (2002) pp Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 33/68
61 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
62 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
63 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
64 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
65 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
66 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
67 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
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
69 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
70 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
71 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
72 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 36/68
73 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 A. Castella, Sur les automorphismes et la rigidité des groupes de Coxeter à angles droits, J. Algebra 301 (2006) pp Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 37/68
74 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
75 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
76 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
77 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
78 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
79 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
80 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
81 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
82 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 40/68
83 Diagram Twisting Recall the example in [Mühlherr 2000] ( ) ( ) W W Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 41/68
84 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
85 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
86 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
87 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
88 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
89 Diagram Twisting Positive results on the conjecture: Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 45/68
90 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
91 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
92 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 45/68
93 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 46/68
94 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
95 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
96 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
97 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 48/68
98 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
99 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 49/68
100 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
101 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
102 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
103 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
104 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
105 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
106 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
107 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
108 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 54/68
109 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 55/68
110 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
111 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
112 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
113 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
114 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
115 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
116 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
117 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
118 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 57/68
119 Centralizers and Reflection Independence Theorem [N (preprint)] Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68
120 Centralizers and Reflection Independence Theorem [N (preprint)] (W s ) fin is completely determined Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68
121 Centralizers and Reflection Independence Theorem [N (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
122 Centralizers and Reflection Independence Theorem [N (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
123 Centralizers and Reflection Independence Theorem [N (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
124 Centralizers and Reflection Independence Theorem [N (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/ v1 (2006) Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 58/68
125 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
126 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
127 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
128 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
129 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
130 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 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 61/68
131 On Finite Continuation Facts: Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 62/68
132 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
133 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
134 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
135 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
136 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
137 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
138 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
139 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
140 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
141 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
142 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
143 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
144 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
145 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
146 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
147 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
148 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
149 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
150 On Finite Continuation Theorem Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter groups 67/68
151 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
152 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
153 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
154 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
On the isomorphism problem of Coxeter groups and related topics
On the isomorphism problem of Coxeter groups and related topics Koji Nuida 1 Graduate School of Mathematical Sciences, University of Tokyo E-mail: nuida@ms.u-tokyo.ac.jp At the conference the author gives
More informationRIGIDITY OF COXETER GROUPS AND ARTIN GROUPS
RIGIDITY OF COXETER GROUPS AND ARTIN GROUPS NOEL BRADY 1, JONATHAN P. MCCAMMOND 2, BERNHARD MÜHLHERR, AND WALTER D. NEUMANN 3 Abstract. A Coxeter group is rigid if it cannot be defined by two nonisomorphic
More informationLecture 2.3: Symmetric and alternating groups
Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationCitation for published version (APA): Nutma, T. A. (2010). Kac-Moody Symmetries and Gauged Supergravity Groningen: s.n.
University of Groningen Kac-Moody Symmetries and Gauged Supergravity Nutma, Teake IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please
More information5 Symmetric and alternating groups
MTHM024/MTH714U Group Theory Notes 5 Autumn 2011 5 Symmetric and alternating groups In this section we examine the alternating groups A n (which are simple for n 5), prove that A 5 is the unique simple
More informationPD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 7 No. 1 (2018), pp. 37-50. c 2018 University of Isfahan www.combinatorics.ir www.ui.ac.ir PD-SETS FOR CODES RELATED
More informationTHE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS
THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master
More informationEnumeration of Pin-Permutations
Enumeration of Pin-Permutations Frédérique Bassino, athilde Bouvel, Dominique Rossin To cite this version: Frédérique Bassino, athilde Bouvel, Dominique Rossin. Enumeration of Pin-Permutations. 2008.
More informationPrimitive permutation groups with finite stabilizers
Primitive permutation groups with finite stabilizers Simon M. Smith City Tech, CUNY and The University of Western Australia Groups St Andrews 2013, St Andrews Primitive permutation groups A transitive
More informationPermutations and codes:
Hamming distance Permutations and codes: Polynomials, bases, and covering radius Peter J. Cameron Queen Mary, University of London p.j.cameron@qmw.ac.uk International Conference on Graph Theory Bled, 22
More informationChapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations
Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.
More informationPermutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.
Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}
More informationAn improvement to the Gilbert-Varshamov bound for permutation codes
An improvement to the Gilbert-Varshamov bound for permutation codes Yiting Yang Department of Mathematics Tongji University Joint work with Fei Gao and Gennian Ge May 11, 2013 Outline Outline 1 Introduction
More informationLower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
ÂÓÙÖÒÐ Ó ÖÔ ÐÓÖØÑ Ò ÔÔÐØÓÒ ØØÔ»»ÛÛÛº ºÖÓÛÒºÙ»ÔÙÐØÓÒ»» vol.?, no.?, pp. 1 44 (????) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings David R. Wood School of Computer Science
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More informationReflection group counting and q-counting
Reflection group counting and q-counting Vic Reiner Univ. of Minnesota reiner@math.umn.edu Summer School on Algebraic and Enumerative Combinatorics S. Miguel de Seide, Portugal July 2-13, 2012 Outline
More informationA Course in Model Theory
A Course in Model Theory Author address: Rami Grossberg 1 DEPARTMENT OF MATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA 15213 E-mail address: rami@cmu.edu 1 This preliminary draft is
More informationA Course in Model Theory
A Course in Model Theory Author address: Rami Grossberg 1 DEPARTMENT OF MATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA 15213 E-mail address: rami@cmu.edu 1 This preliminary draft is
More informationTHREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) Contents
THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) CARLOS MATHEUS Abstract. This text corresponds to a minicourse delivered on June 11, 12 & 13, 2018 during the summer school Teichmüller dynamics,
More informationEdge-disjoint tree representation of three tree degree sequences
Edge-disjoint tree representation of three tree degree sequences Ian Min Gyu Seong Carleton College seongi@carleton.edu October 2, 208 Ian Min Gyu Seong (Carleton College) Trees October 2, 208 / 65 Trees
More informationSimple permutations and pattern restricted permutations
Simple permutations and pattern restricted permutations M.H. Albert and M.D. Atkinson Department of Computer Science University of Otago, Dunedin, New Zealand. Abstract A simple permutation is one that
More informationPermutation groups, derangements and prime order elements
Permutation groups, derangements and prime order elements Tim Burness University of Southampton Isaac Newton Institute, Cambridge April 21, 2009 Overview 1. Introduction 2. Counting derangements: Jordan
More informationClasses of permutations avoiding 231 or 321
Classes of permutations avoiding 231 or 321 Nik Ruškuc nik.ruskuc@st-andrews.ac.uk School of Mathematics and Statistics, University of St Andrews Dresden, 25 November 2015 Aim Introduce the area of pattern
More informationA theorem on the cores of partitions
A theorem on the cores of partitions Jørn B. Olsson Department of Mathematical Sciences, University of Copenhagen Universitetsparken 5,DK-2100 Copenhagen Ø, Denmark August 9, 2008 Abstract: If s and t
More informationFinite homomorphism-homogeneous permutations via edge colourings of chains
Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.
More informationEXPLAINING THE SHAPE OF RSK
EXPLAINING THE SHAPE OF RSK SIMON RUBINSTEIN-SALZEDO 1. Introduction There is an algorithm, due to Robinson, Schensted, and Knuth (henceforth RSK), that gives a bijection between permutations σ S n and
More informationGenerating indecomposable permutations
Discrete Mathematics 306 (2006) 508 518 www.elsevier.com/locate/disc Generating indecomposable permutations Andrew King Department of Computer Science, McGill University, Montreal, Que., Canada Received
More informationPin-Permutations and Structure in Permutation Classes
and Structure in Permutation Classes Frédérique Bassino Dominique Rossin Journées de Combinatoire de Bordeaux, feb. 2009 liafa Main result of the talk Conjecture[Brignall, Ruškuc, Vatter]: The pin-permutation
More informationarxiv: v1 [math.co] 11 Jul 2016
OCCURRENCE GRAPHS OF PATTERNS IN PERMUTATIONS arxiv:160703018v1 [mathco] 11 Jul 2016 BJARNI JENS KRISTINSSON AND HENNING ULFARSSON Abstract We define the occurrence graph G p (π) of a pattern p in a permutation
More informationThe Relationship between Permutation Groups and Permutation Polytopes
The Relationship between Permutation Groups and Permutation Polytopes Shatha A. Salman University of Technology Applied Sciences department Baghdad-Iraq Batool A. Hameed University of Technology Applied
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationA FAMILY OF t-regular SELF-COMPLEMENTARY k-hypergraphs. Communicated by Behruz Tayfeh Rezaie. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 6 No. 1 (2017), pp. 39-46. c 2017 University of Isfahan www.combinatorics.ir www.ui.ac.ir A FAMILY OF t-regular SELF-COMPLEMENTARY
More informationRESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel
RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined
More informationσ-coloring of the Monohedral Tiling
International J.Math. Combin. Vol.2 (2009), 46-52 σ-coloring of the Monohedral Tiling M. E. Basher (Department of Mathematics, Faculty of Science (Suez), Suez-Canal University, Egypt) E-mail: m e basher@@yahoo.com
More informationBiembeddings of Latin squares and Hamiltonian decompositions
Biembeddings of Latin squares and Hamiltonian decompositions M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM M. Knor Department
More informationThe Perfect Binary One-Error-Correcting Codes of Length 15: Part I Classification
1 The Perfect Binary One-Error-Correcting Codes of Length 15: Part I Classification Patric R. J. Östergård, Olli Pottonen Abstract arxiv:0806.2513v3 [cs.it] 30 Dec 2009 A complete classification of the
More informationA NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA
A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied
More informationPermutations with short monotone subsequences
Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres
More informationTransitivity Action of A n on (n=4,5,6,7) on Unordered and Ordered Quadrupples
ABSTRACT Transitivity Action of A n on (n=4,5,6,7) on Unordered and Ordered Quadrupples Gachago j.kimani *, 1 Kinyanjui J.N, 2 Rimberia j, 3 Patrick kimani 4 and Jacob kiboi muchemi 5 1,3,4 Department
More informationGraduate Texts in Mathematics. Editorial Board. F. W. Gehring P. R. Halmos Managing Editor. c. C. Moore
Graduate Texts in Mathematics 49 Editorial Board F. W. Gehring P. R. Halmos Managing Editor c. C. Moore K. W. Gruenberg A.J. Weir Linear Geometry 2nd Edition Springer Science+Business Media, LLC K. W.
More informationAsymptotic and exact enumeration of permutation classes
Asymptotic and exact enumeration of permutation classes Michael Albert Department of Computer Science, University of Otago Nov-Dec 2011 Example 21 Question How many permutations of length n contain no
More informationTHE SIGN OF A PERMUTATION
THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written
More informationTHE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n. Communicated by S. Alikhani
Algebraic Structures and Their Applications Vol 3 No 2 ( 2016 ) pp 71-79 THE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n MASOOMEH YAZDANI-MOGHADDAM AND REZA KAHKESHANI Communicated by S Alikhani
More informationMath 3560 HW Set 6. Kara. October 17, 2013
Math 3560 HW Set 6 Kara October 17, 013 (91) Let I be the identity matrix 1 Diagonal matrices with nonzero entries on diagonal form a group I is in the set and a 1 0 0 b 1 0 0 a 1 b 1 0 0 0 a 0 0 b 0 0
More information#A2 INTEGERS 18 (2018) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS
#A INTEGERS 8 (08) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS Alice L.L. Gao Department of Applied Mathematics, Northwestern Polytechnical University, Xi an, Shaani, P.R. China llgao@nwpu.edu.cn Sergey
More informationMATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.
MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations
More informationCombinatorics in the group of parity alternating permutations
Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi
More informationUniversal Cycles for Permutations Theory and Applications
Universal Cycles for Permutations Theory and Applications Alexander Holroyd Microsoft Research Brett Stevens Carleton University Aaron Williams Carleton University Frank Ruskey University of Victoria Combinatorial
More informationA Course in Model Theory I:
A Course in Model Theory I: Introduction 1 Rami Grossberg DEPARTMENT OFMATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA15213 1 This preliminary draft is dated from August 15, 2017. The
More informationDomination game and minimal edge cuts
Domination game and minimal edge cuts Sandi Klavžar a,b,c Douglas F. Rall d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia b Faculty of Natural Sciences and Mathematics, University
More informationA Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs
Journal of Combinatorial Theory, Series A 90, 293303 (2000) doi:10.1006jcta.1999.3040, available online at http:www.idealibrary.com on A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations
More informationPermutation Groups. Definition and Notation
5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those
More informationConnected Permutations, Hypermaps and Weighted Dyck Words. Robert Cori Mini course, Maps Hypermaps february 2008
1 Connected Permutations, Hypermaps and Weighted Dyck Words 2 Why? Graph embeddings Nice bijection by Patrice Ossona de Mendez and Pierre Rosenstiehl. Deduce enumerative results. Extensions? 3 Cycles (or
More informationUNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun
UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES ADELINE PIERROT with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun The aim of this work is to study the asymptotic
More informationA combinatorial proof for the enumeration of alternating permutations with given peak set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (2013), Pages 293 300 A combinatorial proof for the enumeration of alternating permutations with given peak set Alina F.Y. Zhao School of Mathematical Sciences
More informationSome Fine Combinatorics
Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion
More informationCorners in Tree Like Tableaux
Corners in Tree Like Tableaux Pawe l Hitczenko Department of Mathematics Drexel University Philadelphia, PA, U.S.A. phitczenko@math.drexel.edu Amanda Lohss Department of Mathematics Drexel University Philadelphia,
More informationSome t-homogeneous sets of permutations
Some t-homogeneous sets of permutations Jürgen Bierbrauer Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931 (USA) Stephen Black IBM Heidelberg (Germany) Yves Edel
More informationA stack and a pop stack in series
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8(1) (2014), Pages 17 171 A stack and a pop stack in series Rebecca Smith Department of Mathematics SUNY Brockport, New York U.S.A. Vincent Vatter Department
More informationNON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday
NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As
More informationThe Place of Group Theory in Decision-Making in Organizational Management A case of 16- Puzzle
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728,p-ISSN: 2319-765X, Volume 7, Issue 6 (Sep. - Oct. 2013), PP 17-22 The Place of Group Theory in Decision-Making in Organizational Management A case
More informationA Complete Characterization of Maximal Symmetric Difference-Free families on {1, n}.
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 8-2006 A Complete Characterization of Maximal Symmetric Difference-Free families on
More informationAnalysis on the Properties of a Permutation Group
International Journal of Theoretical and Applied Mathematics 2017; 3(1): 19-24 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20170301.13 Analysis on the Properties of a Permutation
More informationEvacuation and a Geometric Construction for Fibonacci Tableaux
Evacuation and a Geometric Construction for Fibonacci Tableaux Kendra Killpatrick Pepperdine University 24255 Pacific Coast Highway Malibu, CA 90263-4321 Kendra.Killpatrick@pepperdine.edu August 25, 2004
More informationOn k-crossings and k-nestings of permutations
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 461 468 On k-crossings and k-nestings of permutations Sophie Burrill 1 and Marni Mishna 1 and Jacob Post 2 1 Department of Mathematics, Simon Fraser
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationEQUIPOPULARITY CLASSES IN THE SEPARABLE PERMUTATIONS
EQUIPOPULARITY CLASSES IN THE SEPARABLE PERMUTATIONS Michael Albert, Cheyne Homberger, and Jay Pantone Abstract When two patterns occur equally often in a set of permutations, we say that these patterns
More informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More informationUniversal graphs and universal permutations
Universal graphs and universal permutations arxiv:1307.6192v1 [math.co] 23 Jul 2013 Aistis Atminas Sergey Kitaev Vadim V. Lozin Alexandr Valyuzhenich Abstract Let X be a family of graphs and X n the set
More informationBibliography. S. Gill Williamson
Bibliography S. Gill Williamson 1. S. G. Williamson, A Combinatorial Property of Finite Sequences with Applications to Tensor Algebra, J. Combinatorial Theory, 1 (1966), pp. 401-410. 2. S. G. Williamson,
More informationThe Sign of a Permutation Matt Baker
The Sign of a Permutation Matt Baker Let σ be a permutation of {1, 2,, n}, ie, a one-to-one and onto function from {1, 2,, n} to itself We will define what it means for σ to be even or odd, and then discuss
More informationThe number of mates of latin squares of sizes 7 and 8
The number of mates of latin squares of sizes 7 and 8 Megan Bryant James Figler Roger Garcia Carl Mummert Yudishthisir Singh Working draft not for distribution December 17, 2012 Abstract We study the number
More informationON SOME PROPERTIES OF PERMUTATION TABLEAUX
ON SOME PROPERTIES OF PERMUTATION TABLEAUX ALEXANDER BURSTEIN Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions
More informationPermutations. = f 1 f = I A
Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has
More informationA Few More Large Sets of t-designs
A Few More Large Sets of t-designs Yeow Meng Chee, 1 Spyros S. Magliveras 2 1 Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada 2 Department of Computer
More informationA STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen, Lewis H. Liu, Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 7, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationSymmetric Permutations Avoiding Two Patterns
Symmetric Permutations Avoiding Two Patterns David Lonoff and Jonah Ostroff Carleton College Northfield, MN 55057 USA November 30, 2008 Abstract Symmetric pattern-avoiding permutations are restricted permutations
More informationCARD GAMES AND CRYSTALS
CARD GAMES AND CRYSTALS This is the extended version of a talk I gave at KIDDIE (graduate student colloquium) in April 2011. I wish I could give this version, but there wasn t enough time, so I left out
More informationThe Möbius function of separable permutations (extended abstract)
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 641 652 The Möbius function of separable permutations (extended abstract) Vít Jelínek 1 and Eva Jelínková 2 and Einar Steingrímsson 1 1 The Mathematics
More informationThe E-series, Happel-Seidel symmetry, and Orlov s theorem
The E-series, Happel-Seidel symmetry, and Orlov s theorem Helmut Lenzing Paderborn ICRA 2012, Bielefeld, August 15, 2012 H. Lenzing () E-series, HS symmetry, Orlov s theorem ICRA 2012 1 / 1 Happy Birthday!
More information18 Completeness and Compactness of First-Order Tableaux
CS 486: Applied Logic Lecture 18, March 27, 2003 18 Completeness and Compactness of First-Order Tableaux 18.1 Completeness Proving the completeness of a first-order calculus gives us Gödel s famous completeness
More informationReflections on the N + k Queens Problem
Integre Technical Publishing Co., Inc. College Mathematics Journal 40:3 March 12, 2009 2:02 p.m. chatham.tex page 204 Reflections on the N + k Queens Problem R. Douglas Chatham R. Douglas Chatham (d.chatham@moreheadstate.edu)
More informationThe Tiling Problem. Nikhil Gopalkrishnan. December 08, 2008
The Tiling Problem Nikhil Gopalkrishnan December 08, 2008 1 Introduction A Wang tile [12] is a unit square with each edge colored from a finite set of colors Σ. A set S of Wang tiles is said to tile a
More informationUnique Sequences Containing No k-term Arithmetic Progressions
Unique Sequences Containing No k-term Arithmetic Progressions Tanbir Ahmed Department of Computer Science and Software Engineering Concordia University, Montréal, Canada ta ahmed@cs.concordia.ca Janusz
More informationExploiting the disjoint cycle decomposition in genome rearrangements
Exploiting the disjoint cycle decomposition in genome rearrangements Jean-Paul Doignon Anthony Labarre 1 doignon@ulb.ac.be alabarre@ulb.ac.be Université Libre de Bruxelles June 7th, 2007 Ordinal and Symbolic
More informationMeasure Preserving Isomorphisms
Gen. Math. Notes, Vol. 29, No., July 205, pp.-5 ISSN 229-784; Copyright c ICSRS Publication, 205 www.i-csrs.org Available free online at http://www.geman.in Measure Preserving Isomorphisms M. Gheytaran
More informationZsombor Sárosdi THE MATHEMATICS OF SUDOKU
EÖTVÖS LORÁND UNIVERSITY DEPARTMENT OF MATHTEMATICS Zsombor Sárosdi THE MATHEMATICS OF SUDOKU Bsc Thesis in Applied Mathematics Supervisor: István Ágoston Department of Algebra and Number Theory Budapest,
More informationPerfect Octagon Quadrangle Systems with an upper C 4 -system and a large spectrum
Computer Science Journal of Moldova, vol.18, no.3(54), 2010 Perfect Octagon Quadrangle Systems with an upper C 4 -system and a large spectrum Luigia Berardi, Mario Gionfriddo, Rosaria Rota To the memory
More informationCOMBINATORICS ON BIGRASSMANNIAN PERMUTATIONS AND ESSENTIAL SETS
COMBINATORICS ON BIGRASSMANNIAN PERMUTATIONS AND ESSENTIAL SETS MASATO KOBAYASHI Contents 1. Symmetric groups 2 Introduction 2 S n as a Coxeter group 3 Bigrassmannian permutations? 4 Bigrassmannian statistics
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More informationSUDOKU Colorings of the Hexagonal Bipyramid Fractal
SUDOKU Colorings of the Hexagonal Bipyramid Fractal Hideki Tsuiki Kyoto University, Sakyo-ku, Kyoto 606-8501,Japan tsuiki@i.h.kyoto-u.ac.jp http://www.i.h.kyoto-u.ac.jp/~tsuiki Abstract. The hexagonal
More informationFaithful Representations of Graphs by Islands in the Extended Grid
Faithful Representations of Graphs by Islands in the Extended Grid Michael D. Coury Pavol Hell Jan Kratochvíl Tomáš Vyskočil Department of Applied Mathematics and Institute for Theoretical Computer Science,
More informationReceived: 10/24/14, Revised: 12/8/14, Accepted: 4/11/15, Published: 5/8/15
#G3 INTEGERS 15 (2015) PARTIZAN KAYLES AND MISÈRE INVERTIBILITY Rebecca Milley Computational Mathematics, Grenfell Campus, Memorial University of Newfoundland, Corner Brook, Newfoundland, Canada rmilley@grenfell.mun.ca
More informationCURRICULUM VITAE Dana P. Williams
CURRICULUM VITAE Dana P. Williams Professional Preparation Cornell University Mathematics A.B. 1974 University of California at Berkeley Mathematics M.A. 1977 University of California at Berkeley Mathematics
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More informationOn uniquely k-determined permutations
Discrete Mathematics 308 (2008) 1500 1507 www.elsevier.com/locate/disc On uniquely k-determined permutations Sergey Avgustinovich a, Sergey Kitaev b a Sobolev Institute of Mathematics, Acad. Koptyug prospect
More informationCyclic, f-cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge.
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 5-2009 Cyclic, f-cyclic, and Bicyclic Decompositions of the Complete Graph into the
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More information