English
Related papers

Related papers: Matrix pairs over discrete valuation rings determi…

200 papers

We extend the theory of Littlewood-Richardson fillings (defined over the non-negative integers) to include diagrams with rows and boxes of real-valued length. We realize such fillings as invariants of matrix pairs over rings with a…

Combinatorics · Mathematics 2009-10-26 Glenn D. Appleby , Tamsen Whitehead

Littlewood-Richardson (LR) coefficients $c_{\mu\nu}^\lambda$ may be evaluated by means of several combinatorial models, including the original LR tableaux of skew shape $\lambda/\mu$ and weight $\nu$ and the LR hives with boundary edge…

Combinatorics · Mathematics 2016-03-17 O. Azenhas , R. C. King , I. Terada

We prove a Littlewood-Richardson type formula for $(s_{\lambda/\mu},s_{\nu/\kappa})_{t^k,t}$, the pairing of two skew Schur functions in the MacDonald inner product at $q = t^k$ for positive integers $k$. This pairing counts graded…

Representation Theory · Mathematics 2013-09-19 Erik Carlsson , Anthony M. Licata

We present a polynomiality property of the Littlewood-Richardson coefficients c_{\lambda\mu}^{\nu}. The coefficients are shown to be given by polynomials in \lambda, \mu and \nu on the cones of the chamber complex of a vector partition…

Combinatorics · Mathematics 2007-05-23 Etienne Rassart

Let ${\mathcal O}$ be a discrete valuation ring with quotient field ${\cal K}$. The affine Grassmannian ${\cal G}r$ is the set of full-rank ${\mathcal O}$-modules contained in ${\cal K}^n$. Given $\Lambda \in {\cal G}r$, invariant factors…

Representation Theory · Mathematics 2018-10-04 Glenn D. Appleby , Tamsen Whitehead

The Newell-Littlewood numbers $N_{\mu,\nu,\lambda}$ are tensor product multiplicities of Weyl modules for classical Lie groups, in the stable limit. For which triples of partitions $(\mu,\nu,\lambda)$ does $N_{\mu,\nu,\lambda}>0$ hold? The…

Combinatorics · Mathematics 2023-02-07 Shiliang Gao , Gidon Orelowitz , Alexander Yong

Given a skew diagram $\gamma/\lambda$, we determine a set of lower and upper bounds that a partition $\mu$ must satisfy for Littlewood-Richards coefficients $c^{\gamma}_{\lambda,\mu}>0$. Our algorithm depends on the characterization of…

Combinatorics · Mathematics 2023-04-07 Müge Taşkın , R. Bedii Gümüş , Sinan Işık , M. ikbal Ulvi

We are interested in identities between Littlewood-Richardson coefficients, and hence in comparing different tensor product decompositions of the irreducible modules of the linear group GL n (C). A family of partitions-called…

Combinatorics · Mathematics 2021-07-09 Maxime Pelletier , Ressayre Nicolas

We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…

Combinatorics · Mathematics 2021-05-19 Eric M. Rains , S. Ole Warnaar

This note is an extended abstract of my talk at the workshop on Representation Theory and Symmetric Functions, MSRI, April 14, 1997. We discuss the problem of finding an explicit description of the semigroup $LR_r$ of triples of partitions…

Combinatorics · Mathematics 2016-09-07 Andrei Zelevinsky

Let R be a commutative ring, q a unit of R and P a multiplicatively antisymmetric matrix with coefficients which are integers powers of q. Denote by SE(q,P) the multiparameter quantum matrix bialgebra associated to q and P.Slightly…

q-alg · Mathematics 2016-09-08 G. Boffi , M. Varagnolo

We determine when a permutation with cycle type $\mu$ admits a non-zero invariant vector in the irreducible representation $V_\lambda$ of the symmetric group. We find that a majority of pairs $(\lambda,\mu)$ have this property, with only a…

Representation Theory · Mathematics 2023-10-31 Amrutha P , Amritanshu Prasad , Velmurugan S

We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient c({\lambda},{\mu},{\nu}) for given partitions {\lambda}, {\mu}, and {\nu}. This graph was first…

Representation Theory · Mathematics 2012-09-10 Christian Ikenmeyer

The main aim of the paper is to present a~combinatorial algorithm that, applying Littlewood-Richardson tableaux with entries equal to $1$, computes generic extensions of semisimple invariant subspaces of nilpotent linear operators.…

Representation Theory · Mathematics 2020-04-23 Mariusz Kaniecki , Justyna Kosakowska

Given two Schubert classes $\sigma_{\lambda}$ and $\sigma_{\mu}$ in the quantum cohomology of a Grassmannian, we construct a partition $\nu$, depending on $\lambda$ and $\mu$, such that $\sigma_{\nu}$ appears with coefficient 1 in the…

Combinatorics · Mathematics 2007-05-23 Dave Anderson

We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…

Algebraic Geometry · Mathematics 2007-05-23 Sergey Fomin , William Fulton , Chi-Kwong Li , Yiu-Tung Poon

The Littlewood-Richardson coefficients $c^\nu_{\lambda,\mu}$ are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL$(n, {\mathbb C})$. They are parametrized by the…

Algebraic Geometry · Mathematics 2022-06-08 Pierre-Emmanuel Chaput , Nicolas Ressayre

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

Algebraic Geometry · Mathematics 2009-06-03 A. I. Molev

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

Representation Theory · Mathematics 2024-02-22 Valdemar V. Tsanov

The classical Littlewood-Richardson coefficients C(lambda,mu,nu) carry a natural $S_3$ symmetry via permutation of the indices. Our "carton rule" for computing these numbers transparently and uniformly explains these six symmetries;…

Combinatorics · Mathematics 2010-02-18 Hugh Thomas , Alexander Yong
‹ Prev 1 2 3 10 Next ›