Related papers: Convex domino towers
We study convex subsets of buildings, discuss some structural features and derive several characterizations of buildings.
We construct a tower of arithmetic generators of the bigraded polynomial ring J_{*,*}^{w, O}(D_n) of weak Jacobi modular forms invariant with respect to the full orthogonal group O(D_n) of the root lattice D_n for 2\le n\le 8. This tower…
We consider tromino tilings of $m\times n$ domino-deficient rectangles, where $3|(mn-2)$ and $m,n\geq0$, and characterize all cases of domino removal that admit such tilings, thereby settling the open problem posed by J. M. Ash and S.…
In this paper we consider a restricted class of convex 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…
We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.
There is a rich history of domino tilings in two dimensions. Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what does the space of all tilings look like? These questions and…
We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…
In this work, we present a new method for generating a threshold structure. This kind of structure can be advantageously used in various halftoning algorithms such as clustered-dot or dispersed-dot dithering, error diffusion with threshold…
We discuss how to construct limit shapes for the domino tiling model (square lattice dimer model) and $5$-vertex model, in appropriate polygonal domains. Our methods are based on the harmonic extension method of [R. Kenyon and I. Prause,…
The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…
The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino…
There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves…
We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…
Recent work of Brlek \textit{et al.} gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze…
In this paper we study the problem of constructing non-trivial subtowers and supertowers of recursive towers of function fields over finite fields.
In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby…
Relativistic domain walls are studied in the framework of a polynomial approximation to the field interpolating between different vacua and forming the domain wall. In this approach we can calculate evolution of a core and of a width of the…
We give a general recipe for explicitly constructing asymptotically optimal towers of modular curves such as {X_0(l^n): n=1,2,3,...}. We illustrate the method by giving equations for eight towers with various geometric features. We conclude…
This article describes, in elementary terms, a generic approach to produce discrete random tilings and similar random structures by using point process theory. The standard Voronoi and Delone tilings can be constructed in this way. For this…
We introduce the notion of a \emph{conic sequence} of a convex polytope. It is a way of building up a polytope starting from a vertex and attaching faces one by one with certain regulations. We apply this to a toric variety to obtain an…