Results 41 to 50 of about 18,223 (230)
Factorization formulas for Macdonald polynomials
The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.
Descouens, Francois, Morita, H.
openaire +4 more sources
A generalization of the Kostka-Foulkes polynomials [PDF]
Combinatorial objects called rigged configurations give rise to q-analogues of certain Littlewood-Richardson coefficients. The Kostka-Foulkes polynomials and two-column Macdonald-Kostka polynomials occur as special cases.
Kirillov, Anatol N., Shimozono, Mark
core +3 more sources
On Hamiltonians for Kerov functions
Kerov Hamiltonians are defined as a set of commuting operators which have Kerov functions as common eigenfunctions. In the particular case of Macdonald polynomials, well known are the exponential Ruijsenaars Hamiltonians, but the exponential shape is not
A. Mironov, A. Morozov
doaj +1 more source
The Classification of All Singular Nonsymmetric Macdonald Polynomials
The affine Hecke algebra of type A has two parameters q,t and acts on polynomials in N variables. There are two important pairwise commuting sets of elements in the algebra: the Cherednik operators and the Jucys–Murphy elements whose simultaneous ...
Charles F. Dunkl
doaj +1 more source
Baxter operator formalism for Macdonald polynomials [PDF]
We develop basic constructions of the Baxter operator formalism for the Macdonald polynomials associated with root systems of type A. Precisely we construct a dual pair of mutually commuting Baxter operators such that the Macdonald polynomials are their ...
Anton Gerasimov +7 more
core +3 more sources
Determinantal expressions for Macdonald polynomials
We show that the action of classical operators associated to the Macdonald polynomials on the basis of Schur functions, S_ [X(t-1)/(q-1)], can be reduced to addition in -rings. This provides explicit formulas for the Macdonald polynomials expanded in this basis as well as in the ordinary Schur basis, S_ [X], and the monomial basis, m_ [X].
Lapointe, L, Lascoux, Alain, Morse, J
openaire +5 more sources
Hall-Littlewood Polynomials in terms of Yamanouchi words [PDF]
This paper uses the theory of dual equivalence graphs to give explicit Schur expansions to several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified Hall-Littlewood ...
Austin Roberts
doaj +1 more source
Macdonald polynomials in superspace: conjectural definition and positivity conjectures
We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees.
B. Feigin +19 more
core +1 more source
A combinatorial formula for Macdonald polynomials
In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GL(n).
Martha Yip, Arun Ram, Arun Ram
openaire +3 more sources
An analytic formula for Macdonald polynomials [PDF]
8 pages; research announcement submitted to Comptes Rendus Math. Acad. Sci.
Lassalle, Michel, Schlosser, M.
openaire +5 more sources

