Related papers: A positive formula for the Ehrhart-like polynomial…

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

We give a $K$-theoretic and geometric interpretation for a generalized weighted Ehrhart theory of a full-dimensional lattice polytope $P$, depending on a given homogeneous polynomial function $\varphi$ on $P$, and with Laurent polynomial…

We study a class of bivariate deformed Hermite polynomials and some of their properties using classical analytic techniques and the Wigner map. We also prove the positivity of certain determinants formed by the deformed polynomials. Along…

Let M be a rational homology sphere plumbed 3-manifold associated with a connected negative definite plumbing graph. We show that its Seiberg-Witten invariants equal certain coefficients of an equivariant multivariable Ehrhart polynomial.…

We prove several formulas for the distribution of positive roots.

This work records the details of the Ram-Yip formula for nonsymmetric Macdonald-Koornwinder polynomials for the double affine Hecke algebras of not-necessarily-reduced affine root systems. It is shown that the t=0 equal-parameter…

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

We consider the problem of embedding the semi-ring of Schur-positive symmetric polynomials into its analogue for the classical types $B/C/D$. If we preserve highest weights and add the additional Lie-theoretic parity assumption that the…

Inspired by the theory of hyperbolic polynomials and Hodge theory, we develop the theory of Lorentzian polynomials on cones. This notion captures the Hodge-Riemann relations of degree zero and one. Motivated by fundamental properties of…

We study central hyperplane arrangements with integral coefficients modulo positive integers $q$. We prove that the cardinality of the complement of the hyperplanes is a quasi-polynomial in two ways, first via the theory of elementary…

We consider the family of polynomials $p_{n}\left( x;z\right) ,$ orthogonal with respect to the inner product \[ \left\langle f,g\right\rangle = \int_{-z}^{z} f\left( x\right) g\left( x\right) e^{-x^{2}} \,dx. \] We show some properties…

We prove that the enumerative polynomials of quasi-Stirling permutations of multisets with respect to the statistics of plateaux, descents and ascents are partial $\gamma$-positive, thereby confirming a recent conjecture posed by Lin, Ma…

We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in a skew-polynomial ring and decomposing $p^s$-polynomials…

We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials of the subdivision and "local contributions" of the links of its…

Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…