A Short Proof for the Polynomiality
of the Stretched Littlewood-Richardson Coefficients

Warut Thawinrak Department of Mathematics, University of California Davis, wthawinrak@ucdavis.edu

Abstract

The stretched Littlewood-Richardson coefficient $c^{t\nu}_{t\lambda,t\mu}$ was conjectured by King, Tollu, and Toumazet to be a polynomial function in $t.$ It was shown to be true by Derksen and Weyman using semi-invariants of quivers. Later, Rassart used Steinberg’s formula, the hive conditions, and the Kostant partition function to show a stronger result that $c^{\nu}_{\lambda,\mu}$ is indeed a polynomial in variables $\nu,\lambda,\mu$ provided they lie in certain polyhedral cones. Motivated by Rassart’s approach, we give a short alternative proof of the polynomiality of $c^{t\nu}_{t\lambda,t\mu}$ using Steinberg’s formula and a simple argument about the chamber complex of the Kostant partition function.

Keywords— Littlewood-Richardson, polynomiality, Steinberg’s formula

1 Introduction

The Littlewood-Richardson coefficients appear in many areas of mathematics [5, 8, 9, 12, 17]. An example comes from the study of symmetric functions. The set of Schur functions $s_{\lambda}$ , indexed by partitions $\lambda$ , is a linear basis for the ring of symmetric functions. Thus, for any partitions $\lambda$ and $\mu$ , the product of Schur functions $s_{\lambda}$ and $s_{\mu}$ can be uniquely expressed as

\displaystyle s_{\lambda}\cdot s_{\mu}=\sum_{\nu:|\nu|=|\lambda|+|\mu|}c^{\nu}_{\lambda,\mu}s_{\nu}

(1)

for some real numbers $c^{\nu}_{\lambda,\mu}$ , where $|\lambda|$ denotes the sum of the parts of $\lambda$ . The coefficient $c^{\nu}_{\lambda,\mu}$ of $s_{\nu}$ in (1) is called the Littlewood-Richardson coefficient.

There are several ways to compute $c^{\nu}_{\lambda,\mu}$ such as the Littlewood-Richardson rule [14], the Littlewood-Richardson triangles [10], the Berenstein-Zelevinsky triangles [1], and the honeycombs [7]. In this paper, we employ the hive model that was first introduced by Knutson and Tao [7]. The hive model imposes certain inequalities that allow us to compute $c^{\nu}_{\lambda,\mu}$ as the number of integer points in a rational polytope, which we call a hive polytope.

For fixed partitions $\lambda,\mu,\nu$ such that $|\nu|=|\lambda|+|\mu|$ , we define the stretched Littlewood-Richardson coefficients to be the function $c^{t\nu}_{t\lambda,t\mu}$ for non-negative integers $t.$ The hive model implies that

c^{t\nu}_{t\lambda,t\mu}=\text{ the number of integer points in the }t^{\mathrm{th}}\text{-dilation of the hive polytope}.

By Ehrhart theory (see Thoerem 2.1), $c^{t\nu}_{t\lambda,t\mu}$ is a quasi-polynolmial in $t\in\mathbb{Z}$ , which means $c^{t\nu}_{t\lambda,t\mu}$ is a function of the form $a_{d}(t)t^{d}+\cdots+a_{1}(t)t+a_{0}(t)$ where each of $a_{d}(t),\dots,a_{0}(t)$ is a periodic function in $t$ with an integral period. The function $c^{t\nu}_{t\lambda,t\mu}$ was, however, observed and conjectured by King, Tollu, and Toumazet [6] to be a polynomial function in $t$ (as opposed to a quasi-polynomial). The conjecture was then shown to be true by Derksen-Weyman [3], and Rassart [11]. More precisely, they proved the following theorem.

Theorem 1.1.

Let $\mu,\lambda,\nu$ be partitions with at most $k$ part such that $|\nu|=|\lambda|+|\mu|.$ Then $c^{t\nu}_{t\lambda,t\mu}$ is a polynomial in $t$ of degree at most $\binom{k-1}{2}.$

