Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-23T13:51:44.521Z Has data issue: false hasContentIssue false
  • English
  • Français

THE TILING SEMIGROUPS OF ONE-DIMENSIONAL PERIODIC TILINGS

Part of: Semigroups Designs and configurations

Published online by Cambridge University Press:  23 July 2009

E. R. DOMBI  and
N. D. GILBERT
E. R. DOMBI
Affiliation:
School of Mathematical & Computer Sciences, and The Maxwell Institute for Mathematical Sciences, Heriot-Watt University, Edinburgh EH14 4AS, UK (email: [email protected])
N. D. GILBERT*
Affiliation:
School of Mathematical & Computer Sciences, and The Maxwell Institute for Mathematical Sciences, Heriot-Watt University, Edinburgh EH14 4AS, UK (email: [email protected])
*
✉For correspondence; e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A one-dimensional tiling is a bi-infinite string on a finite alphabet, and its tiling semigroup is an inverse semigroup whose elements are marked finite substrings of the tiling. We characterize the structure of these semigroups in the periodic case, in which the tiling is obtained by repetition of a fixed primitive word.

Keywords

tilinginverse semigrouppartition

MSC classification

Secondary: 20M18: Inverse semigroups 05B45: Tessellation and tiling problems 20M10: General structure theory
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 87 , Issue 2 , October 2009 , pp. 153 - 160
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2009

References

[1]Gardelle, J. and Guilbaud, G. Th., ‘Cadences’, Math. Sci. Hum. 9 (1964), 31–38.Google Scholar
[2]Kellendonk, J. and Lawson, M. V., ‘Tiling semigroups’, J. Algebra 224 (2000), 140–150.Google Scholar
[3]Lawson, M. V., Inverse Semigroups (World Scientific, Singapore, 1998).CrossRefGoogle Scholar
[4]Lawson, M. V., ‘E *-unitary semigroups’, in: Semigroups, Algorithms, Automata and Languages (eds. G. M. S. Gomes, J.-E. Pin and P. V. Silva) (World Scientific, Singapore, 2002).Google Scholar
[5]Lawson, M. V., ‘One-dimensional tiling semigroups’, Semigroup Forum 68 (2004), 159–176.Google Scholar
[6]Lothaire, M., Combinatorics on Words (Cambridge University Press, Cambridge, 1997).CrossRefGoogle Scholar
[7]McAlister, D. B., ‘An introduction to E *-unitary inverse semigroups – from an old fashioned perspective’, Proc. Workshop on Semigroups and Languages, Lisbon, 2002 (eds. I. M. Araújo, M. J. J. Branco, V. H. Fernandes and G. M. S. Gomes) (World Scientific, Singapore, 2004).Google Scholar
[8]McAlister, D. B. and Soares de Almeida, F., ‘One-dimensional tiling semigroups and factorial languages’, Comm. Algebra 37 (2009), 276–295.CrossRefGoogle Scholar
[9]Petrich, M., Inverse Semigroups (Wiley, New York, 1984).Google Scholar