10 citations
- Laboratoire d'Informatique Gaspard-MongeFR15 papers
- Université Gustave EiffelFR5 papers
- Laboratoire d'Informatique, Signaux et Systèmes de Sophia AntipolisFR2 papers
- Institut Camille JordanFR1 paper
- Institut de Mathématiques de MarseilleFR1 paper
- International Center for Transitional JusticeUS1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
- Laboratoire de Physique ThéoriqueFR1 paper
- Laboratoire de Physique Théorique de la Matière CondenséeFR1 paper
- Laboratoire d'Informatique de Paris-NordFR1 paper
- Laboratoire d'Informatique Fondamentale et Appliquée de ToursFR1 paper
- Laboratoire Traitement et Communication de l’InformationFR1 paper
4 papers · 1 filter
Application of graph combinatorics to rational identities of type A
Adrien Boussicault, Valentin Féray
To a word , we associate the rational function . The main object, introduced by C. Greene to generalize identities linked to Murnaghan-…
Adding \pm 1 to the argument of an Hall-Littlewood polynomial
Alain Lascoux
Shifting by \pm 1 powers sums: p_i \to p_i \pm 1 induces a transformation on symmetric functions that we detail in the case of Hall-Littlewood polynomials. By iteration, this gives…
Gaudin functions, and Euler-Poincaré characteristics
Alain Lascoux
Given two positive integers n,r, we define the Gaudin function of level r to be quotient of the numerator of the determinant det(1/ ((x_i-y_j)(x_i-ty_j) ... (x_i-t^r y_j)), i,j=1..…
Ribbon tableaux, ribbon rigged configurations and Hall-Littlewood functions at roots of unity
Francois Descouens
Hall-Littlewood functions indexed by rectangular partitions, specialized at primitive roots of unity, can be expressed as plethysms. We propose a combinatorial proof of this formul…