Signed Knapsack Numbers in GL(n)

• Signed knapsack numbers are alternating sums of knapsack counts in GL(n) that reformulate Littlewood–Richardson coefficients using an inclusion–exclusion principle.
• They connect tableau combinatorics via Kostka numbers with root-system methods through Kostant’s partition function, unifying multiple combinatorial perspectives.
• This formulation leads to practical algorithms and complexity insights by reducing the computation of representation-theoretic multiplicities to counting integer solutions in linear systems.

Searching arXiv for the primary paper and closely related references on LR coefficients, Kostka numbers, and Kostant partition function. Signed knapsack numbers, in the setting of $GL_n$, are alternating sums of knapsack counts indexed by the Weyl group $S_n$. In the formulation developed in "Littlewood-Richardson coefficients as a signed sum of Kostka numbers" (Shrivastava, 2022), they arise through Steinberg’s formula for Littlewood–Richardson coefficients, where each summand is a value of Kostant’s partition function and therefore counts nonnegative integer solutions to a linear equation with columns the positive roots. The same work places signed knapsack numbers at the intersection of symmetric-function expansions, tableau combinatorics, and root-system methods by showing that Littlewood–Richardson coefficients are signed sums of Kostka numbers, and, via Kostant’s partition function, signed sums of knapsack numbers (Shrivastava, 2022).

1. Definition and ambient structures

The relevant ambient objects are partitions, Schur polynomials, Littlewood–Richardson coefficients, and Kostka numbers. A partition, or highest weight, is a weakly decreasing $n$-tuple of nonnegative integers

$\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$

with total weight $|\lambda|:=\sum_i \lambda_i$. The dominance order $\mu \le \lambda$ means

$$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$

with $|\mu|=|\lambda|$ (Shrivastava, 2022).

For $\lambda$ with at most $n$ parts, the Schur polynomial $S_n$0 in variables $S_n$1 is defined by

$S_n$2

These form a basis for $S_n$3 and represent the characters of irreducible polynomial representations of $S_n$4 (Shrivastava, 2022).

Given partitions $S_n$5 with $S_n$6, the Littlewood–Richardson coefficients $S_n$7 are the structure constants for multiplication in the Schur basis:

$S_n$8

Equivalently, if $S_n$9 denotes the Hall inner product, then

$n$0

For a partition $n$1 and a composition $n$2 of the same total weight, the Kostka number $n$3 counts semistandard Young tableaux of shape $n$4 and content $n$5. It is also the coefficient of $n$6 in a product of complete symmetric functions:

$n$7

where

$n$8

A standard nonvanishing criterion is

$n$9

These definitions supply the basic representation-theoretic and combinatorial context in which signed knapsack numbers appear. The key transition is that multiplicities in Schur multiplication can be rewritten as alternating sums, first over Kostka numbers and then over knapsack counts (Shrivastava, 2022).

2. Littlewood–Richardson coefficients as signed sums of Kostka numbers

The central structural result is a product expansion expressing $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$0 in terms of Schur functions indexed by chambered permutations of $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$1. Let

$\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$2

the half-sum of positive roots for $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$3, and let $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$4 denote the stabilizer of $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$5 under coordinate permutations. For each coset representative $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$6, let $\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$7 be the unique permutation sending

$\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$8

to the dominant Weyl chamber. Then the theorem is (Shrivastava, 2022):

$\lambda = (\lambda_1,\lambda_2,\dots,\lambda_n),$9

Equating coefficients of $|\lambda|:=\sum_i \lambda_i$0 yields the signed-sum formula

$|\lambda|:=\sum_i \lambda_i$1

Here $|\lambda|:=\sum_i \lambda_i$2 is the unique permutation that reorders the tuple

$|\lambda|:=\sum_i \lambda_i$3

into weakly decreasing order, so that the Kostka number is well defined. Any term for which this chambered tuple is not a partition contributes zero, because Kostka numbers vanish outside the dominance constraints (Shrivastava, 2022).

