Results 41 to 50 of about 2,994 (170)

Fixed Parameter Undecidability for Wang Tilesets [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2012
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets.
Emmanuel Jeandel, Nicolas Rolin
doaj   +1 more source

Some Inverse Relations Determined by Catalan Matrices

open access: yesInternational Journal of Combinatorics, Volume 2013, Issue 1, 2013., 2013
We use the A‐sequence and Z‐sequence of Riordan array to characterize the inverse relation associated with the Riordan array. We apply this result to prove some combinatorial identities involving Catalan matrices and binomial coefficients. Some matrix identities obtained by Shapiro and Radoux are all special cases of our identity.
Sheng-liang Yang, Laszlo A. Szekely
wiley   +1 more source

Combinatorics of non-ambiguous trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault ...
Jean-Christophe Aval   +3 more
doaj   +1 more source

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem [PDF]

open access: yes, 2016
We prove that every simply connected orthogonal polygon of $n$ vertices can be partitioned into $\left\lfloor\frac{3 n +4}{16}\right\rfloor$ (simply connected) orthogonal polygons of at most 8 vertices. It yields a new and shorter proof of the theorem of
Győri, Ervin, Mezei, Tamás Róbert
core   +2 more sources

Log‐balanced combinatorial sequences

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2005, Issue 4, Page 507-522, 2005., 2005
We consider log‐convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log‐balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log‐balancedness are given for the case when the sequence satisfies a two‐ (or more‐) term linear recurrence. It
Tomislav Došlić
wiley   +1 more source

A $q,t-$analogue of Narayana numbers [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
We study the statistics $\mathsf{area}$, $\mathsf{bounce}$ and $\mathsf{dinv}$ associated to polyominoes in a rectangular box $m$ times $n$. We show that the bi-statistics ($\mathsf{area}$,$\mathsf{bounce}$) and ($\mathsf{area}$,$\mathsf{dinv}$) give ...
Jean-Christophe Aval   +4 more
doaj   +1 more source

A New Algorithm Based on Colouring Arguments for Identifying Impossible Polyomino Tiling Problems

open access: yesAlgorithms, 2022
Checkerboard colouring arguments for proving that a given collection of polyominoes cannot tile a finite target region of the plane are well-known and typically applied on a case-by-case basis. In this article, we give a systematic mathematical treatment
Marcus R. Garvie, John Burkardt
doaj   +1 more source

A Tiling-Theoretic Approach to Efficient Area Coverage in a Tetris-Inspired Floor Cleaning Robot

open access: yesIEEE Access, 2018
Although numerous studies have focused on the development and application of polyomino tiling theories, research of this nature is typically limited to the graphics and gaming fields.
Prabakaran Veerajagadheswar   +3 more
doaj   +1 more source

A code for square permutations and convex permutominoes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass of ...
Enrica Duchi
doaj   +1 more source

Succession rules and Deco polyominoes [PDF]

open access: yesRAIRO - Theoretical Informatics and Applications, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BARCUCCI, ELENA   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy