Related papers: Exactly solved models of polyominoes and polygons
We present three classes of exactly solvable models for fermion and boson systems, based on the pairing interaction. These models are solvable in any dimension. As an example we show the first results for fermion interacting with repulsive…
We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations…
The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of…
The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…
In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…
We find solutions for a linear deformation of the symmetric three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is…
We consider the isotropic perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons, whose 8th order linear Fuchsian ODEs are previously known. We derive simple relationships between the three generating…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
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…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
We classify all convex polyomino ideals which are linearly related or have a linear resolution. Convex stack polyominoes whose ideals are extremal Gorenstein are also classified. In addition, we characterize, in combinatorial terms, the…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
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…
The idea of this review article is to discuss in a unified way the orthogonality of all positive definite polynomial solutions of the $q$-hypergeometric difference equation on the $q$-linear lattice by means of a qualitative analysis of the…
Dealing with multi-objective problems by using generation methods has some interesting advantages since it provides the decision-maker with the complete information about the set of non-dominated points (Pareto front) and a clear overview…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…