Searcharxiv⌕ Search

arXiv subjects

Laura Colmenarejo

Publications and source records attributed to Laura Colmenarejo.

24 records · Page 2Linked to original sources

Connections between vector-valued and highest weight Jack and Macdonald polynomials

We analyze conditions under which a projection from the vector-valued Jack or Macdonald polynomials to scalar polynomials has useful properties, especially commuting with the actions of the symmetric group or Hecke algebra, respectively, and with the Cherednik operators for which these polynomials are eigenfunctions. In the framework of the representation theory of the symmetric group and the Hecke algebra, we study the relation between singular nonsymmetric Jack and Macdonald polynomials and highest weight symmetric Jack and Macdonald polynomials. Moreover, we study the quasistaircase partition as a continuation of our study on the conjectures of Bernevig and Haldane on clustering properties of symmetric Jack polynomials.

math-ph↗

A minimaj-preserving crystal on ordered multiset partitions

We provide a crystal structure on the set of ordered multiset partitions, which recently arose in the pursuit of the Delta Conjecture. This conjecture was stated by Haglund, Remmel and Wilson as a generalization of the Shuffle Conjecture. Various statistics on ordered multiset partitions arise in the combinatorial analysis of the Delta Conjecture, one of them being the minimaj statistic, which is a variant of the major index statistic on words. Our crystal has the property that the minimaj statistic is constant on connected components of the crystal. In particular, this yields another proof of the Schur positivity of the graded Frobenius series of the generalization $R_{n,k}$ due to Haglund, Rhoades and Shimozono of the coinvariant algebra $R_n$. The crystal structure also enables us to demonstrate the equidistributivity of the minimaj statistic with the major index statistic on ordered multiset partitions.

math.CO↗

Factorizations of symmetric Macdonald polynomials

We prove many factorization formulas for highest weight Macdonald polynomials indexed by particular partitions called quasistaircases. As a consequence we prove a conjecture of Bernevig and Haldane stated in the context of the fractional quantum Hall theory.

math-ph↗

Combinatorics on a family of reduced Kronecker coefficients

The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also gives its connection to the plane partitions, which allows us to check that this family satisfies the saturation conjecture for reduced Kronecker coefficients, and that they are weakly increasing. Thanks to its generating function we can describe our family by a quasipolynomial, specifying its degree and period.

math.CO↗

Stability Properties Of The Plethysm: A Combinatorial Approach

An important family of structural constants in the theory of symmetric functions and in the representation theory of symmetric groups and general linear groups are the plethysm coefficients. In 1950, Foulkes observed that they have some stability properties: certain sequences of plethysm coefficients are eventually constant. Such stability properties were proven by Brion with geometric techniques, and by Thibon and Carré by means of vertex operators. In this paper we present a new approach to prove such stability properties.Our proofs are purely combinatorial and follow the same scheme. We decompose plethysm coefficients in terms of other plethysm coefficients related to the complete homogeneous basis of symmetric functions. We show that these other plethysm coefficients count integer points in polytopes and we prove stability for them by exhibiting bijections between the corresponding sets of integer points of each polytope.

math.CO↗