相关论文: Counting polyominoes with minimum perimeter

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

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…

We consider polyhedral cones, associated with quasi-semi-metrics (oriented distances), in particular, with oriented multi-cuts, on n points. We computed the number of facets and of extreme rays, their adjacencies, and incidences of the…

We prove that for any even algebraic polynomial $p$ one can find a cosine polynomial with an arbitrary small $l_1$-norm of coefficients such that the first coefficients of its representation as an algebraic polynomial in $\cos x$ coincide…

We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

We are interested in matrices of minors of order p of a invertible matrix. Special cases are studied when this matrix is in SL(n) or SO(n)

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…

Let $P$ be a connected bounded region in the plane formed out of $2 \times 2$ blocks joined by their sides. Peng and Rascoussier conjectured that all minimum-turn Hamiltonian cycles of $P$ exhibit a certain regular structure. We prove this…

There are 123,650 partial groups of order at most 9 and 178,937,003 partial groups of order 10. We explain a computer enumeration of these results and provide a complete list of indecomposable partial groups of order at most 5. We also…

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

In this paper, we consider higher-order Bernoulli and poly-Bernoulli mixed type polynomials and we give some interesting identities of those polynomials arising from umbral calculus.

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

We show that the nearring $(\mathbb{Z}[x],+,\circ)$ of integer polynomials, where the nearring multiplication is the composition of polynomials, has uncountably many subnearrings, and we give an explicit description of those nearrings that…

The minimal Hamming distance between distinct $p$-ary bent functions of $2n$ variables is proved to be $p^n$ for any prime $p$. It is shown that the number of $p$-ary bent functions at the distance $p^n$ from the quadratic bent function is…