1.Mirrors and Symmetry - WPI · Lens and Lightsusers.wpi.edu/~bservat/pittsburgtalk.pdfMirrors and Symmetry Geometry to Graphs Connectivity The Program Bibliography Home Page Title

Mirrors and Symmetry

Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 1 of 71

Go Back

Full Screen

Close

Quit

•First •Prev •Next •Last •Go Back •Full Screen •Close •Quit

1. Mirrors and Symmetry


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 2 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 3 of 71

Go Back

Full Screen

Close

Quit


Two mirrored walls


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 4 of 71

Go Back

Full Screen

Close

Quit


A glimpse of infinity - a repeating linear pattern


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 5 of 71

Go Back

Full Screen

Close

Quit


Four mirrored walls


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 6 of 71

Go Back

Full Screen

Close

Quit


A doubly periodic pattern with with four orientations.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 7 of 71

Go Back

Full Screen

Close

Quit


Mr. Pentagon looks at one of his chins.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 8 of 71

Go Back

Full Screen

Close

Quit


Mr. Pentagon looks at one of his chins.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 9 of 71

Go Back

Full Screen

Close

Quit


Mr. Pentagon looks himself in the eye. . .


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 10 of 71

Go Back

Full Screen

Close

Quit


Does it always go through a corner?


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 11 of 71

Go Back

Full Screen

Close

Quit


A room with 180◦ rotational views


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 12 of 71

Go Back

Full Screen

Close

Quit


A room with 180◦ rotational views (how many orientations?)


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 13 of 71

Go Back

Full Screen

Close

Quit


One of the walls inverts colors . . .


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 14 of 71

Go Back

Full Screen

Close

Quit


One of the walls inverts colors . . . or is it two . . .


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 15 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 16 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 17 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 18 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 19 of 71

Go Back

Full Screen

Close

Quit


So how many such colored patterns are there?


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 20 of 71

Go Back

Full Screen

Close

Quit




Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 21 of 71

Go Back

Full Screen

Close

Quit




Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 22 of 71

Go Back

Full Screen

Close

Quit




Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 23 of 71

Go Back

Full Screen

Close

Quit




Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 24 of 71

Go Back

Full Screen

Close

Quit


17 plane crystallographic groups [Fedorov [3]]

46 two-colored crystallographic groups [Coxeter [1]]


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 25 of 71

Go Back

Full Screen

Close

Quit


Spherical groups


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 26 of 71

Go Back

Full Screen

Close

Quit


Application 1: Pattern counting

M. C. Escher [2, 8, 6] laboriously examined multitudes ofsketches to determine how many different patterns wouldresult by repeatedly translating a 2 × 2 square having itsfour unit squares filled with copies of an asymmetric motifin any of four aspects.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 27 of 71

Go Back

Full Screen

Close

Quit


The 1× 4 case: Escher revisited

1 bbbb

2 bbbq

3 bbbp

4 bbbd

5 bbqq

6 bbqp

7 bbqd

8 bbpq

9 bbpp

10 bbpd


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 28 of 71

Go Back

Full Screen

Close

Quit


11 bbdq

12 bbdp

13 bbdd

14 bqbq

15 bqbp

16 bqbd

17 bqpd

18 bqdp

19 bpbp

20 bdbp

21 bdbd

22 bdqp

23 bdpq


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 29 of 71

Go Back

Full Screen

Close

Quit


Summary [7, 8]

1. f (n) – A053656 in Sloan’s On-Line Encyclopedia of in-teger sequences [15]

2. G(n) ≈ 2F (n)

3. G(n) ≈ 4n/(4n) (G(p) = d4n/(4n)e for n = p prime)

4. Symmetric motifs

5. Over/Under weave motifs

6. Multiple motifs


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 30 of 71

Go Back

Full Screen

Close

Quit


Strip patterns

All frieze patterns may be realized in folding paper dolls [9]and [4].


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 31 of 71

Go Back

Full Screen

Close

Quit


Application 2: Cayley Graphs

Vertices: The orbit of any point in a fundamental regionEdges: Generators mapping to incident fundamental regions

Result: A symmetrically embedded Cayley graph.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 32 of 71

Go Back

Full Screen

Close

Quit


Analogous construction in the Euclidean planeThe Cayley graph of the 30− 60− 90 triangle group.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 33 of 71

Go Back

Full Screen

Close

Quit


Analogous construction on the torus


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 34 of 71

Go Back

