Related papers: Exactly solved models of polyominoes and polygons

This article addresses the problem of enumerating the tilings of a plane by lozenges, under the restriction that these tilings be doubly periodic. Kasteleyn's Pfaffian method is applied to compute the generating function of those…

Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

An adaptive procedure for constructing polynomials which are biorthogonal to the basis of monomials in the same finite-dimensional inner product space is proposed. By taking advantage of available orthogonal polynomials, the proposed…

Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some…

The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…

We use the cluster method to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite…

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…

Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…

A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

We present a complete solution to the so-called tennis ball problem, which is equivalent to counting lattice paths in the plane that use North and East steps and lie between certain boundaries. The solution takes the form of explicit…

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

In computer vision applications, the following problem often arises: Given a family of (Laurent) polynomial systems with the same monomial structure but varying coefficients, find a solver that computes solutions for any family member as…

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding…

Matrices can be augmented by adding additional columns such that a partitioning of the matrix in blocks of rows defines mutually orthogonal subspaces. This augmented system can then be solved efficiently by a sum of projections onto these…

Given the importance of floating-point~(FP) performance in numerous domains, several new variants of FP and its alternatives have been proposed (e.g., Bfloat16, TensorFloat32, and Posits). These representations do not have correctly rounded…

Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…