The proof by Derksen and Weyman [3] makes use of semi-invariants of quivers. They proved a result on the structure of a ring of quivers and then derived the polynomiality of $c^{t\nu}_{t\lambda,t\mu}$ as a special case. Later, Rassart [11] proved a stronger result, which gives Theorem 1.1 as an easy consequence, by showing that $c^{\nu}_{\lambda,\mu}$ is a polynomial in variables $\lambda,\mu,\nu$ provided that they lie in certain polyhedral cones of a chamber complex. The proof by Rassart employs Steinberg’s formula, the hive conditions, and the Kostant partition function to give the chamber complex of cones in which $c^{\nu}_{\lambda,\mu}$ is a polynomial in variables $\lambda,\mu,\nu$ . A considerably large portion of Rassart’s paper was devoted to describing this chamber complex and showing its desired property, resulting in a fairly long justification. We note that although this chamber complex of cones was provided, it is in practice computationally hard to work out the cones.

Inspired by Rassart’s approach, we ask if similar tools can be utilized to give a simple proof of Theorem 1.1 directly. We found that Steinberg’s formula and a simple argument about the chamber complex of the Kostant partition function are indeed sufficient. The main objective of this paper is to give a short alternative proof of Theorem 1.1 using this idea.

2 Preliminaries

We begin this section by presenting necessary notations and theories related to polytopes and then describe the hive model for computing $c^{\nu}_{\lambda,\mu}$ . The hive model will help us understand the behavior of the stretched Littlewood-Richardson coefficients through a property of polytopes. We then introduce the Kostant partition functions and state Steinberg’s formula and related results that will later be used for proving Theorem 1.1.

2.1 Ehrhart Theory

A polyhedron $P$ in $\mathbb{R}^{d}$ is the solution to a finite set of linear inequalities, that is,

P=\left\{(x_{1},\dots,x_{d})\in\mathbb{R}^{d}\,\Big{|}\,\sum^{d}_{j=1}a_{ij}x_{j}\leq b_{i}\text{ for }i\in I\right\}

where $a_{ij}\in\mathbb{R}$ , $b_{i}\in\mathbb{R},$ and $I$ is a finite set of indices. A polytope is a bounded polyhedron. We can also equivalently define a polytope in $\mathbb{R}^{d}$ as the convex hull of finitely many points in $\mathbb{R}^{d}.$ A polytope is said to be rational if all of its vertices have rational coordinates, and is said to be integral if all of its vertices have integral coordinates. We refer readers to [18] for basic definitions regarding polyhedra.

For a polytope $P$ in $\mathbb{R}^{d}$ and a non-negative integer $t,$ the $t^{\mathrm{th}}$ -dilation $tP$ is the set $\{tx\,|\,x\in P\}.$ We define

i(P,t):=|\mathbb{Z}^{d}\cap tP|

to be the number of integer points in the $t^{\mathrm{th}}$ -dilation $tP.$

Recall that a quasi-polynomial is a function of the form $f(t)=a_{d}(t)t^{d}+\cdots a_{1}(t)t+a_{0}(t)$ where each of $a_{d}(t),\dots,a_{0}(t)$ is a periodic function in $t$ with an integral period. The period of $f(t)$ is the least common period of $a_{d}(t),\dots,a_{0}(t)$ . Clearly, a quasi-polynomial of period one is a polynomial.

For a rational polytope $P$ , the least common multiple of the denominators of the coordinates of its vertices is called the denominator of $P$ . The behavior of the function $i(P,t)$ is described by the following theorem due to Ehrhart [4].

Theorem 2.1 (Ehrhart Theory).

If $P$ is a rational polytope, then $i(P,t)$ is a quasi-polynomial in $t.$ Moreover, the period of $i(P,t)$ is a divisor of the denominator of $P.$ In particular, if $P$ is an integral polytope, then $i(P,t)$ is a polynomial in $t.$

