The SU(3) tensor multiplicities are piecewise polynomial of degree 1 in their labels. The pieces are the chambers of a ...

A famous formula of Graham and Pollak (1971) describes the determinant of the distance matrix of a tree T of order n: detM(T) ...

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The ...

We give necessary conditions for the positivity of Littlewood–Richardson coefficients and SXP coefficients. We deduce ...

In this senior thesis we present the first combinatorial proof for the renowned Graham and Pollak’s formula for the determinant of the distance matrix of a tree, based on the Lindström-Gessel-Viennot method.

The main objective of this work is to study the relation between representations of the symmetric group and those of the ...

In this work we aim to study and better understand the coefficients of the plethystic operation on the symmetric functions. ...

The Kronecker coefficients are the structure constants for the restriction of irreducible representations of the general ...

We investigate the combinatorics of the general formulas for the powers of the operator h∂k, where h is a central element ...

We compute with SageMath the group of all linear symmetries for the Littlewood-Richardson associated to the representations of ...

The Jacobi--Trudi identity associates a symmetric function to any integer sequence. Let Γ(t|X) be the vertex operator ...

We study the commutation relations and normal ordering between families of operators on symmetric functions. These operators ...

We study the rate of growth experienced by the Kronecker coefficients as we add cells to the rows and columns indexing partitions. We do this by moving to the setting of the reduced Kronecker coefficients.

Esta tesis presenta el estudio de dos familias de coeficientes: los coeficientes del pletismo y los coeficientes de Kronecker. ...

This text is an appendix to our work ”On the growth of Kronecker coefficients” [1]. Here, we provide some complementary ...

We show that several of the main structural constants for symmetric functions (Littlewood-Richardson coefficients, Kronecker ...

The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to ...

The reduced Kronecker coefficients are particular instances of Kronecker coefficients, that nevertheless contain enough ...

We show that some of the main structural constants for symmetric functions (Littlewood-Richardson coe cients, Kronecker ...

We show that some of the main structural constants for symmetric functions (Littlewood-Richardson coefficients, Kronecker ...

In the late 1930’s Murnaghan discovered the existence of a stabilization phenomenon for the Kronecker product of Schur ...

We provide counter–examples to Mulmuley’s strong saturation conjecture (strong SH) for the Kronecker coefficients. This ...

The number of real roots of a system of polynomial equations fitting inside a given box can be counted using a vector ...

Using the a noncommutative version of Chevalley’s theorem due to Bergeron, Reutenauer, Rosas, and Zabrocki we compute the ...

Tanisaki introduced generating sets for the defining ideals of the schematic intersections of the closure of conjugacy ...

We introduce a natural Hopf algebra structure on the space of noncommutative symmetric functions. The bases for this algebra ...

We show that the Kronecker coefficients indexed by two two–row shapes are given by quadratic quasipolynomial formulas whose ...

We find a minimal generating set for the defining ideal of the schematic intersection of the set of diagonal matrices with ...

We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many ...

We show that the Grothendieck bialgebra of the semi-tower of partition lattice algebras is isomorphic to the graded dual ...

Consider the algebra Qhhx1, x2, . . .ii of formal power series in countably many noncommuting variables over the rationals. ...

A MacMahon symmetric function is a formal power series in a finite number of alphabets that is invariant under the diagonal ...

A MacMahon symmetric function is a formal power series in a finite number of alphabets that is invariant under the diagonal ...

A MacMahon symmetric function is a formal power series in a finite number of alphabets that is invariant under the diagonal ...

The Kronecker product of two Schur functions sµ and sν, denoted by sµ ∗ sν, is the Frobenius characteristic of the tensor ...