Searcharxiv⌕ Search

arXiv · math/0107011

The honeycomb model of GL(n) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone

Abstract

The set of possible spectra (λ,μ,ν) of zero-sum triples of Hermitian matrices forms a polyhedral cone. We give a complete determination of its facets, finishing a long story with recent highlights by [Helmke-Rosenthal, Klyachko, Belkale]. We introduce_puzzles_, which are new combinatorial gadgets to compute Grassmannian Schubert calculus, and will probably be the main point of interest for many readers. As the proofs indicate, the Hermitian sum problem is very naturally studied using puzzles directly, and their connection to Schubert calculus is quite incidental to our approach. In particular, we get new, puzzle-theoretic, proofs of the results in [H,Kly,HR,Be]. Along the way we give a characterization of ``rigid'' puzzles, which we use to prove a conjecture of W. Fulton: ``if for a triple of dominant weights λ,μ,νof GL(n,C) the irreducible representation V_νappears exactly once in V_λtensor V_μ, then for all N\in \naturals, V_{Nλ} appears exactly once in V_{Nλ} tensor V_{Nμ}.''

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Allen Knutson, Terence Tao, Christopher Woodward. 2001-12-07. The honeycomb model of GL(n) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone. https://arxiv.org/abs/math/0107011

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The finite volume method on Sierpiński simplices

In the sequel, we extend the Strichartz average approach for the Laplacian, which uses average values of a function over basic sets, rather than pointwise ones as classically done in the literature, and goes back to the seminal work of~S.~Kusuoka and~X.~Y.~Zhou, to Sierpiński Simplices. To our knowledge, the finite volume method had not been applied before to fractals themselves, with their intrinsic Laplacian. We build the finite volume scheme for the heat equation with Dirichlet boundary conditions, give its consistency error, a stability condition of Courant-Friedrichs-Lewy type, obtained by means of an inclusion between the spectrum of the finite volume matrix and the one of the graph Laplacian, and prove the convergence of the scheme. Numerical results are given in the case of the Sierpiński Gasket and Tetrahedron, and compared with the finite difference method.

math.CO↗

Absolute incidence theorems and tilings

We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of absolute incidence theorems, which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from tilings of an orientable surface; they call this result the master theorem. Instances of the master theorem are always absolute incidence theorems. As most classically known incidence theorems are instances of the master theorem, they are absolute incidence theorems. We give an explicit example of an incidence theorem involving 13 points that is not an absolute incidence theorem, and therefore is not an instance of the master theorem.

math.CO↗

Cyclic sieving phenomena for trees and tree-rooted maps

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $δ$ are considered, for a fixed $δ$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

math.CO↗