Related papers: Macdonald Identities: revisited

It is shown that the deformed Macdonald-Ruijsenaars operators can be described as the restrictions on certain affine subvarieties of the usual Macdonald-Ruijsenaars operator in infinite number of variables. The ideals of these varieties are…

We prove a binomial formula for Macdonald polynomials and consider applications of it.

Recently, there has been a growing interest in the relationships between unrooted and rooted phylogenetic networks. In this context, a natural question to ask is if an unrooted phylogenetic network U can be oriented as a rooted phylogenetic…

In this note we give a short proof of Cherednik's generalization of Macdonald-Mehta identities for the root system $A_{n-1}$ using the representation theory of quantum groups. These identities, suggested and proved by Cherednik, give an…

We study mixed identities for oligomorphic automorphism groups of countable relational structures. Our main result gives sufficient conditions for such a group to not admit a mixed identity without particular constants. We study numerous…

We consider a natural generalization of both locally finite irreducible root systems and extended affine root systems defined by Saito. We classify the systems.

We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.

We find new universal factorization identities for generalized Macdonald polynomials on the topological locus. We prove the identities (which include all previously known forumlas of this kind) using factorization identities for matrix…

We give a new improvement over Newton's method for root-finding, when the function in question is doubly differentiable. It generally exhibits faster and more reliable convergence. It can be also be thought of as a correction to Halley's…

Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of…

I demonstrate how certain identities for Macdonald's polynomials established by Garsia, Haiman and Tesler, together with the conjecture of Hausel, Letellier and Villegas imply explicit relations between mixed Hodge polynomials of different…

We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…

We study matrix identities involving multiplication and unary operations such as transposition or Moore-Penrose inversion. We prove that in many cases such identities admit no finite basis.

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…

Motivated by some binomial coefficients identities encountered in our approach to the enumeration of convex polyominoes, we prove some more general identities of the same type, one of which turns out to be related to a strange evaluation of…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

We present a new twist on an old identity.

In this article, we prove a new general identity involving the Theta operators introduced by the first author and his collaborators in [D'Adderio, Iraci, Vanden Wyngaerd 2020]. From this result, we can easily deduce several new identities…

We prove a q-series identity that generalises Macdonald's A_{2n}^{(2)} eta-function identity and the Rogers-Ramanujan identities. We conjecture our result to generalise even further to also include the Andrews-Gordon identities.

This paper develops the theory of Macdonald-Koornwinder polynomials in parallel analogy with the work done for the $GL_n$ case in [CR22]. In the context of the type $CC_n$ affine root system the Macdonald polynomials of other root systems…