Mercedes Rosas

Learn More
We show that the Grothendieck bialgebra of the semi-tower of partition lattice algebras is isomorphic to the graded dual of the bialgebra of symmetric functions in noncommutative variables. In particular this isomorphism singles out a canonical new basis of the symmetric functions in noncommutative variables which would be an analogue of the Schur function(More)
In the late 1930’s Murnaghan discovered the existence of a stabilization phenomenon for the Kronecker product of Schur functions. For n large enough, the values of the Kronecker coefficients appearing in the product of two Schur functions of degree n do not depend on the first part of the indexing partitions, but only on the values of their remaining parts.(More)
We provide counter–examples to Mulmuley’s strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P– hardness of computing the(More)
We show that the Kronecker coefficients indexed by two two–row shapes are given by quadratic quasipolynomial formulas whose domains are the maximal cells of a fan. Simple calculations provide explicitly the quasipolynomial formulas and a description of the associated fan. These new formulas are obtained from analogous formulas for the corresponding reduced(More)
We provide counter–examples to Mulmuley’s SH conjecture for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P–hardness of computing the Kronecker coefficients. Both(More)
We provide counter–examples to Mulmuley’s strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P–hardness of computing the(More)
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded height case can be reduced to checking that the conjecture holds for a finite number of pairs, for any given height. Moreover, we propose a natural generalization of the(More)
Using the a noncommutative version of Chevalley’s theorem due to Bergeron, Reutenauer, Rosas, and Zabrocki we compute the graded Frobenius series for their two sets of noncommutative harmonics with respect to the left action of the symmetric group (acting on variables). We use these results to derive the Frobenius series for the enveloping algebra of the(More)