Related papers: Constant term identities and Poincare polynomials

In a recent paper with Sahi and Stokman, we introduced quasi-polynomial generalizations of Macdonald polynomials for arbitrary root systems via a new class of representations of the double affine Hecke algebra. These objects depend on a…

Jeffery's 1861 computations using finite difference calculus are resurrected and extended from forward differences to general delta operators and used to neatly prove theorems in the Rota--Mullins theory of polynomials of binomial type…

Fox's conjecture (1962) states that the sequence of absolute values of the coefficients of the Alexander polynomial of alternating links is trapezoidal. While the conjecture remains open in general, a number of special cases have been…

We prove that supports of non-symmetric Macdonald polynomials are $M$-convex. As a consequence, we resolve a 2019 conjecture of Monical, Tokcan, and Yong that they have the saturated Newton polytope property. As a corollary we show that…

Let $x_1,x_2,...,x_n$ be the zeroes of a polynomial P(x) of degree n and $y_1,y_2,...,y_m$ be the zeroes of another polynomial Q(y) of degree m. Our object of study is the permanent $\per(1/(x_i-y_j))_{1\le i\le n, 1\le j\le m}$, here named…

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and…

Let $X=\mathbb{A}^{n}$ be complex affine space, and let $T^{*}X$ be its cotangent bundle. For any exact Lagrangian $L\subset T^{*}X$, we define a new invariant, A, living in $ \text{Div}_{\mathbb{Q}/\mathbb{Z}}(L)$. We call this invariant…

We prove that for almost square tensor product grids and certain sets of bivariate polynomials the Vandermonde determinant can be factored into a product of univariate Vandermonde determinants. This result generalizes the conjecture [Lemma…

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

The q-binomial coefficients were assumed to be unimodal as early as the 1850's, but it remained unproven until Sylvester's 1878 proof using invariant theory. In 1982, Proctor gave an "elementary" proof using linear algebra. Finally, in…

In this paper we prove four cases of the vanishing conjecture of differential operators with constant coefficients and also a conjecture on the Laurent polynomials with no holomorphic parts, which were proposed in [Zh3] by the third named…

We motivate and prove a series of identities which form a generalization of the Euler's pentagonal number theorem, and are closely related to specialized Macdonald's identities for powers of the Dedekind $\eta$--function. More precisely, we…

Let $\mathbf{P}^{m}_{b}(x)$ be a $2m+1$-degree polynomial in $x$ and $b \in \mathbb{R}$ \[ \mathbf{P}^{m}_{b}(x) = \sum_{k=0}^{b-1} \sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r \] where $\mathbf{A}_{m,r}$ are real coefficients. In this…

Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…

Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan-Hochster in their proof of Stillman's conjecture and generalised here to other tensors, is…

We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial…

We introduce Macdonald characters and use algebraic properties of Macdonald polynomials to study them. As a result, we produce several formulas for Macdonald characters, which are generalizations of those obtained by Gorin and Panova in…

We prove a strong factorization property of interpolation Macdonald polynomials when $q$ tends to $1$. As a consequence, we show that Macdonald polynomials have a strong factorization property when $q$ tends to $1$, which was posed as an…

We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our…