Abstract
We provide a bijection between parallelogram polyominoes and suitable pairs of linear partitions. This lets us design a CAT (Constant Amortized Time) algorithm for generating all parallelogram polyominoes of size n using \(O(\sqrt n)\) space.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barcucci, E., Frosini, A., Rinaldi, S.: Direct-convex polyominoes: ECO method and bijective results. In: Brak, R., Foda, O., Greenhill, C., Guttman, T., Owczarek, A. (eds.) Proceedings of Formal Power Series and Algebraic Combinatorics 2002, Melbourne (2002)
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comp. Sci. 155(2), 321–347 (1996)
Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: ECO:a methodology for the enumeration of combinatorial objects. J. of Diff. Eq. and App. 5, 435–490 (1999)
Bousquet-Mélou, M.: A method for the enumeration of various classes of column-convex polygons. Discrete Math. 154, 1–25 (1996)
Castiglione, G., Vaglica, R.: Recognizable Picture Languages and Polyominoes. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 160–171. Springer, Heidelberg (2007)
De Carli, F., Frosini, A., Rinaldi, S., Vuillon, L.: On the Tiling System Recognizability of Various Classes of Convex Polyominoes. Ann. Comb. 13, 169–191 (2009)
Delest, M., Dubernard, J.P., Dutour, I.: Parallelogram Polyominoes and Corners. J. Symb. Comp. 20, 503–515 (1995)
Delest, M., Viennot, X.G.: Algebraic languages and polyominoes enumeration. Theoret. Comp. Sci. 34, 169–206 (1984)
Del Lungo, A., Duchi, E., Frosini, A., Rinaldi, S.: On the generation and enumeration of various classes of convex polyominoes. Electronic Journal of Combinatorics 11, 60 (2004)
Del Lungo, A., Mirolli, M., Pinzani, R., Rinaldi, S.: A Bijection for Directed-Convex Polyominoes. In: Proc. of DM-CCG 2001, Discrete Mathematics and Theoretical Computer Science AA, pp. 133–144 (2001)
Golomb, S.W.: Checker Boards and Polyominoes. The American Mathematical Monthly 61, 675–682 (1954)
Kuba, A., Balogh, E.: Reconstruction of convex 2D discrete sets in polynomial time. Theoret. Comp. Sci. 283(1), 223–242 (2002)
Massazza, P.: A CAT algorithm for sand piles. PU.M.A. 19(2-3), 147–158 (2008)
Massazza, P., Radicioni, R.: A CAT algorithm for the exhaustive generation of ice piles. RAIRO Theoretical Informatics and Applications 44, 525–543 (2010)
Massazza, P., Radicioni, R.: On the Exhaustive Generation of Symmetric Sand Piles. In Proc. of GASCom 2010, Montréal, September 2-4 (2010)
Ollinger, N.: Tiling the Plane with a Fixed Number of Polyominoes. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 638–647. Springer, Heidelberg (2009)
Pergola, E., Sulanke, R.A.: Schröder Triangles, Paths, and Parallelogram Polyominoes. Journal of Integer Sequences, 1 Article 98.1.7 (1998)
Polya, G.: On the number of certain lattice polygons. J. Comb. Theory 6, 102–105 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mantaci, R., Massazza, P. (2011). From Linear Partitions to Parallelogram Polyominoes. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)