Indexing regions in dihedral and dodecahedral hyperplane arrangements MAA Intermountain Sectional Meeting, March 23, 2007 Cathy Kriloff Idaho State University.

Slides:



Advertisements
Similar presentations
Lalgèbre des symétries quantiques dOcneanu et la classification des systèms conformes à 2D Gil Schieber Directeurs : R. Coquereaux R. Amorim (J. A. Mignaco)
Advertisements

Group Theory II.
8.1 Prisms, Area and Volume Prism – 2 congruent polygons lie in parallel planes corresponding sides are parallel. corresponding vertices are connected.
Quasicrystals from Higher Dimensional Lattices
Bangalore conference, December, Rank 3-4 Coxeter Groups, Quaternions and Quasicrystals Mehmet Koca Department of Physics College of Science.
1 How is a graph like a manifold? Ethan Bolker Mathematics - UMass Boston University of Florida, Gainesville March 19,
Donald Coxeter “The Man Who Saved Geometry” Nathan Cormier April 10, 2007.
Using Properties of Polyhedra
Chapter 12: Surface Area and Volume of Solids
Surfaces and Topology Raymond Flood Gresham Professor of Geometry.
Combinatorial Properties of Periodic Orbits on an Equilateral Triangular Billiards Table Andrew Baxter  i    Seminar October 6 th, 2005 A dynamical.
Periodic Orbits on a Triangular Air Hockey Table Andrew Baxter Millersville University April 2005.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
To the 4th Dimension – and beyond!
PLATONIC SOLIDS AND EINSTEIN THEORY OF GRAVITY: UNEXPECTED CONNECTIONS.
Regular Polytopes in Four and Higher Dimensions
1 How is a graph like a manifold? Ethan Bolker Mathematics UMass-Boston UMass-Boston September 30, 2002.
Chapter 12 Surface Area and Volume. Topics We Will Discuss 3-D Shapes (Solids) Surface Area of solids Volume of Solids.
Chapter 12 Surface Area and Volume. Topics We Will Discuss 3-D Shapes (Solids) Surface Area of solids Volume of Solids.
CSEP 590tv: Quantum Computing Dave Bacon June 29, 2005 Today’s Menu Administrivia Complex Numbers Bra’s Ket’s and All That Quantum Circuits.
Chapter 15: Geometric Solids Brian BarrDan Logan.
What are imaginary and complex numbers? Do Now: Solve for x: x = 0 ? What number when multiplied by itself gives us a negative one? No such real.
Aim: Complex & Imaginary Numbers Course: Adv. Alg. & Trig. Aim: What are imaginary and complex numbers? Do Now: Solve for x: x = 0 ? What number.
1. An Overview of the Geometry Standards for School Mathematics? 2.
Advanced Math Chapter P
A Study of The Applications of Matrices and R^(n) Projections By Corey Messonnier.
EXAMPLE 2 Use Euler’s Theorem in a real-world situation SOLUTION The frame has one face as its foundation, four that make up its walls, and two that make.
5-Minute Check Name the polygon by the number of sides.
Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.
Section 8.4 Nack/Jones1 Section 8.4 Polyhedrons & Spheres.
Chapter 12 Section 1 Exploring Solids Using Properties of Polyhedra Using Euler’s Theorem Richard Resseguie GOAL 1GOAL 2.
David Renardy.  Simple Group- A nontrivial group whose only normal subgroups are itself and the trivial subgroup.  Simple groups are thought to be classified.
Math Sunshine State Standards Wall poster. MAA Associates verbal names, written word names, and standard numerals with integers, rational numbers,
Polyhedron Platonic Solids Cross Section
12.1 & 12.2 – Explore Solids & Surface Area of Prisms and Cones.
Generalized Catalan numbers and hyperplane arrangements Communicating Mathematics, July, 2007 Cathy Kriloff Idaho State University Supported in part by.
DRILL How many sides does dodecagon have?
12.1 Exploring Solids.
Keep an open mind to all possibilities.
Common Core and the Number Line. Grade 1 Number Line & CCSS The number line first appears in the Measurement & Data domain of the Common Core Standards.
Holt McDougal Algebra 2 Fundamental Theorem of Algebra How do we use the Fundamental Theorem of Algebra and its corollary to write a polynomial equation.
Section 12-1 Exploring Solids. Polyhedron Three dimensional closed figure formed by joining three or more polygons at their side. Plural: polyhedra.
Tiling Spaces: Quasicrystals & Geometry Daniel Bragg.
12.1 Exploring Solids Geometry. Defns. for 3-dimensional figures Polyhedron – a solid bounded by polygons that enclose a single region of shape. (no curved.
SUMMARY I – Platonic solids II – A few definitions
Geometric Transformations
Level 2 Certificate Further Mathematics 8360 Route Map
Great Theoretical Ideas In Computer Science
ML estimation in Gaussian graphical models
Cathy Kriloff Idaho State University
Goal 1: Using Properties of Polyhedra Goal 2: Using Euler’s Theorem
Computation of the solutions of nonlinear polynomial systems
Chapter 11 Extending Geometry
Geometric Transformations
Ch 12 Surface Area and Volume of Solids
11.4 Three-Dimensional Figures
Harold Scott MacDonald Coxeter
12.1 Exploring Solids.
Symmetry and three-dimensional geometry
10-1 Vocabulary Face Edge Vertex Prism Cylinder Pyramid Cone Cube Net
Triangulation of point set
Volume of Solids with Known Cross Sections
Surface Area and Volume
Spin Models and Distance-Regular Graphs
11.5 Explore Solids Mrs. vazquez Geometry.
Quantum Foundations Lecture 3
11.4 Exploring Solids Geometry How many geometric solid can you name?
11.4 Three-Dimensional Figures
UNITARY REPRESENTATIONS OF THE POINCARE GROUP
A Portrait of a Group on a Surface with Boundary
Presentation transcript:

Indexing regions in dihedral and dodecahedral hyperplane arrangements MAA Intermountain Sectional Meeting, March 23, 2007 Cathy Kriloff Idaho State University Supported in part by NSA grant MDA904-03-1-0093 Joint work with Yu Chen, Idaho State University to appear in Journal of Combinatorial Theory – Series A 3 2 4 1

Outline Noncrystallographic reflection groups (motivation: representation theory of graded Hecke algebras) Geometry – root systems and hyperplanes Combinatorics – root order and ideals Bijection for I2(m), H3, H4 (motivation: interesting combinatorics, unitary representations of graded Hecke algebras)                                        I usually study quite abstract (infinite-dimensional) graded Hecke algebras. Today will talk about a more accessible combinatorial detour First must introduce the setting of noncrystallographic reflection groups. Result will provide a bijection between two types of objects. On the one hand, geometric regions in hyperplane arrangements associated to root systems of the reflection groups On the other hand, combinatorial objects like ideals or antichains in a partial order on root vectors. Will illustrate and state results on bijections for dihedral types and H3 and H4. Original motivation thanks to Peter Trapa is to study unitary representations of noncrystallographic graded Hecke algebras as an outgrowth of the Atlas of Lie Groups project he is involved in (and that just made the news on CNN!) – in fact H4 root system sits inside E8 But also led to interesting combinatorial questions. 'Lie group E8' math puzzle solved POSTED: 10:26 a.m. EDT, March 21, 2007 (See www.aimath.org/E8)

Some crystallographic reflection groups Symmetries of these shapes are crystallographic reflection groups of types A2, B2, G2 First two generalize to n-dim simplex and hypercube Corresponding groups: Sn=An and Bn (Some crystallographic groups are not symmetries of regular polytopes) Begin with the setting we will work in. Start with something simple… Reflection groups are finite groups generated by reflections. Crystallographic because can tile space with analogues of eq. triangles, squares, regular hexagons. Generalizations to n dimensional standard simplex and hypercube with symmetry groups the permutations of 1 to n and an extension of S_n by n copies of Z2. Lying slightly as not all crystallographic reflection groups are symmetries of regular polytopes. If instead stay in 2 dimensions can generalize in a different way… by increasing the number of sides

Some noncrystallographic reflection groups Generalize to 2-dim regular m-gons Get dihedral groups, I2(m), for any m Noncrystallographic unless m=3,4,6 (tilings) Then symmetry group is the dihedral group of order 2n Setting for next while will be symmetries of regular n-gon. Our combinatorial result provides a perfect matching or pairing (a bijective correspondence, one-to-one and onto) between dominant regions in a hyperplane arrangement and ideals in a partial ordering of root vectors. So begin to introduce examples to illustrate these terms. In place of reflecting lines, consider vectors perpendicular to them. Call these roots. I2(5) I2(7) I2(8)

Reflection groups There is a classification (Coxeter - 1934, Witt – 1941) of finite groups generated by reflections = finite Coxeter groups Four infinite families, An, Bn, Dn, I2(m), +7 exceptional groups Crystallographic reflection groups = Weyl groups from Lie theory - represented by matrices with rational entries Noncrystallographic reflection groups need irrational entries - I2(m) = dihedral group of order 2m - H3 = symmetries of the dodecahedron - H4 = symmetries of the hyperdodecahedron (Good test cases between real and complex reflection groups)

Root systems roots = unit vectors perpendicular to reflecting lines simple roots = basis so each root is positive or negative I2(3) I2(4) a2 a2 a1 a1 Will call triangle example I2(3) and use it despite being crystallographic since simpler. Two vectors perpendicular to each line so 6. For I2(4), there are 8. What difference do you notice? Roots lie on reflecting lines or do not. When they do, has important mathematical consequences. Next introduce some additional lines. When m is even roots lie on reflecting lines so symmetries break them into two orbits

Hyperplane arrangement Name positive roots 1,…,m Add affine hyperplanes defined by x, i =1 and label by i For m even there are two orbits of hyperplanes and move one of them 1 1 2 4 2 3 3 4 3 b2 2 3 b1 1 Hyperplane is an n-1-dim subspace of an n-dim space, so in 2-dim space, are just lines. Add shifted hyperplanes and number roots from 1 to n Notice that other roots can be written in terms of basis alpha_1 and alpha_n. –e.g. alpha 2=alpha 1+alpha 3, etc. Interested in the 2-d regions formed as the lines intersect. Notice that symmetry helps reduce to a simpler problem – focus on just one cone, called dominant chamber, bounded by black lines. Interested in understanding the 2-dim regions in the dominant chamber for all n! Easy for I2(3), not as easy for I2(4), both because larger and because when n is even, two orbits of hyperplanes are independent of one another and can move one of them relative to the other so number of regions changes. Just as reflecting hyperplane is vectors with inner product 0 with a root vector, affine hyperplane is vectors with inner product c with a root vector for some fixed c. Can view moving the hyperplane either as changing c or as scaling the root/changing its length. Will be important later. This is our hyperplane arrangement. Now consider how to keep track of regions.

Indexing dominant regions Label each 2-dim region by all i such that for all x in region, x, i 1 = all i such that hyperplane is crossed as move out from origin 1 2 3 4 5 I2(3) I2(5) 1 2 3 2 3 4 5 2 3 1 2 3 4 1 2 2 2 2 3 4 To keep track of dominant regions, start near center point, walk out along rays in cone, keep track of which lines you cross. Details… being on one side of a line is equivalent to satisfying a linear inequality, so a region is described by a system of linear inequalities. When finish, go back to slide 6, then cut out to GSP, then return and click on slide 8 to start again. 3 5  3 4 2 3 3 1 4 1 3  2

Indexing dominant regions in I2(4) Label each 2-dim region by all i such that for all x in region, x, i c = all i such that hyperplane is crossed as move out from origin  1 2 3 4 2 3 1 2 3 2 4 2 3 2 3 4 Same recording principle. Remember that we must keep

Root posets and ideals I2(3) I2(4) I2(5) Express positive j in i basis Ordering: ≤ if - ═cii with ci≥0 Connect by an edge if comparable Increases going down Pick any set of incomparable roots (antichain), , and form its ideal=   for all  x, i =c  x, i /c=1 so moving hyperplane  changing root length, and poset changes I2(3) I2(4) 1 3 2 3 2 4 1 I2(5) 5 1 Poset is short for partially ordered set. 2 4 3

Root poset for I2(3) Root poset for I2(5) Ideals index dominant regions 1 3 2 1 5 2 4  2 1 3 4 5 1 2 3 4 5 1 2 3 4 2 3 2 3 4 3 Ideals for I2(3) Ideals for I2(5) 1 2 3 4 5 2 3 4 5 1 2 3 4 2 3 4 3 4 2 3 3  1 2 3 1 2 2 3 2 

Correspondence for m even  1 2 3 4 2 3 1 2 3 2 4 2 3 2 3 4 1 4 1 4 4 1 3 3 2 3 2 2

Result for I2(m) Theorem (Chen, K): There is a bijection between dominant regions in this hyperplane arrangement and ideals in the poset of positive roots for the root system of type I2(m) for every m. If m is even, the correspondence is maintained as one orbit of hyperplanes is dilated. Was known for crystallographic root systems, - Shi (1997), Cellini-Papi (2002) and for certain refined counts. - Athanasiadis (2004), Panyushev (2004), Sommers (2005) In remaining time, want to discuss the only two other noncrystallographic cases by generalizing symmetries of the regular pentagon to higher dimensions. Turns out, can only generalize to dimensions 3 and 4!

H3 and H4 Can generalize I2(5) to: H3 = symmetries of 3-dim dodecahedron H4 = symmetries of regular 4-dimensional solid, hyperdodecahedron or 120-cell (with 120 3-dim dodecahedral faces) I2(5), H3, and H4 related to quasicrystals Recall we said there are analogues of the eq. triangle and square in all dimensions. SHOW MODELS Here are the 3-d versions Can also find analogue of I2(5) in dimension 3

H3 root system Roots = edge midpoints of dodecahedron or icosahedron Source: cage.ugent.be/~hs/polyhedra/dodeicos.html

H3 hyperplane arrangement Dominant regions are enclosed by yellow, pink, and light gray planes

H3 root poset Has 41 ideals

Result for H3 Theorem (Chen, K): There is a bijection between dominant regions in this hyperplane arrangement and ideals in the poset of positive roots for the root system of type H3. There are 41 dominant regions (29 bounded and 12 unbounded).

A 3-d projection of the 120-cell Source: en.wikipedia.org

Another view of the120-cell Source: home.inreach.com

Taken by Jim King at the Park City Mathematics Institute, Summer, 2004 A truly 3-d projection! Taken by Jim King at the Park City Mathematics Institute, Summer, 2004

A 2-d projection of the 120-cell Source: mathworld.wolfram.com

H4 root poset (sideways) Has 429 ideals

Result for H4 Theorem (Chen, K): There is a bijection between dominant regions in the hyperplane arrangement and all but 16 ideals in the poset of positive roots for the root system of type H4. (these 16 correspond to empty regions) 413 dominant regions (355 bounded, 58 unbounded). Proof for I2(m), H3: Interplay between various antichains and ideals. Relate solution of linear equations from antichains to solution of linear inequalities from ideals to get criterion for region associated to a smaller ideal to be nonempty. Proof for H4: Verify all but 28 of 429 regions are nonempty as before. Show 16 are empty by fairly simple calculation for contradiction. Show 12 are nonempty by solving systems of linear equations. Other objects counted by Catalan number: Vertices in generalized associahedra introduced in recent work of Fomin-Zelevinsky. Noncrossing partitions in geometric group theory. These have been generalized to noncrystallographic cases and still counted by product formula.

Related combinatorics In crystallographic cases, antichains called nonnesting partitions These and other objects counted by Catalan number: (h+di)/|W| where W = Weyl group, h = Coxeter number, di=invariant degrees But numbers for I2(m), H3, H4 are not Catalan numbers Open question: What is a noncrystallographic nonnesting partition?