Results 131 to 140 of about 920 (172)
Polyominoes on the infinite checkerboard
Journal of Combinatorial Theory, Series A, 1980 Murray S. Klamkin +1 more
openaire +2 more sources
Parity Property of Hexagonal Sliding Puzzles. [PDF]
Mathematica (N Y)Estévez M, Karpman R, Roldán É.
europepmc +1 more source
Ordering and Convex Polyominoes
, 2005 We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order.
CASTIGLIONE, Giuseppa, RESTIVO, Antonio
openaire +2 more sources
Enumeration of 4-stack polyominoes
Theoretical Computer Science, 2013 In this paper, we consider the class of 4-stack polyominoes, i.e. polyominoes which can be decomposed into a central rectangle supporting four stack polyominoes, one on each side of the rectangle. This class of objects - recently introduced by Marc Noy -
J M Fedou, A Frosini
exaly +2 more sources
Hilbert series of parallelogram polyominoes
Research in Mathematical Sciences, 2022 We present a conjecture about the reduced Hilbert series of the coordinate ring of a simple polyomino in terms of particular arrangements of non-attacking rooks that can be placed on the polyomino.
Ayesha Asloob Qureshi +1 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2021 Data Compression Conference (DCC), 2021
We provide a compact representation of polyominoes with n cells that supports navigation and visibility queries in constant time. Our oracle takes 3n +o(n) bits. Previous enumeration efforts indicate that at least 2.00091 n -o(n) bits (likely 2.021 n -o(n) bits) are required to distinguish polyominoes, hence confirming that our oracle is compact.
openaire +1 more source
We provide a compact representation of polyominoes with n cells that supports navigation and visibility queries in constant time. Our oracle takes 3n +o(n) bits. Previous enumeration efforts indicate that at least 2.00091 n -o(n) bits (likely 2.021 n -o(n) bits) are required to distinguish polyominoes, hence confirming that our oracle is compact.
openaire +1 more source
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011
We explore the art gallery problem for the special case that the domain (gallery) P is an m-polyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P; in particular, we show that floor((m+1)/3) point ...
Therese Biedl +4 more
openaire +1 more source
We explore the art gallery problem for the special case that the domain (gallery) P is an m-polyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P; in particular, we show that floor((m+1)/3) point ...
Therese Biedl +4 more
openaire +1 more source
Code for polyomino and computer search of isospectral polyominoes
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaodong Liang, Rui Wang, Jixiang Meng
openaire +1 more source