On the Enumeration of Chequered Tilings in Polygons

Aus de_evolutionary_art_org
Version vom 7. Dezember 2017, 11:01 Uhr von Gubachelier (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „ == Referenz == Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara: On the Enumeration of Chequered Tilings in Polygons. In: Bridges 2017, Pages 423…“)

(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu: Navigation, Suche

Referenz

Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara: On the Enumeration of Chequered Tilings in Polygons. In: Bridges 2017, Pages 423–426.

DOI

Abstract

The Tokyo 2020 Olympic and Paralympic games emblems, called ‘harmonized chequered emblems,’ are designed with three kinds of rectangles. We enumerate all such tilings in a dodecagon with a hole.

Extended Abstract

Bibtex

@inproceedings{bridges2017:423,
 author      = {Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara},
 title       = {On the Enumeration of Chequered Tilings in Polygons},
 pages       = {423--426},
 booktitle   = {Proceedings of Bridges 2017: Mathematics, Art, Music, Architecture, Education, Culture},
 year        = {2017},
 editor      = {David Swart, Carlo H. S\'equin, and Krist\'of Fenyvesi},
 isbn        = {978-1-938664-22-9},
 issn        = {1099-6702},
 publisher   = {Tessellations Publishing},
 address     = {Phoenix, Arizona},
 note        = {Available online at \url{http://archive.bridgesmathart.org/2017/bridges2017-423.pdf}}
}

Used References

[1] O. Bodini, T. Fernique, M. Rao, and E. R´emila, Distance on Rhombus Tilings, Theoretical Computer Science, 412 (2011), pp. 4787–4794.

[2] K. Yamanaka, S. Nakano, Y. Matsui, R. Uehara, and K. Nakada, Efficient enumeration of all ladder lotteries and its application, Theoretical Computer Science, 411 (2010), pp. 1714–1722.


Links

Full Text

http://archive.bridgesmathart.org/2017/bridges2017-423.pdf

internal file


Sonstige Links