Date: | May 4, 2017 |
---|---|
Location: | DC 1331 |
Time: | 1:30 |
Chair: | Stephen Mann |
Date: | May 11, 2017 | May 18, 2017 | May 25, 2017 | June 1, 2017 |
---|---|---|---|---|
Location: | DC 1331 11:30 | DC 1331 1:30 | DC 3317 1:30 | DC 1331 1:30 |
Chair: | Jade Marcoux-Ouellet |
Tyler Nowicki |
Reza Adhitya Saputra |
Matthew Thorne |
Technical Presentation: | Stephen Mann |
Jade Marcoux-Ouellet |
Tyler Nowicki |
Reza Adhitya Saputra |
Craig S. Kaplan |
Title : Heesch numbers of convex polygons
Abstract: A polygon's Heesch number is the number of times that polygon can be surrounded by rings of copies of itself. Very little is known about which Heesch numbers are possible, and a greater understanding of this problem could shed light on open questions in tiling theory. I will talk about Heesch numbers of convex polygons, with an emphasis on two questions. First, does there exist a convex n-gon for every n with non-trivial Heesch number? Second, what can we say about Heesch numbers of convex pentagons? |
---|
Also see other Math and CS postings.