This identity is the immediate precursor of the signed knapsack interpretation. It expresses Littlewood–Richardson multiplicities not as direct tableau counts, but as alternating sums of tableau-counting quantities. The alternation is governed by the Coxeter length $|\lambda|:=\sum_i \lambda_i$4, and the chambering operator $|\lambda|:=\sum_i \lambda_i$5 enforces dominance by moving weights into the positive Weyl chamber.

3. Kostant’s partition function and the knapsack interpretation

The knapsack component enters through Kostant’s partition function. For type $|\lambda|:=\sum_i \lambda_i$6, the positive roots of $|\lambda|:=\sum_i \lambda_i$7 are

$|\lambda|:=\sum_i \lambda_i$8

where $|\lambda|:=\sum_i \lambda_i$9 are the standard basis vectors of $\mu \le \lambda$0. Kostant’s partition function $\mu \le \lambda$1 is defined by the generating series

$\mu \le \lambda$2

Equivalently,

$\mu \le \lambda$3

Thus $\mu \le \lambda$4 counts the number of nonnegative integer solutions to a linear equation whose columns are the positive roots; this is precisely a knapsack-type counting problem (Shrivastava, 2022).

The same exposition records a signed-sum representation of Kostka numbers in terms of $\mu \le \lambda$5:

$\mu \le \lambda$6

Conceptually, this is an inclusion–exclusion formula over the Weyl group. The change of basis between complete symmetric functions and Schur functions, together with chambering into the dominant region, produces the alternating sum. The sign is the parity of the permutation length, and the partition function $\mu \le \lambda$7 records the underlying knapsack counts (Shrivastava, 2022).

In this sense, a signed knapsack number is not merely a counting function but an alternating count obtained by Weyl-group correction. The “signed” aspect is intrinsic: it compensates for overcounting across chambers.

4. Steinberg’s formula and the precise meaning of “signed knapsack number”

Substituting the signed-sum formula for Kostka numbers into the signed-sum formula for Littlewood–Richardson coefficients yields Steinberg’s formula:

$\mu \le \lambda$8

This is the standard form for $\mu \le \lambda$9, with $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$0 and $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$1 (Shrivastava, 2022).

This identity gives the exact meaning of signed knapsack numbers in this context. Each summand

$$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$2

is a knapsack number, because it counts nonnegative integer solutions to a linear system with columns the positive roots. The Littlewood–Richardson coefficient is then an alternating sum of these knapsack counts over the Weyl group. The exposition makes the terminology explicit: LR multiplicities are “signed knapsack numbers” (Shrivastava, 2022).

The proof strategy recorded there proceeds in three steps. First, start from the corollary expressing $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$3 as a signed sum of Kostka numbers indexed by chambered differences. Second, write each Kostka number as an alternating sum of partition-function values. Third, reorganize the sum using carefully chosen permutations, after which the chambering signs and nonvanishing constraints force the expression into Steinberg’s form. A key observation is that terms outside the positive cone vanish, while the permutation sending a weight into the positive chamber contributes a sign equal to the parity of its length (Shrivastava, 2022).

A plausible implication is that signed knapsack numbers synthesize three perspectives that are often treated separately: Schur-basis structure constants, semistandard tableau enumeration, and positive-root partition counts. The source material states this unification explicitly at the level of formulas.

5. Algorithmic formulation and complexity-theoretic status

The signed-sum Kostka formulation yields an explicit algorithm for computing $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$4, assuming access to a black box for Kostka numbers in polynomial time. The steps stated in the source are as follows (Shrivastava, 2022).

1. Input $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$5 and partitions $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$6 as $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$7-tuples, and initialize $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$8.
2. Enumerate all compositions $$\sum_{i=1}^k \mu_i \le \sum_{i=1}^k \lambda_i \quad \text{for all } k \ge 1,$$9 with $|\mu|=|\lambda|$0 in dominance order. The exposition states that this can be done in time

$|\mu|=|\lambda|$1

where $|\mu|=|\lambda|$2 denotes the bit-length of the input tuple.

