Related papers: Limits of Jensen polynomials for partitions and ot…

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

We obtain a series transformation formula involving the classical Hermite polynomials. We then provide a number of applications using appropriate binomial transformations. Several of the new series involve Hermite polynomials and harmonic…

In this paper we prove that the gradient ideal of a Morse polynomial is radical. This gives a generic class of polynomials whose gradient ideals are radical. As a consequence we reclaim a previous result that the unconstrained polynomial…

Convex analysis is fundamental to proving inequalities that have a wide variety of applications in economics and mathematics. In this paper we provide Jensen-type inequalities for functions that are, intuitively, "very" convex. These…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

We consider a generalization of the classical Hermite polynomials by the addition of terms involving derivatives in the inner product. This type of generalization has been studied in the literature from the point of view of the algebraic…

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…

The operational calculus associated with Hermite numbers has been shown to be an effective tool for simplifying the study of special functions. Within this context, Hermite polynomials have been viewed as Newton binomials, with the…

Starting from a recently found branching formula for the six-parameter family of symmetric Macdonald-Koornwinder polynomials, we arrive by degeneration at corresponding branching rules for symmetric hypergeometric orthogonal polynomials of…

$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…

Generic Newton polygons for L-functions of exponential sums associated to Laurent polynomials in one variable are determined. The corresponding Hasse polynomials are also determined.

We study the Fourier coefficients of functions satisfying a certain version of Wright's circle method with finitely many major arcs. We show that the Jensen polynomials associated with such Fourier coefficients are asymptotically…

We introduce degenerate Hermite polynomials as a degenerate version of the ordinary Hermite polynomials. Then, among other things, by using the formula about representing one lambda-Sheffer polynomial in terms of other lambda-Sheffer…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

We obtain a family of polynomials defined by vanishing conditions and associated to tangles. We study more specifically the case where they are related to a O(n) loop model. We conjecture that their specializations at $z_i=1$ are {\it…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…