The polynomial (resp. quasi-polynomial) $i(P,t)$ is called the Ehrhart polynomial of $P$ (resp. Ehrhart quasi-polynomial of $P$ ).

2.2 The Littlewood-Richardson Coefficients

We say that $\lambda=(\lambda_{1},\dots,\lambda_{k})$ is a partition of a non-negative integer $m$ if $\lambda_{1}\geq\cdots\geq\lambda_{k}$ are positive integers such that $\lambda_{1}+\cdots+\lambda_{k}=m.$ For convenience, we will abuse the notation by allowing $\lambda_{i}$ to be zero. The positive numbers among $\lambda_{1},\dots,\lambda_{k}$ are called parts of $\lambda$ . For example, $\lambda=(2,2,1,0)$ is a partition of $5$ with $3$ parts. We write $|\lambda|$ to denote $\lambda_{1}+\cdots+\lambda_{k}.$

A hive $\Delta_{k}$ of size $k$ is an array of vertices $h_{ij}$ arranged in a triangular grid consisting of $k^{2}$ small equilateral triangles as shown in Figure 1. Two adjacent equilateral triangles form a rhombus with two equal obtuse angles and two equal acute angles. There are three types of these rhombi: tilted to the right, left, and vertical as shown in Figure 1.

Figure 1: Hive of size 4 (left), and the three types of rhombi in a hive (right)

Let $\lambda=(\lambda_{1},\dots,\lambda_{k}),\mu=(\mu_{1},\dots,\mu_{k}),\nu=(\nu_{1},\dots,\nu_{k})$ be partitions with at most $k$ parts such that $|\nu|=|\lambda|+|\mu|.$ A hive of type $(\nu,\lambda,\mu)$ is a labelling $(h_{ij})$ of $\Delta_{k}$ that satisfies the following hive conditions.

(HC1)

[Boundary condition] The labelings on the boundary are determined by $\lambda,\mu,\nu$ in the following ways.

	$\displaystyle h_{00}=0,\ h_{jj}-h_{j-1j-1}$	$\displaystyle=\nu_{j},\ h_{0j}-h_{0j-1}=\lambda_{j},$	$\displaystyle\text{ for }1\leq j\leq k.$
	$\displaystyle h_{ik}-h_{i-1k}$	$\displaystyle=\mu_{i},$	$\displaystyle\text{ for }1\leq i\leq k.$

(HC2)

[Rhombi condition] For every rhombus, the sum of the labels at obtuse vertices is greater than or equal to the sum of the labels at acute vertices. That is, for $1\leq i<j\leq k,$

	$\displaystyle h_{ij}-h_{ij-1}$	$\displaystyle\geq h_{i-1j}-h_{i-1j-1},$
	$\displaystyle h_{ij}-h_{i-1j}$	$\displaystyle\geq h_{i+1j+1}-h_{ij+1},\text{ and }$
	$\displaystyle h_{i-1j}-h_{i-1j-1}$	$\displaystyle\geq h_{ij+1}-h_{ij}.$

Let $H_{k}(\nu,\lambda,\mu)$ denote the set of all hive of type $(\nu,\lambda,\mu)$ . Then the hive conditions (HC1) and (HC2) imply that $H_{k}(\nu,\lambda,\mu)$ is a rational polytope in $\mathbb{R}^{n}$ where $n=\binom{k+2}{2}$ . Hence, we will call $H_{k}(\nu,\lambda,\mu)$ the hive polytope of type $(\nu,\lambda,\mu)$ . Knutson-Tao [7] and Buch [2] showed that

c^{\nu}_{\lambda,\mu}=\text{ the number of integer points in }H_{k}(\nu,\lambda,\mu).

Example 2.2.

