相关论文: The Strong Macdonald Conjecture

We give a short proof of the inner product conjecture for the symmetric Macdonald polynomials of type $A_{n-1}$. As a special case, the corresponding constant term conjecture is also proved.

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…

The paper contains a proof of the Fontaine-Jannsen conjecture based on a crystalline version of the p-adic Poincar'e lemma (different proofs were found earlier by Faltings, Niziol and Tsuji).

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.

We prove a conjecture of Johann Cigler on shifted Hankel determinants.

We prove the strong Macdonald conjecture of Hanlon and Feigin for reductive groups G. In a geometric reformulation, we show that the Dolbeault cohomology $H^q(X;\Omega^p)$ of the loop Grassmannian X is freely generated by de Rham's forms on…

In this article, we establish a sharp effectiveness result of Demailly's strong openness conjecture. We also establish a sharp effectiveness result related to a conjecture posed by Demailly and Koll\'ar.

We prove the "strong conjecture" expressed by Gazeau et al. in arXiv:1203.3936v1 [math-ph] about the coefficients of the Taylor expansion of the exponential of a polynomial. This implies the "weak conjecture" as a special case. The proof…

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

This paper contains the proof of Macdonald's duality and evaluation conjectures, the definition of the difference Fourier transform, the recurrence theorem generalizing Pieri rules, and the action of GL(2,Z) on the Macdonald polynomials at…

We discuss the validity of the proof of the fixed numerator conjecture on Markov numbers, which is the main result of the paper mentioned in the title.

We settle in the affirmative the Graham-Sloane conjecture.

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…

In this paper the circulant Hadamard conjecture is proved.

In this note, while giving an overview of the state of art of the well known Hadamard conjecture, which is more than a century old and now it has been established by using the methods given in the two papers by Mohan et al [6,7].

Macdonald superpolynomials provide a remarkably rich generalization of the usual Macdonald polynomials. The starting point of this work is the observation of a previously unnoticed stability property of the Macdonald superpolynomials when…

In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…

This paper contains the proof of difference counterparts of the conjectures due to Keven Kadell on symmetric and anti-symmetric Macdonald polynomials.

We prove the Aharoni Berger Conjecture

In the previous author's paper the Macdonald norm conjecture (including the famous constant term conjecture) was proved. This paper contains the proof of the remaining two (the duality and evaluation conjectures). The evaluation theorem is…