Full Screen

Close

Quit


A symmetric tiling - a choice of fundamental region.

Fundamental region tiling – Cayley graph of symmetry group


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 35 of 71

Go Back

Full Screen

Close

Quit


Homework


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 36 of 71

Go Back

Full Screen

Close

Quit


Application 3: Self–Duality

[13, 11, 10, 12, 14]

A self-dual polyhedron.

Add polarity to the Euclidian group.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 37 of 71

Go Back

Full Screen

Close

Quit


Self–dual tilings –cmm B cm

.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 38 of 71

Go Back

Full Screen

Close

Quit


Self–dual tilings –cmm B cm

.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 39 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 40 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 41 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 42 of 71

Go Back

Full Screen

Close

Quit


(Red,Green)

(Red,Blue)(G,R,B)

(Blue,Green)

There are also three-color groups


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 43 of 71

Go Back

Full Screen

Close

Quit


2. Geometry to Graphs

–To a geometer - Platonic Solids


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 44 of 71

Go Back

Full Screen

Close

Quit


–To a topologist - Platonic Maps


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 45 of 71

Go Back

Full Screen

Close

Quit


–To a graph theorist - Platonic Graphs


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 46 of 71

Go Back

Full Screen

Close

Quit


How many automorphisms?


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 47 of 71

Go Back

Full Screen

Close

Quit




Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 48 of 71

Go Back

Full Screen

Close

Quit




Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 49 of 71

Go Back

Full Screen

Close

Quit


Straightening Lemma

Theorem (H. Maschke)[5]

The automorphism group of a finite planar graph is isomor-phic to one of the discrete groups of the sphere.

Straightening Lemma

Given a locally finite planar 3-connected graph, then it hasa drawing on either the sphere, the Euclidean plane or thehyperbolic plane such that all its automorphism group isrealized by isometries. [14].


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 50 of 71

Go Back

Full Screen

Close

Quit


Straightening Lemma

Theorem (Mashke)

The automorphism group of a finite planar graph is isomor-phic to one of the discrete groups of the sphere [5].

Straightening Lemma

Given a locally finite planar 3-connected graph, then it hasa drawing on either the sphere, the Euclidean plane or thehyperbolic plane such that all its automorphism group isrealized by isometries.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 51 of 71

Go Back

Full Screen

Close

Quit


Algorithm

1. Choose a connected fundamental regionyou may need a barycentric subdivision first.

2. Record the intersection numbers at each vertex.3. Assemble at a vertex regular n-gons.4. Take the dual at the vertex


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 52 of 71

Go Back

Full Screen

Close

Quit


Different choices of fundamental region give differentstraightenings.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 53 of 71

Go Back

Full Screen

Close

Quit


Using the 4–3–3–4–3


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 54 of 71

Go Back

Full Screen

Close

Quit


Using the 4–4–4–4


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 55 of 71

Go Back

Full Screen

Close

Quit


Moral

We can study automorphisms of 3-connected planar graphsvia geometry:

Example: classifying self-dual graphs


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 56 of 71

Go Back

Full Screen

Close

Quit


3. Connectivity

Maps are not enough

A self-dual graph with no corresponding self-dual map.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 57 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 58 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 59 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 60 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 61 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 62 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 63 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 64 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 65 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 66 of 71

Go Back

Full Screen

Close

Quit



Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 67 of 71

Go Back

Full Screen

Close

Quit


The 3-Block Tree

For a 2-connected graph G, the cycle matroid of G is the2-sum over the cycle matroids of the 3-blocks of G:

M(G) = M(G0)⊕e1

M(G1) . . .⊕ek

M(Gk)


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 68 of 71

Go Back

Full Screen

Close

Quit


The Block-Cutpoint Tree

For any graph G, the cycle matroid of G is the direct sumover the cycle matroids of the blocks of G:

M(G) =∑

M(Gi)


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 69 of 71

Go Back

Full Screen

Close

Quit


4. The Program

Program: Given a planar graph with whose automorphismgroup has finitely many vertex orbits.

1. If 3-connected – embed and straighten so that the au-tomorphisms are represented by isometries (euclidean,spherical, or hyperbolic).

Apply geometric methods.

2. Else if two-connected – form the 3–block tree and usethe program on each block, and merge with data on theautomorphisms of the tree.

3. Else if connected – from the block-cutpoint tree and ap-ply the program to each block, merging with the treeautomorphisms.