Let $k=3$ , $\nu=(4,3,1),\lambda=(2,1,0),$ and $\mu=(3,2,0)$ , we have that $c^{\nu}_{\lambda,\mu}=2$ . The two corresponding integer points (integer labels) of $H_{3}(\nu,\lambda,\mu)$ are shown in Figure 2.

Figure 2: The only two integer points (integer labels) of

H_{3}(\nu,\lambda,\mu)

For fixed partitions $\lambda,\mu,\nu$ with at most $k$ parts such that $|\nu|=|\lambda|+|\mu|$ , we define the the stretched Littlewood-Richardson coefficient to be the function $c^{t\nu}_{t\lambda,t\mu}$ for non-negative integer $t.$ Because $H_{k}(t\nu,t\lambda,t\mu)=tH_{k}(\nu,\lambda,\mu)$ , we have that

c^{t\nu}_{t\lambda,t\mu}=i(H_{k}(\nu,\lambda,\mu),t).

Examples provided in [6] indicate that $H_{k}(\nu,\lambda,\mu)$ is in general not an integral polytope. Thus, by Ehrhart theory (Theorem 2.1), $c^{t\nu}_{t\lambda,t\mu}$ is a quasi-polynomial in $t$ . We will show that $c^{t\nu}_{t\lambda,t\mu}$ is indeed a polynomial in $t$ even though the corresponding hive polytope $H_{k}(\nu,\lambda,\mu)$ is not integral.

2.3 Kostant Partition Function and Steinberg’s Formula

We will show the polynomiality of $c^{t\nu}_{t\lambda,t\mu}$ by using Steinberg’s formula as derived in [11] by Rassart and the chamber complex of the Kostant partition function. To this end, we state the related notations and results for later reference.

Let $e_{1},\dots,e_{k}$ be the standard basis vectors in $\mathbb{R}^{k}$ , and let $\Delta_{+}=\{e_{i}-e_{j}:1\leq i<j\leq k\}$ be the set of positive roots of the root system of type $A_{k-1}.$ We define $M$ to be the matrix whose columns consist of the elements of $\Delta_{+}$ . The Kostant partition function for the root system of type $A_{k-1}$ is the function $K:\mathbb{Z}^{k}\longrightarrow\mathbb{Z}_{\geq 0}$ defined by

K(v)=\Big{|}\left\{b\in\mathbb{Z}_{\geq 0}^{\binom{k}{2}}\,|\,Mb=v\right\}\Big{|}.

That is, $K(v)$ equals the number of ways to write $v$ as nonnegative integer linear combinations of the positive roots in $\Delta_{+}$ .

An important property of the matrix $M$ , when written in the basis of simple roots $\{e_{i}-e_{i+1}\,|\,i=1,\dots,k-1\}$ , is that it is totally unimodular, i.e. the determinant of every square submatrix equals $-1,0,$ or $1.$ Indeed, it is shown in [13] that a matrix $A$ is totally unimodular if every column of $A$ only consists of 0’s and 1’s in a way that the 1’s come in a consecutive block. Let

\mathrm{cone}(\Delta_{+})=\left\{\sum\lambda_{v}v\,|\,v\in\Delta_{+},\lambda_{v}\geq 0\right\}

be the cone spanned by the vectors in $\Delta_{+}.$ The chamber complex is the polyhedral subdivision of $\mathrm{cone}(\Delta_{+})$ that is obtained from the common refinement of cones $\mathrm{cone}(B)$ where $B$ are the maximum linearly independent subsets of $\Delta_{+}$ . A maximum cell (a cone of maximum dimension) $\mathcal{C}$ in the chamber complex is called a chamber. Since $M$ is totally unimodular, the behavior of $K(v)$ is given by the following lemma as a special case of [16, Theorem 1] due to Sturmfels.

Lemma 2.3.

Let $\mathcal{C}$ be a chamber in the chamber complex of $\mathrm{cone}(\Delta_{+})$ . Then the Kostant partition function $K(v)$ is a polynomial in $v=(v_{1},\dots,v_{k})$ on $\mathcal{C}$ of degree at most $\binom{k-1}{2}$ .

