Related papers: Counting Polyominoes in a Rectangle b x h

We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…

For L-convex polyominoes we give the asymptotics of the generating function coefficients, obtained by analysis of the coefficients derived from the functional equation given by Castiglione et al. \cite{CFMRR7}. For 201-avoiding ascent…

We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zonotope's vertices by sampling a random linear combination of…

A polyomino is a finite, edge-connected set of cells in the plane. At the present time, an enumeration of all polyominoes is nowhere in sight. On the other hand, there are several subsets of polyominoes for which generating functions are…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

This paper presents a new generating function for Hermite polynomials of one variable in the form of $g(x,t)=\sum_{n=0}^{\infty }t^{n}H^{e}_{n}(x)$ and reveals its connection with incomplete gamma function.

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it.…

We prove an asymptotic formula for the number of integral points of bounded log anticanonical height on a singular quartic del Pezzo surface over arbitrary number fields, with respect to the largest admissible boundary divisor. The…

We present a multiplication algorithm to recursively construct vertices for the Schroedinger functional in the abelian background field case. The algorithm is suited for automatic perturbative calculations with a variety of actions. As…

We introduce a three-dimensional random point field using the concept of the quaternion determinant. Orthogonal polynomials on the space of pure quaternions are defined, and used to construct a kernel function similar to the Ginibre kernel.…

In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In…

The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.

We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or simple polygons as the container; we require the triangles…

In this paper, we consider linear differential equations satisfied by the generating function for Hermite polynomials and derive some new identities involving those polynomials.

We propose a method for computing upper bounds for the Heilbronn problem for triangles.

Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…

This paper proposes a set of techniques to develop correctly rounded math libraries for 32-bit float and posit types. It enhances our RLibm approach that frames the problem of generating correctly rounded libraries as a linear programming…

We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…