Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Asymptotics of Z-convex polyominoes
View through CrossRef
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 of polyominoes of area n and degree of convexity at most 2 (the so-called Z-convex polyominoes). The integer sequence that we have computed allows us to conjecture the asymptotic number an of Z-convex polyominoes of area n, ɑn ∼ C·exp(π)√11n/4⁄n3/2.
Title: Asymptotics of Z-convex polyominoes
Description:
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 of polyominoes of area n and degree of convexity at most 2 (the so-called Z-convex polyominoes).
The integer sequence that we have computed allows us to conjecture the asymptotic number an of Z-convex polyominoes of area n, ɑn ∼ C·exp(π)√11n/4⁄n3/2.
Related Results
Ostrowski-Type Fractional Integral Inequalities: A Survey
Ostrowski-Type Fractional Integral Inequalities: A Survey
This paper presents an extensive review of some recent results on fractional Ostrowski-type inequalities associated with a variety of convexities and different kinds of fractional ...
On the number of isohedral polyominoes
On the number of isohedral polyominoes
A polyomino is a connected figure on a plane composed from a finite number of unit squares adjacent to each other on the sides. A tiling of a plane into polyominoes is called isohe...
Tilings by Translation: Enumeration by a Rational Language Approach
Tilings by Translation: Enumeration by a Rational Language Approach
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes, i.e. those polyominoes that tile the plane by translation: a polyomino tiles ...
2L convex polyominoes: discrete tomographical aspects
2L convex polyominoes: discrete tomographical aspects
This paper uses the theoretical material developed in a previous article by the authors in order to reconstruct a subclass of 2L-convex polyominoes. The main idea is to control the...
Enumeration of minimal 3D polyominoes inscribed in a rectangular prism
Enumeration of minimal 3D polyominoes inscribed in a rectangular prism
We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a ...
Asymptotics for some logistic maps and the renormalization group
Asymptotics for some logistic maps and the renormalization group
Abstract
We explain the relation between the r = 1 case of the logistic map x
i+1 = r
x
...
RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES
RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES
A polyomino P is called 2L-convex if for every two cells there exists a monotone path included in P with at most 2 changes of direction. This paper studies the geometrical and the ...
Two subclasses of 2-convex polyominoes: properties for reconstruction
Two subclasses of 2-convex polyominoes: properties for reconstruction
A polyomino P is called 2-convex if for every two cells there exists a monotone path included in P with at most 2 changes of direction. This paper studies the tomographical aspects...