Related papers: On Loewner's characterization of polynomials

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

In 1975, Koornwinder gave a method to construct orthogonal polynomials in two variables using the classical Jacobi polynomials. In [5], the authors introduced some new examples of Koornwinder polynomials obtained from the Koornwinder…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are…

In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…

In 1954 it was proved if f is infinitely differentiable in the interval I and some derivative (of order depending on x) vanishes at each x, then f is a polynomial. Later it was generalized for multi-variable case. In this paper we give an…

Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…

In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…

The Poupard polynomials are polynomials in one variable with integer coefficients, with some close relationship to Bernoulli and tangent numbers. They also have a combinatorial interpretation. We prove that every Poupard polynomial has all…

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

Kerov polynomials express the normalized characters of irreducible representations of the symmetric group, evaluated on a cycle, as polynomials in the free cumulants of the associated Young diagram. We present two positivity conjectures for…

With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of…

We introduce a new operator $\Gamma$ on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron,…

Binomial Eulerian polynomials first appeared in work of Postnikov, Reiner and Williams on the face enumeration of generalized permutohedra. They are $\gamma$-positive (in particular, palindromic and unimodal) polynomials which can be…

We give an explicit formula for the power-sum expansion of Jack polynomials. We deduce it from a more general formula, which we provide here, that interprets Jack characters in terms of bipartite maps. We prove Lassalle's conjecture from…

Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.

In this paper we introduce a version of irreducible Laguerre polynomials in two variables and prove for it a congruence property, which is similar to the one obtained by Carlitz for the classical Laguerre polynomials in one variable.

A sequence of coefficients appearing in a recurrence for the Narayana polynomials is generalized. The coefficients are given a probabilistic interpretation in terms of beta distributed random variables. The recurrence established by M.…

Kerov considered the normalized characters of irreducible representations of the symmetric group, evaluated on a cycle, as a polynomial in free cumulants. Biane has proved that this polynomial has integer coefficients, and made various…

This note defines a family of Laurent polynomials (indexed in the rational projective line) which generalize the Markoff numbers and relate to the character variety of the one-cusped torus. We describe which monomials appear in each…