Steinberg’s formula [15] expresses the tensor product of two irreducible representations of semisimple Lie algebras as the direct sum of other irreducible representations. When restricting the formula to $\mathrm{SL}_{k}\mathbb{C}$ , we obtain the following version of Steinberg’s formula for computing $c^{\nu}_{\lambda,\mu}$ .

Theorem 2.4 (Steinberg’s Formula).

Let $\mu,\lambda,\nu$ be partitions with at most $k$ part such that $|\nu|=|\lambda|+|\mu|.$ Then

c^{\nu}_{\lambda,\mu}=\sum_{\sigma,\tau\in\mathcal{S}_{k}}(-1)^{\mathrm{inv}(\sigma\tau)}K(\sigma(\lambda+\delta)+\tau(\mu+\delta)-(\nu+2\delta))

where $\mathrm{inv}(\psi)$ is the number of inversions of the permutation $\psi$ and

\delta=\frac{1}{2}\sum_{1\leq i<j\leq k}(e_{i}-e_{j})=\frac{1}{2}(k-1,k-3,\dots,-(k-3),-(k-1))

is the Weyl vector for type $A_{k-1}.$

Details of the derivation can be found in [11, section 1.1].

3 Proof of the Polynomiality

We are now ready to prove Theorem 1.1.

Proof of Theorem 1.1.

The hive conditions imply that $c^{t\nu}_{t\lambda,t\mu}$ is a quasi-polynomial in $t.$ To see that $c^{t\nu}_{t\lambda,t\mu}$ is in fact a polynomial in $t$ , it suffices to show that there exists an integer $N$ such that $c^{t\nu}_{t\lambda,t\mu}$ is a polynomial in $t$ for $t\geq N.$

For $\sigma,\tau\in\mathcal{S}_{k}$ , let

	$\displaystyle r^{\lambda,\mu,\nu}_{\sigma,\tau}(t)$	$\displaystyle:=\sigma(t\lambda+\delta)+\tau(t\mu+\delta)-(t\nu+2\delta)$
		$\displaystyle=t(\sigma(\lambda)+\tau(\mu)-\nu)+\sigma(\delta)+\tau(\delta)-2\delta.$

Then $r^{\lambda,\mu,\nu}_{\sigma,\tau}(t)$ is a ray (when allowing $t$ to be non-negative real number) emanating from $\sigma(\delta)+\tau(\delta)-2\delta$ in the direction of $\sigma(\lambda)+\tau(\mu)-\nu$ .

By Steinberg’s formula,

c^{t\nu}_{t\lambda,t\mu}=\sum_{\sigma,\tau\in\mathcal{S}_{k}}(-1)^{\mathrm{inv}(\sigma\tau)}K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t)).

Lemma 2.3 states that $K(v)$ is a polynomial in $v$ when $v$ stays in one particular cone (chamber) of the chamber complex of $\mathrm{cone}(\Delta_{+})$ . Because there are only finitely many cones in the chamber complex, we have that for every pair $\sigma,\tau\in\mathcal{S}_{k}$ there exists an integer $N^{\lambda,\mu,\nu}_{\sigma,\tau}$ such that exactly one of the following happens:

(1)

The ray $r^{\lambda,\mu,\nu}_{\sigma,\tau}(t)$ lies in one particular cone of the chamber complex for all $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}$
(2)

The ray $r^{\lambda,\mu,\nu}_{\sigma,\tau}(t)$ lies outside $\mathrm{cone}(\Delta_{+})$ for all $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}.$

If (1) is satisfied, then $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is a polynomial in $t$ for $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}$ . If (2) is satisfied, then $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is the zero polynomial for $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}.$ In either case, $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is a polynomial in $t$ for $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}$ . Now let

N=\max_{\sigma,\tau\in\mathcal{S}_{k}}\{N^{\lambda,\mu,\nu}_{\sigma,\tau}\}.