4. Else apply program to each connected component, andmerge with permutations of isomorphic components.


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 70 of 71

Go Back

Full Screen

Close

Quit


5. Bibliography

References

[1] H. S. M. Coxeter, Coloured symmetry, M. C. Escher: art and science (Rome, 1985), North-Holland, Amsterdam, 1986, pp. 15–33. MR MR891664

[2] Dan Davis, On a tiling scheme from M. C. Escher, Electron. J. Combin. 4 (1997), no. 2,Research Paper 23, approx. 11 pp. (electronic), The Wilf Festschrift (Philadelphia, PA,1996). MR MR1444170 (98c:52022)

[3] E. S. Fedorov, Pravilnoe delenie ploskosti i prostranstva, “Nauka” Leningrad. Otdel.,Leningrad, 1979, Translated from the 1899 German original by A. V. Nardova, With apreface by I. I. Safranovskiı, V. A. Frank-Kamenecki˘ı and K. P. Janulov, With papersby Safranovskiı, Frank-Kameneckiı, B. N. Delone, R. V. Galiulin and M. I. Stogrin. MRMR571363 (81g:01022)

[4] L. Christine Kinsey, Theresa Moore, and Efstratios Prassidis, Geometry and symmetry,Wiley, 2010.

[5] H. Maschke, The representation of finite groups, especially of the rotation groups of the reg-ular bodies of three-and four-dimensional space, by cayley’s color diagrams, American Jour-nal of Mathematics 18 (1896), no. 2, 156–194, http://www.jstor.org/stable/2369680.

[6] Steve Passiouras, http://www.eschertiles.com/.

[7] Tomaz Pisanski, Doris Schattschneider, and Brigitte Servatius, Applying Burnside’s lemmato a one-dimensional Escher problem, Math. Mag. 79 (2006), no. 3, 167–180. MRMR2228828

[8] Doris Schattschneider, Escher’s combinatorial patterns, Electron. J. Combin. 4 (1997),no. 2, Research Paper 17, approx. 31 pp. (electronic), The Wilf Festschrift (Philadelphia,PA, 1996). MR MR1444164 (99b:52051)

http://www.jstor.org/stable/2369680

http://www.eschertiles.com/


Geometry to Graphs

Connectivity

The Program

Bibliography

Home Page

Title Page

JJ II

J I

Page 71 of 71

Go Back

Full Screen

Close

Quit


[9] Brigitte Servatius, geometry of folding paper dolls, Math. Gaz. 81 (1997), no. 490, 29–37.

[10] Brigitte Servatius and Peter R. Christopher, Construction of self-dual graphs, Amer.Math. Monthly 99 (1992), no. 2, 153–158, http://dx.doi.org/10.2307/2324184. MRMR1144356 (92k:05047)

[11] Brigitte Servatius and Herman Servatius, Self-dual maps on the sphere, Discrete Math. 134(1994), no. 1-3, 139–150, Algebraic and topological methods in graph theory (Lake Bled,1991). MR MR1303403 (96d:05044)

[12] , The 24 symmetry pairings of self-dual maps on the sphere, Discrete Math.140 (1995), no. 1-3, 167–183, http://dx.doi.org/10.1016/0012-365X(94)00293-R. MRMR1333718 (96e:52028)

[13] , Self-dual graphs, Discrete Math. 149 (1996), no. 1-3, 223–232, http://dx.doi.org/10.1016/0012-365X(94)00351-I. MR MR1375109 (96m:05176)

[14] , Symmetry, automorphisms, and self-duality of infinite planar graphs and tilings,International Scientific Conference on Mathematics. Proceedings (Zilina, 1998), Univ.Zilina, Zilina, 1998, pp. 83–116. MR MR1739919

[15] Neil Sloan, The on-line encyclopedia of integer sequences (oeis), http://www.research.att.com/~njas/sequences/.

http://dx.doi.org/10.2307/2324184

http://dx.doi.org/10.1016/0012-365X(94)00293-R

http://dx.doi.org/10.1016/0012-365X(94)00351-I

http://dx.doi.org/10.1016/0012-365X(94)00351-I

http://www.research.att.com/~njas/sequences/

http://www.research.att.com/~njas/sequences/

Documents

1.Mirrors and Symmetry - WPI · Lens and Lightsusers.wpi.edu/~bservat/pittsburgtalk.pdfMirrors and Symmetry Geometry to Graphs Connectivity The Program Bibliography Home Page Title