1. For each such $|\mu|=|\lambda|$3, check whether there exist permutations $|\mu|=|\lambda|$4 such that

$|\mu|=|\lambda|$5

that is, whether $|\mu|=|\lambda|$6 is a permutation of the relevant chambered difference. The paper provides an $|\mu|=|\lambda|$7 procedure, described as iteratively matching and deleting entries, to find such $|\mu|=|\lambda|$8 and $|\mu|=|\lambda|$9 or conclude that none exist.

2. If a match exists, add

$\lambda$0

3. Output $\lambda$1.

The complexity discussion states that Step 2 dominates enumeration, Step 3 requires $\lambda$2 per $\lambda$3, and Step 1 and final output are linear in input size. Under the assumption that $\lambda$4 is available in polynomial time, $\lambda$5 is computable in polynomial time in the input size (Shrivastava, 2022).

The same exposition further states that Kostka numbers are special Littlewood–Richardson coefficients and that computing either Littlewood–Richardson coefficients or Kostka numbers is #P-complete. Combined with the polynomial-time reduction from Littlewood–Richardson coefficients to Kostka numbers and known reductions in the opposite direction, this places the two problems in the same class of decision and counting problems under Turing reductions (Shrivastava, 2022).

This computational perspective is central to the significance of signed knapsack numbers. They are not only formal identities; they provide a mechanism for transferring complexity-theoretic and algorithmic information between tableau counts, structure constants, and root-theoretic partition counts.

6. Illustrative $\lambda$6 cases and interpretive remarks

Two small $\lambda$7 examples recorded in the exposition illustrate how the signed formulas collapse in simple cases (Shrivastava, 2022).

For

$\lambda$8

one has

$\lambda$9

The tuples

$n$0

range over permutations of the difference, and only $n$1 is dominant and $n$2. It occurs for $n$3 with $n$4, so

$n$5

Using Steinberg’s formula gives the same result. Since $n$6, one has

$n$7

For $n$8 this is $n$9, so $S_n$00; for $S_n$01 the difference is not in the positive root cone, hence the partition function vanishes. Therefore $S_n$02.

A second check uses

$S_n$03

Again $S_n$04, so

$S_n$05

The identity permutation contributes $S_n$06, while the other permutations contribute zero because the corresponding weights lie outside the positive cone. Hence

$S_n$07

In the signed-sum Kostka identity, the only contributing Kostka number comes from

$S_n$08

for which $S_n$09, again with positive sign.

These examples show how substantial cancellation can occur in signed knapsack formulas. The exposition notes that understanding which Weyl-group elements produce weights in the positive cone is crucial (Shrivastava, 2022). It also remarks that, for type $S_n$10, $S_n$11 admits a flow interpretation on the complete directed graph with capacities $S_n$12 along edges $S_n$13 for $S_n$14 summing to $S_n$15, and that efficient pseudopolynomial routines exist for special cases. This suggests that the utility of signed knapsack numbers is both conceptual and practical: they provide a common language for tableau combinatorics, symmetric-function identities, and integer-solution counting.

7. Conceptual synthesis

The key formulas may be organized as a progression from symmetric functions to signed knapsack numbers (Shrivastava, 2022):

$S_n$16

$S_n$17

$S_n$18

$S_n$19

and finally

$S_n$20

Within this chain, signed knapsack numbers are the endpoint at which Littlewood–Richardson multiplicities become alternating sums of counts of nonnegative integer solutions to linear equations. The source material emphasizes two consequences. First, the viewpoint unifies combinatorial tableau definitions, symmetric-function expansions, and root-theoretic partition functions. Second, it yields polynomial-time reductions between the computation of Littlewood–Richardson coefficients and Kostka numbers, situating both in the same #P-complete framework (Shrivastava, 2022).

The term therefore designates more than a reformulation of Steinberg’s formula. In the precise $S_n$21 context developed in (Shrivastava, 2022), a signed knapsack number is an alternating Weyl-group sum of Kostant partition counts, and Littlewood–Richardson coefficients are exactly such quantities.