{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:00Z","timestamp":1759638300357},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T00:00:00Z","timestamp":1435881600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p>This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded submatrices) and we discuss how canonical such a description by submatrix-avoidance can be. We provide numerous examples of permutation and polyomino classes which may be defined and studied from the submatrix-avoidance point of view, and conclude with various directions for future research on this topic.<\/jats:p>","DOI":"10.1017\/s0960129515000250","type":"journal-article","created":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T14:57:07Z","timestamp":1435935427000},"page":"157-183","source":"Crossref","is-referenced-by-count":2,"title":["Permutation classes and polyomino classes with excluded submatrices"],"prefix":"10.1017","volume":"27","author":[{"given":"DANIELA","family":"BATTAGLINO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MATHILDE","family":"BOUVEL","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDREA","family":"FROSINI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SIMONE","family":"RINALDI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2015,7,3]]},"reference":[{"key":"S0960129515000250_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2006.07.006"},{"key":"S0960129515000250_ref5","first-page":"118","volume-title":"Invariant Theory and Tableaux","author":"Bj\u00f6rner","year":"1990"},{"key":"S0960129515000250_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80052-4"},{"key":"S0960129515000250_ref16","doi-asserted-by":"crossref","first-page":"22","DOI":"10.37236\/2099","article-title":"Non-contiguous pattern avoidance in binary trees","volume":"19","author":"Dairyko","year":"2012","journal-title":"Electronic Journal of Combinatorics"},{"key":"S0960129515000250_ref22","unstructured":"Guibert O. (1995). Combinatoire des permutations \u00e0 motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, Ph.D. thesis, University of Bordeaux."},{"key":"S0960129515000250_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00003-F"},{"key":"S0960129515000250_ref9","doi-asserted-by":"crossref","first-page":"P5","DOI":"10.37236\/2001","article-title":"Mesh patterns and the expansion of permutation statistics as sums of permutation patterns","volume":"18","author":"Br\u00e4nd\u00e9n","year":"2011","journal-title":"Electronic Journal of Combinatorics"},{"key":"S0960129515000250_ref30","doi-asserted-by":"publisher","DOI":"10.4310\/JOC.2010.v1.n1.a3"},{"key":"S0960129515000250_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.06.031"},{"key":"S0960129515000250_ref19","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1257-126"},{"key":"S0960129515000250_ref27","doi-asserted-by":"crossref","unstructured":"Ryser H. (1963). Combinatorial mathematics. The Carus Mathematical Monographs, no. 14, The Mathematical Association of America, Rahway.","DOI":"10.5948\/UPO9781614440147"},{"key":"S0960129515000250_ref24","volume-title":"The Art of Computer Programming","author":"Knuth","year":"1975"},{"key":"S0960129515000250_ref31","first-page":"273","article-title":"A unification of permutation patterns related to Schubert varieties","volume":"22","author":"\u00dalfarsson","year":"2011","journal-title":"Pure Mathematics and Applications"},{"key":"S0960129515000250_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90116-6"},{"key":"S0960129515000250_ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1964-0184217-8"},{"key":"S0960129515000250_ref2","unstructured":"Battaglino D. (2014). Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints, Thesis of the University of Siena and the University of Nice Sophia Antipolis, Available at http:\/\/arxiv.org\/abs\/1405.3146."},{"key":"S0960129515000250_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.12.007"},{"key":"S0960129515000250_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00494-9"},{"key":"S0960129515000250_ref6","doi-asserted-by":"publisher","DOI":"10.1201\/9780203494370"},{"key":"S0960129515000250_ref20","doi-asserted-by":"publisher","DOI":"10.2307\/2307321"},{"key":"S0960129515000250_ref28","first-page":"79","article-title":"Pattern avoidance in set partitions","volume":"94","author":"Sagan","year":"2010","journal-title":"Ars Combinatoria"},{"key":"S0960129515000250_ref23","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1996.0005"},{"key":"S0960129515000250_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31834-7_10"},{"key":"S0960129515000250_ref1","unstructured":"Albert M. (2012). PermLab: Software for permutation patterns, Available at http:\/\/www.cs.otago.ac.nz\/staffpriv\/malbert\/permlab.php."},{"key":"S0960129515000250_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.06.020"},{"key":"S0960129515000250_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2010.03.004"},{"key":"S0960129515000250_ref10","unstructured":"Burstein A. (1998). Enumeration of Words with Forbidden Patterns, Ph.D. thesis, University of Pennsylvania."},{"key":"S0960129515000250_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31965-8_11"},{"key":"S0960129515000250_ref4","doi-asserted-by":"crossref","unstructured":"Bernini A. , Ferrari L. , Pinzani R. and West J. (2013). Pattern-avoiding Dyck paths. In: Proceedings of 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), Paris, France, June 24\u201328, in: DMTCS Proceedings Series, vol. AS, 683\u2013694.","DOI":"10.46298\/dmtcs.2334"},{"key":"S0960129515000250_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2004.04.002"},{"key":"S0960129515000250_ref17","doi-asserted-by":"publisher","DOI":"10.4310\/JOC.2014.v5.n4.a5"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129515000250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T01:38:08Z","timestamp":1652751488000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129515000250\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["S0960129515000250"],"URL":"https:\/\/doi.org\/10.1017\/s0960129515000250","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,3]]}}}