Related papers: On Loewner's characterization of polynomials

This paper is devoted to characterizations classical orthogonal polynomials on quadratic lattices by using a matrix approach. In this form we recover the Hahn, Geronimus, Tricomi and Bochner type characterizations of classical orthogonal…

Ballantine--Beck--Feigon--Maurischat introduced the subsum polynomial \[ \operatorname{sp}(\lambda,x):=\prod_i (1+x^{\lambda_i}) \] attached to an integer partition $\lambda$, and studied rational functions obtained by summing reciprocals…

In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…

We characterize all the strongly monotypic polytopes. Hadwiger's conjecture for this class of polytopes is deduced from the characterization.

Recently, the functional equation \[ \sum_{i=0}^mf_i(b_ix+c_iy)= \sum_{i=1}^na_i(y)v_i(x) \] with $x,y\in\mathbb{R}^d$ and $b_i,c_i\in\mathbf{GL}_d(\mathbb{C})$, was studied by Almira and Shulman, both in the classical context of continuous…

In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with…

We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.

We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…

In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…

We present a short new proof of the canonical polynomial van der Waerden theorem, recently established by Girao [arXiv:2004.07766].

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…

We generalize the theory of ordering character triples, developed by Navarro and Sp\"ath, by taking into account the action of Galois automorphisms on characters. This new technique, together with previous results of Ladisch and Turull,…

We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum…

Let $f$ be a monic univariate polynomial. We say that $f$ is positive if $f(x)$ is positive over all $x > 0$. If all the coefficients of $f$ are non-negative, then $f$ is trivially positive. In 1883, Poincar\'e proved that $f$ is positive…

In 1980, Balasubramanian and Parthasarathy introduced the bivariate permanent polynomials of graphs and conjectured that this graph polynomial is a graph characterising polynomial, that is, any two graphs with the same bivariate permanent…

In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson's conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson's conjecture to the higher order integral polynomial case. However, they did not…

In 1952, Littlewood stated a conjecture about the average growth of spherical derivatives of polynomials, and showed that it would imply that for entire function of finite order, "most" preimages of almost all points are concentrated in a…

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.