Related papers: Convex domino towers
Geometric optics is analysed using the techniques of Presymplectic Geometry. We obtain the symplectic structure of the space of light rays in a medium of a non constant refractive index by reduction from a presymplectic structure, and using…
Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this chapter we generalize that result. Let a p-column polyomino be a polyomino whose columns…
In this article we pose the problem of existence and uniqueness of convex body for which the projection curvature radius function coincides with given function. We find a necessary and sufficient condition that ensures a positive answer to…
We discuss asymptotic properties of a family of discrete probability measures which may be used to model particle configurations with a wall on a set of discrete nodes. The correlations are shown to be determinantal and are expressed in…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…
We derive explicit rational generating functions for weighted tilings of $2k\times n$ rectangles by straight $k\times 1$ tiles. Our approach combines a decomposition by fault lines with a Hadamard-product framework. Tools from algebraic…
Recent work by Forsg{\aa}rd indicates that not every convex lattice polygon arises as the characteristic polygon of an affine dimer or, equivalently, an admissible oriented line arrangement on the torus in general position. We begin the…
In this paper we construct a Dwork theory for general exponential sums over affinoids in Witt towers. Using this, we compute the degree of the $L$-function, its Hodge polygon and examine when the Hodge and Newton polygons coincide.
We analyze asymptotic height function fluctuations in uniformly random domino tiling models on multiply connected Temperleyan domains. Starting from asymptotic formulas derived by Kenyon [arXiv:math-ph/9910002v1], we show that (1) the…
By using row convex tableaux, we study the section rings of Bott-Samelson varieties of type A. We obtain flat deformations and standard monomial type bases of the section rings. In a separate section, we investigate a three dimensional…
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…
A permutomino of size n is a polyomino determined by a pair of permutations of size n+1, such that they differ in each position. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
We adapt the Kolmogorov's normalization algorithm (which is the key element of the original proof scheme of the KAM theorem) to the construction of a suitable normal form related to an invariant elliptic torus. As a byproduct, our procedure…
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…
In this essay we introduce a theoretical framework designed to describe black hole dynamics. The difficulties in understanding such dynamics stems from the proliferation of scales involved when one attempts to simultaneously describe all of…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
Back in the early days of polyomino enumeration, a model called column-convex polyominoes was introduced and its area generating function was found. That generating function is rational: the numerator has degree four and the denominator has…