Then Steinberg’s formula implies that $c^{t\nu}_{t\lambda,t\mu}$ is a polynomial in $t$ for $t\geq N.$ Therefore, $c^{t\nu}_{t\lambda,t\mu}$ is a polynomial in $t$ .

By Lemma 2.3, each polynomial piece of $K(v)$ has degree at most $\binom{k-1}{2}$ . Thus, for every $\sigma,\tau$ , we have that $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is a polynomial in $t$ of degree at most $\binom{k-1}{2}$ for $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}.$ Hence, $c^{t\nu}_{t\lambda,t\mu}$ is a polynomial in $t$ of degree at most $\binom{k-1}{2}$ . ∎

In the proof of Theorem 1.1, we showed that every $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is eventually either the zero polynomial or a non-zero polynomial in $t$ . Proposition 3.2 gives a characterization of those $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ that eventually become non-zero polynomials. The proof uses the following characterization of non-zero $K(v)$ .

Lemma 3.1.

Let $v=(v_{1},\dots,v_{k})$ be a vector in $\mathbb{Z}^{k}$ with $v_{1}+\cdots+v_{k}=0$ . Then $K(v)$ is non-zero if and only if $v_{1}+\cdots+v_{i}\geq 0$ for all $i=1,\dots,k$ .

Proof.

Let $M^{*}$ be the matrix $M$ written using the simple roots $e_{1}-e_{2},\dots,e_{k-1}-e_{k}$ as a basis. Then, the entries of $M^{*}$ are only $0$ and $1$ . Moreover, because the simple roots themselves are columns of $M$ , we have that the identity matrix is a submatrix of $M^{*}$ . Similarly, let $v^{*}$ be the vector $v$ written using the simple roots as a basis. Then, $v^{*}=(v_{1},v_{1}+v_{2},\dots,v_{1}+\cdots v_{k-1})$ . The desired result is obtained by observing that

K(v)=\Big{|}\left\{b\in\mathbb{Z}_{\geq 0}^{\binom{k}{2}}\,|\,M^{*}b=v^{*}\right\}\Big{|}.

∎

Proposition 3.2.

Let $\mu,\lambda,\nu$ be partitions with at most $k$ part such that $|\nu|=|\lambda|+|\mu|.$ For $\sigma,\tau\in\mathcal{S}_{k},$ let

r^{\lambda,\mu,\nu}_{\sigma,\tau}(t)=t\beta+\gamma

where $\beta=\sigma(\lambda)+\tau(\mu)-\nu$ and $\gamma=\sigma(\delta)+\tau(\mu)-2\delta.$ Then there exists an integer $N^{\lambda,\mu,\nu}_{\sigma,\tau}$ such that $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is a non-zero polynomial in $t$ for $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}$ if and only if for all $i=1,\dots,k$ we have that

(1)

$\beta_{1}+\beta_{2}+\cdots+\beta_{i}$ is positive, or
(2)

$\beta_{1}+\beta_{2}+\cdots+\beta_{i}$ is zero and $\gamma_{1}+\gamma_{2}+\cdots+\gamma_{i}$ is non-negative.

Proof.

Let $r^{\lambda,\mu,\nu}_{\sigma,\tau}(t)=(r_{1}(t),\dots,r_{k}(t))$ . Then $r_{i}(t)=t\beta_{i}+\gamma_{i}$ . In the proof of Theorem 1.1, we showed that there exists a positive integer $N^{\lambda,\mu,\nu}_{\sigma,\tau}$ such that $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is a polynomial in $t$ for $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}.$ For every $i=1,\dots,k$ , the partial sum $r_{1}(t)+\cdots+r_{i}(t)$ is non-negative for all $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}$ precisely when one of the two conditions meets for all $i=1,\dots,k$ . Thus, by Lemma 3.1, $K(r^{\lambda,\mu,\nu}_{\sigma,\tau}(t))$ is a non-zero polynomial for $t\geq N^{\lambda,\mu,\nu}_{\sigma,\tau}.$ ∎

