Related papers: On the enumeration of k-omino towers

We first enumerate a generalization of domino towers that was proposed by Tricia M. Brown (J. Integer Seq. 20 (2017)), which we call S-omino towers. We establish equations that the generating function must satisfy and then apply the…

We study convex domino towers using a classic dissection technique on polyominoes to find the generating function and an asymptotic approximation.

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…

We introduce the $k$-bonacci polyominoes, a new family of polyominoes associated with the binary words avoiding $k$ consecutive $1$'s, also called generalized $k$-bonacci words. The polyominoes are very entrancing objects, considered in…

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

Let $m,k$ be fixed positive integers. Determining the generating function for the number of tilings of an $m\times n$ rectangle by $k\times 1$ rectangles is a long-standing open problem to which the answer is only known in certain special…

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…

H. N. V. Temperley's method for counting vertically convex polyominoes is modified, generalized, and most importantly, programmed (in Maple).

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…

We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…

Every $(\infty, n)$-category can be approximated by its tower of homotopy $(m, n)$-categories. In this paper, we prove that the successive stages of this tower are classified by k-invariants, analogously to the classical Postnikov tower for…

A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give…

Building from ideas of hypercomplex analysis on the quaternionic unit ball, we introduce Hermitian, Riemannian and K\"ahler-like structures on the latter. These are built from the so-called regular M\"obius transformations. Such geometric…

An alternative generating function is proposed to enumerate row-convex polyominoes without internal holes on a discrete grid. The approach is based on integer partitions of the total area, where each partition corresponds to a sequence of…

Our results are of three types. First we describe a general procedure of adjoining polynomial variables to $A_\infty$-ring spectra whose coefficient rings satisfy certain restrictions.A host of examples of such spectra is provided by…

Let $k$ be a field of characteristic zero and let $K=k(t)$ be the rational function field over $k$. In this paper we combine a formula of Ulmer for ranks of certain Jacobians over $K$ with strong upper bounds on endomorphisms of Jacobians…

Let $X$ be a projective, connected and smooth scheme defined over an algebraically closed field $k$. In this paper we prove that a tower of finite torsors (i.e., under the action of finite $k$-group schemes) can be dominated by a single…

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…