Results 71 to 80 of about 920 (172)

Generating convex polyominoes at random

, 1996
We give a new recursion formula for the number of convex polyominoes with fixed perimeter. From this we derive a bijection between an interval of natural numbers and the polyominoes of given perimeter.
Moll, Christoph, Hochstättler, Winfried, Loebl, Martin   +2 more
core   +1 more source

Tessellating polyominos in the plane

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ming-You Chen, Frank K. Hwang, Chih-Hung Yen   +2 more
openaire   +2 more sources

ZAGREB CONNECTION INDICES ON POLYOMINO CHAINS AND RANDOM POLYOMINO CHAINS

Open Mathematics
Abstract In this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article thoroughly examines precise formulas and investigates extreme values ...
Sayle Sigarreta Ricardo, Hugo Adán Cruz Suárez   +1 more
openaire   +3 more sources

Hexagonal polyomino achievement

Discrete Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jens-P. Bode, Heiko Harborth
openaire   +2 more sources

Recognizable Picture Languages and Polyominoes

, 2007
We consider the problem of recognizability of some classes of polyominoes in the theory of picture languages. In particular we focus our attention oil the problem posed by Matz of finding a non-recognizable picture language for which his technique for ...
Castiglione G., Vaglica R., CASTIGLIONE, Giuseppa, VAGLICA, Roberto   +3 more
core   +1 more source

Asymptotics of Z-convex polyominoes [PDF]

The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we show that one can compute in polynomial time the number
Guttmann, AJ, Massazza, P
core   +2 more sources

The number of Z-convex polyominoes

, 2008
In this paper we consider a restricted class of polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like the letter Z).
Duchi, E., Gilles Schaeffer, Schaeffer, G., Duchi, Enrica, Enrica Duchi, Simone Rinaldi, Rinaldi, S., Rinaldi, Simone, Schaeffer, Gilles   +8 more
core   +1 more source

Combinatorial aspects of L-convex polyominoes [PDF]

, 2007
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an “L” shaped path in one of its four cyclic orientations.
Castiglione G., Restivo A., A. Restivo, MUNARINI E, Frosini, A., A. Frosini, S. Rinaldi, Rinaldi, S., CASTIGLIONE, Giuseppa, Frosini A., RINALDI, SIMONE, Restivo, A., MUNARINI, EMANUELE, Castiglione, G., RESTIVO, Antonio, Munarini E., FROSINI A, Munarini, E., RINALDI S., G. Castiglione   +19 more
core   +1 more source

From Tetris to polyominoes generation

, 2017
The behaviour of a bad Tetris player suggests a class of polyominoes that we call prefix-closed. Such a class contains all polyominoes P such that for any integer i > 0 the first i columns of P form a polyomino.
Paolo Massazza, Formenti, Enrico, E. Formenti, MASSAZZA, PAOLO, Enrico Formenti   +4 more
core   +1 more source

Solving Generalized Polyomino Puzzles Using the Ising Model. [PDF]

Entropy (Basel), 2022
Takabatake K, Yanagisawa K, Akiyama Y.
europepmc   +1 more source