Related papers: Convex domino towers
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly…
This article is dedicated to domino tilings of square grids. In each of these grids domino tilings are represented using linear-recurrent sequences. For different grids are determined new dependencies.
The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior…
We study the famous Leonardo Da Vinci's domes, as well as the variations invented by Rinus Roelofs, from a mathematical viewpoint. In particular, we consider the problem of closing the dome in order to produce a spherical structure. We…
In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…
A polyomino is a finite, edge-connected set of cells in the plane. At the present time, an enumeration of all polyominoes is nowhere in sight. On the other hand, there are several subsets of polyominoes for which generating functions are…
Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…
In this paper, we analyze the stochastic properties of some large size (area) polyominoe's perimeter such that the directed column-convex polyomino, the column-convex polyomino, the directed diagonally-convex polyomino, the staircase (or…
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4x5x1…
In this paper we study the degeneration of convex real projective structures on bordered surfaces.
In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…
The explicit construction of function fields tower with many rational points relative to the genus in the tower play a key role for the construction of asymptotically good algebraic-geometric codes. In 1997 Garcia, Stichtenoth and Thomas…
We overview the main ideas and techniques of the functional-analytical approach to some extremal problems of convex geometry that stem from the Queen Dido problem.
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the…
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives the number of domino tilings of the Aztec…
This paper is a survey on the Lickorish type construction of some kind of closed manifolds over simple convex polytopes. Inspired by Lickorish's theorem, we propose a method to describe certain families of manifolds over simple convex…
We characterize building sets whose associated nonsingular projective toric varieties are Fano. Furthermore, we show that all such toric Fano varieties are obtained from smooth Fano polytopes associated to finite directed graphs.
An Artin-Schreier tower over the finite field F_p is a tower of field extensions generated by polynomials of the form X^p - X - a. Following Cantor and Couveignes, we give algorithms with quasi-linear time complexity for arithmetic…
``Quasi-elliptic'' functions can be given a ring structure in two different ways, using either ordinary multiplication, or convolution. The map between the corresponding standard bases is calculated. A related structure has appeared…