Acknowledgement

I am grateful to Fu Liu. Her careful review and thoughtful comments significantly improved the exposition of this paper. I also would like to thank UC Davis’s College of Letter and Science for providing the Dean’s Summer Graduate Fellowship to support me during the summer of 2022.

Data Availability Statement

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

Statements and Declarations

Competing Interests: The author declares that there is no conflict of interest.

References

[1] A. D. Berenstein and A. V. Zelevinsky. Triple multiplicities for $\mathrm{sl}(r+1)$ and the spectrum of the exterior algebra of the adjoint representation. Journal of Algebraic Combinatorics, 1(1):7–22, 1992.
[2] A. S. Buch. The saturation conjecture (after a. knutson and t. tao), with an appendix by william fulton. Enseign. Math., 46(1/2):43–60, 2000.
[3] H. Derksen and J. Weyman. On the littlewood–richardson polynomials. Journal of Algebra, 255(2):247–257, 2002.
[4] E. Ehrhart. Sur les polyèdres rationnels homothétiques à n dimensions. C. R. Acad. Sci. Paris, 254:616–618, 1962.
[5] W. Fulton. Eigenvalues, invariant factors, highest weights, and schubert calculus. Bulletin of the American Mathematical Society, 37(3):209–249, 2000.
[6] R. C. King, C. Tollu, and F. Toumazet. Stretched littlewood-richardson and kostka coefficients. In CRM Proceedings and Lecture Notes Vol. 34, pages 99–112. American Mathematical Society, 2004.
[7] A. Knutson and T. Tao. The honeycomb model of $gl_{n}(\mathbb{C})$ tensor products i: Proof of the saturation conjecture. Journal of the American Mathematical Society, 12(4):1055–1090, 1999.
[8] D. E. Littlewood and A. R. Richardson. Group characters and algebra. Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character, 233(721-730):99–141, 1934.
[9] I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford university press, 1998.
[10] I. Pak and E. Vallejo. Combinatorics and geometry of littlewood–richardson cones. European Journal of Combinatorics, 26(6):995–1008, 2005.
[11] E. Rassart. A polynomiality property for littlewood–richardson coefficients. Journal of Combinatorial Theory, Series A, 107(2):161–179, 2004.
[12] B. E. Sagan. The symmetric group: representations, combinatorial algorithms, and symmetric functions, volume 203. Springer Science & Business Media, second edition edition, 2001.
[13] A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, 1998.
[14] R. P. Stanley. Enumerative Combinatorics, volume 2. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1999.
[15] R. Steinberg. A general clebsch-gordan theorem. Bulletin of the American Mathematical Society, 67(4):406–407, 1961.
[16] B. Sturmfels. On vector partition functions. Journal of combinatorial theory, series A, 72(2):302–309, 1995.
[17] S. Sundaram. Tableaux in the representation theory of the classical lie groups. Institute for Mathematics and Its Applications, 19:191–225, 01 1990.
[18] G. Ziegler. Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer New York, NY, 1996.

A Short Proof for the Polynomiality of the Stretched Littlewood-Richardson Coefficients

Abstract

1 Introduction

Theorem 1.1.

2 Preliminaries

2.1 Ehrhart Theory

Theorem 2.1 (Ehrhart Theory).

2.2 The Littlewood-Richardson Coefficients

Example 2.2.

2.3 Kostant Partition Function and Steinberg’s Formula

Lemma 2.3.

Theorem 2.4 (Steinberg’s Formula).

3 Proof of the Polynomiality

Proof of Theorem 1.1.

Lemma 3.1.

Proof.

Proposition 3.2.

Proof.

Acknowledgement

Data Availability Statement

Statements and Declarations

References

A Short Proof for the Polynomiality
of the Stretched Littlewood-Richardson Coefficients