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
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...
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 ...
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 ...
Convex hull peeling
Convex hull peeling
Enveloppes convexes pelées
Cette thèse porte sur la construction du convex hull peeling (qu’on pourrait traduire littéralement par enveloppe convexe pelée). Le conv...
On counting Z-convex polyominoes
On counting Z-convex polyominoes
Abstract
We show a decomposition that allows to compute the number of convex polyominoes of area
n
an...
Decomposable Convexities in Graphs and Hypergraphs
Decomposable Convexities in Graphs and Hypergraphs
Given a connected hypergraph with vertex set V, a convexity space on is a subset
of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under inter...
Characterization of the Propagation Route of Light Passing Through Convex Lens
Characterization of the Propagation Route of Light Passing Through Convex Lens
Abstract
Existing optical theory states that the light directed to the optical center of the convex lens will travel in a straight line. Does the theory hold? If this is tr...