Tiling the Plane with Permutations

  • Alexandre Blondin Massé
  • Andrea Frosini
  • Simone Rinaldi
  • Laurent Vuillon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6607)

Abstract

A permutomino is a polyomino uniquely determined by a pair of permutations. Recently permutominoes, and in particular convex permutominoes have been studied by several authors concerning their analytical and bijective enumeration, tomographical reconstruction, and the algebraic characterization of the associated permutations [2,3]. On the other side, Beauquier and Nivat [5] introduced and gave a characterization of the class of pseudo-square polyominoes, i.e. polyominoes that tile the plane by translation: a polyomino is called pseudo-square if its boundary word may be factorized as \(XY\overline{X} \,\overline{Y}\).

In this paper we consider the pseudo-square polyominoes which are also convex permutominoes. By using the Beauquier-Nivat characterization we provide some geometrical and combinatorial properties of such objects, and we show for any fixed X, each word Y such that \(XY\overline{X} \,\overline{Y}\) is pseudo-square is prefix of an infinite word Y  ∞  with period 4 |X| N |X| E .

Some conjectures obtained through exhaustive search are also presented and discussed in the final section.

Keywords

Vertical Segment Tomographical Reconstruction Schubert Variety Boundary Word Leftmost Column 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Brlek, S., Frosini, A., Rinaldi, S., Vuillon, L.: Tilings by translation: enumeration by a rational language approach. The Electronic Journal of Combinatorics 13(1) (2006)Google Scholar
  2. 2.
    Bernini, A., Disanto, F., Pinzani, R., Rinaldi, S.: Permutations defining convex permutominoes. Journal of Integer Sequences, J. Int. Seq. 10, Article 07.9.7 (2007)Google Scholar
  3. 3.
    Disanto, F., Frosini, A., Pinzani, R., Rinaldi, S.: A closed formula for the number of convex permutominoes. El. J. Combinatorics 14, #R57 (2007)Google Scholar
  4. 4.
    Fraenkel, A.S.: The Rat game and the Mouse game, to appear in Games of No Chance 4Google Scholar
  5. 5.
    Girault-Beauquier, D., Nivat, M.: Tiling the plane with one tile. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkley, California, United States, June 7-9 (1990)Google Scholar
  6. 6.
    Golomb, S.W.: Polyominoes: Puzzles, Patterns, Problems, and Packings. Princeton Academic Press, London (1996)MATHGoogle Scholar
  7. 7.
    Kassel, C., Lascoux, A., Reutenauer, C.: The singular locus of a Schubert variety. J. Algebra 269, 74–108 (2003)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Wijshoff, H.A.G., Van Leeuven, J.: Arbitrary versus periodic storage schemes and tesselations of the plane using one type of polyomino. Inform. Control 62, 1–25 (1991)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alexandre Blondin Massé
    • 1
  • Andrea Frosini
    • 2
  • Simone Rinaldi
    • 3
  • Laurent Vuillon
    • 1
  1. 1.Laboratoire de MathématiquesUniversité de Savoie, CNRS UMR 5127Le Bourget du LacFrance
  2. 2.Dipartimento di Sistemi e InformaticaUniversità di FirenzeFirenzeItaly
  3. 3.Dipartimento di Matematica e InformaticaUniversità di SienaSienaItaly

Personalised recommendations