{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:14:42Z","timestamp":1777644882520,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3-4","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p>\n                    In this paper we consider the class of column-convex permutominoes, i.e. column-convex polyominoes defined by a pair of permutations (\u03c0\n                    <jats:sub>1<\/jats:sub>\n                    , \u03c0\n                    <jats:sub>2<\/jats:sub>\n                    ). First, using a geometric construction, we prove that for every permutation \u03c0 there is at least one column-convex permutomino P such that \u03c0\n                    <jats:sub>1<\/jats:sub>\n                    (P) = \u03c0 or \u03c0\n                    <jats:sub>2<\/jats:sub>\n                    (P) = \u03c0. In the second part of the paper, we show how, for any given permutation \u03c0, it is possible to define a set of logical implications on the points of \u03c0, and prove that there exists a column-convex permutomino P such that \u03c0\n                    <jats:sub>1<\/jats:sub>\n                    (P) = \u03c0 if and only if is satisfiable. This property can be then used to give a characterization of the set of column-convex permutominoes P such that \u03c0\n                    <jats:sub>1<\/jats:sub>\n                    (P) = \u03c0.\n                  <\/jats:p>","DOI":"10.3233\/fi-2013-867","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:29:34Z","timestamp":1575332974000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Polygons Drawn from Permutations"],"prefix":"10.1177","volume":"125","author":[{"given":"Stefano","family":"Bilotta","sequence":"first","affiliation":[{"name":"Dipartimento di Sistemi e Informatica, Universit\u00e1 di Firenze, Viale Morgagni 65, 50134, Firenze, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Rinaldi","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria Informatica e Scienze Matematiche, Universit\u00e1 di Siena, Via Roma 56, 53100, Siena, Italy. rinaldi@unisi.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samanta","family":"Socci","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria Informatica e Scienze Matematiche, Universit\u00e1 di Siena, Via Roma 56, 53100, Siena, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2013,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2013-867","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2013-867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:30:39Z","timestamp":1777444239000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2013-867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":0,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.3233\/FI-2013-867"],"URL":"https:\/\/doi.org\/10.3233\/fi-2013-867","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}