Magic squares, the symmetric group and M¨obius randomness

Diaconis and Gamburd computed moments of secular coeﬃcients in the CUE ensemble. We use the characteristic map to give a new combinatorial proof of their result. We also extend their computation to moments of traces of symmetric powers, where the same result holds but in a wider range. Our combinatorial proof is inspired by gcd matrices, as used by Vaughan and Wooley and by Granville and Soundararajan. We use these CUE computations to suggest a conjecture about moments of characters sums twisted by the M¨obius function, and establish a version of it in function ﬁelds


Introduction
Consider the complex unitary group U (N ) endowed with the probability Haar measure.The nth secular coefficient of U ∈ U (N ) is defined through the expansion det(zI + U ) = N n=0 z N −n Sc n (U ).
If A = (a i,j ) is an m × n matrix with nonnegative integer entries, Diaconis and Gamburd [7] define the row-sum vector row(A) ∈ Z m and column-sum vector col(A) ∈ Z n by row(A) i = as long as max{ ℓ j=1 ja j , ℓ j=1 jb j } ≤ N , where µ and µ are the partitions with a j and b j parts of size j, respectively.
Identity (1.1) answered a question raised in [11,26], where it was shown that U(N ) Sc n (U )dU = 0 and U(N ) |Sc n (U )| 2 dU = 1 hold for 1 ≤ n ≤ N .The results in [7] inspired the study of pseudomoments of the Riemann zeta function [5] and were used in [19] to study the variance of the k-fold divisor function in short intervals.Recently, Najnudel, Paquette and Simm studied the distribution of Sc n with n growing with N [22].
In §2 we give a new combinatorial proof of (1.1), which makes use of the characteristic map.This is in the spirit of Bump's derivation [2,Prop. 40.4] of the Diaconis-Shahshahani moment computation [8].
In §3 we show that a result similar to (1.1) holds for traces of symmetric powers in place of secular coefficients, with substantially relaxed conditions.These traces are also the complete homogeneous symmetric polynomials h n evaluated on the eigenvalues of the matrix.This result can be derived from a theorem of Baxter [16,Prop. 2.11] but again, our proof is combinatorial in nature.
In §4 we give two evaluations of (1.1) without any restriction on N .One evaluation uses the RSK correspondence and generalizes a result of Rains [23], and the second evaluation uses Gelfand-Tsetlin patterns and generalizes an argument of Rodgers [24].These evaluations extend to moments of traces of symmetric powers.As an application, we give a new formula for a matrix integral that was considered by Keating, Rodgers, Roditty-Gershon and Rudnick in their study of the k-fold divisor function [19].
In §5 we show how an analogue of our proof of (1.1) has appeared in number-theoretic works of Vaughan and Wooley and of Granville and Soundararajan.The number-theoretic analogues of (1.1) concern moments of character sums on which there are several unconditional results in the literature.However, our result on symmetric traces corresponds to a conjecture we make about moments of sums of the Liouville (or the Möbius) function twisted by a Dirichlet character, which seems very difficult and reflects the random nature of Möbius, see Conjecture 5.1.As we explain in §5, the conjecture suggests that the Steinhaus random multiplicative function is a good model for the Liouville (or the Möbius) function twisted by a random Dirichlet character: λ • χ where χ is chosen uniformly at random from the group of Dirichlet characters modulo q (q → ∞) and λ(n) = (−1) p, k≥1:p k |n 1 .
2 Proof of the Diaconis-Gamburd Theorem

The symmetric group
For a permutation π we say that S is an invariant set for π if π(S) = S. Equivalently, S is a union of cycles of π.Given a sequence λ = (λ 1 , . . ., λ ℓ ) of nonnegative integers that sum to n, we define the following function on the symmetric group S n acting on [n] := {1, 2, . . ., n}: where • ∪ means disjoint union.We use the letter d here as short for divisor, as invariant sets for π are analogous to divisors of an integer m, and d λ is analogous to a generalized divisor function over the integers, with divisors localized at certain scales (in the integers we might define  π) where C(π) is the number of cycles of π; this is the permutation analogue of the divisor function.Remark 2.2.See [9] for a recent application of the analogy between invariant sets for a permutation and divisors of an integer.
Given sequences µ and µ of nonnegative integers summing to n, let us define Proposition 2.3.Suppose µ, µ ⊢ n.We have N ′ µ, µ = N µ, µ .Proof.By definition, given a partition λ = (λ 1 , . . ., λ ℓ ) ⊢ n we may express d λ (π) as a sum over ordered set partitions: where α A1,...,A ℓ is the indicator function of permutations π ∈ S n with π(A i ) = A i for all i.Applying (2.1) with λ = µ and multiplying by (2.1) with λ = µ we obtain where ℓ(λ) is the number of parts in a partition.Averaging this over S n and interchanging the order of summation, we find 2) The inner sum in the right-hand side of (2.2) counts permutations π ∈ S n for which A i are invariant sets, as well as the B j .In particular π( Conversely, given a permutation such that π(A i ∩B j ) = A i ∩B j for all i and j, it necessarily satisfies π(A i ) = A i and π(B j ) = B j for all i and j.Thus, the inner sum counts πs with π( are pairwise disjoint and their union is [n], and so such πs are determined uniquely by their restrictions to A i ∩ B j , which may be arbitrary, proving that the inner sum is The inner expression in the right-hand side is the number of ordered set partitions of [n] into subsets C i,j of size c i,j (these sets correspond to A i ∩ B j and one reconstructs A i by A i = ∪ j C i,j and similarly B j = ∪ i C i,j ).This is just the multinomial In the simple case µ = (n) , Proposition 2.3 reduces to π∈Sn d µ (π)/|S n | = 1.

The characteristic map
Endow S n with the uniform probability measure.The characteristic (or Frobenius) map Ch (N ) is a linear map from class functions on S n to class functions on U (N ), with the property that if n ≤ N then it is an isometry with respect to the L 2 -norm, see [2,Thm. 40.1].It may be given by Ch (N ) see [2,Thm. 39.1].Here λ(π) is the partition associated with π (the nondecreasing sequence, summing to n, of integers corresponding to the cycle sizes in π), and p λ is the power sum symmetric polynomial associated with λ, evaluated at the eigenvalues of U ∈ U (N ).
Lemma 2.4.Suppose λ ⊢ n.We have where sgn is the sign representation and e λ is the elementary symmetric polynomial associated with the partition λ.
Proof.Given π ∈ S n , we set p π = p λ(π) .We denote by ℓ(λ) the number of parts in λ.We then have, by plugging (2.1) in the definition of Ch (N ) (sgn • d λ ) and interchanging order of summation, We claim that the inner sum is e λ .Indeed, since π is determined by the restrictions π| Ai , and since p λ = i p λi , we have where the last equality follows from the Newton-Girard identity π∈Sm sgn(π)p π /m! = e m .To finish, note that the number of ordered set partitions of [n] into ℓ(λ) sets of sizes (λ i ) i=1 is exactly the binomial coefficient n λ1,...,λ ℓ(λ) .

Conclusion of proof
Here we establish (1.1).Let (a 1 , . . ., a ℓ ) and (b 1 , . . ., b ℓ ) be sequences of nonnegative integers satisfying the condition max{ ℓ j=1 ja j , ℓ j=1 jb j } ≤ N .Let µ and µ be the partitions with a j and b j parts of size j, respectively.
If j ja j = j jb j , it is easy to see that both sides of (1.1) vanish.Indeed, for the right-hand side, note that the integrand is an homogeneous polynomial in the eigenvalues fof U , whose degree is nonzero, so its integral must vanish by translation-invariance of the Haar measure.On the other hand, if N µ, µ is nonzero, we must have that µ and µ sum to the same number (if A = (a i,j ) is a matrix counted by N µ, µ then both µ and µ sum to i,j a i,j ).Now assume j ja j = j jb j = n ≤ N .As j Sc j (U ) aj Sc j (U ) bj = e µ e µ by definition, the fact that and the proof is concluded by applying Proposition 2.3.

Symmetric powers
Let TrSym n (U ) be the trace of the nth symmetric power of U ∈ U (N ).This is also the nth complete homogeneous symmetric polynomial h n evaluated on the eigenvalues of U .
Lemma 3.1.Let (a j ) ℓ j=1 , (b j ) ℓ j=1 be sequences of nonnegative integers.We have as long as min{ ℓ j=1 a j , ℓ j=1 b j } ≤ N , where µ and µ are the partitions with a j and b j parts of size j, respectively.
We start with the following corollary of Lemma 2.4.
Proof.This follows from Lemma 2.4 through the existence of an involution ι on the space of symmetric polynomials, with the properties ι(Ch (N )  Next we prove the following well-known identity, often proved as a consequence of the RSK correspondence.Recall that for given partitions λ and µ, the Kostka number K λ,µ is defined as the number of semistandard Young tableaux (SSYTs) of shape λ and weight µ [7, §2.3].
Proof.We may expand e µ and e µ in the Schur basis, see [27, p. 335]: where λ ′ is the conjugate of λ.Let a j and b j be the number of js in µ and µ, respectively.Orthogonality of Schur functions [7, Eq. ( 22)] implies that On the other hand, this integral was shown to equal N µ, µ in (1.1).
We now prove Lemma 3.1.
Proof.The case ℓ j=1 ja j = ℓ j=1 jb j is treated as in the secular coefficients case.Next, assume that j ja j = j jb j = n and min{ ℓ j=1 a j , ℓ j=1 b j } ≤ N .The multiset of eigenvalues of TrSym j (U ) consists of products of j eigenvalues of U , and so the integrand in the left-hand side of (3.1) is h µ h µ .We may expand h λ in the Schur basis, see Stanley [27,Cor. 7.12.4]: Orthogonality of Schur functions implies that the left-hand side of (3.1) is We claim K λ,µ = 0 implies ℓ(λ) ≤ ℓ(µ) (see e.g.[27,Prop. 7.10.5]).This follows from the definition of Kostka numbers: the first column of an SSYT counted by K λ,µ contains ℓ(λ) increasing positive integers less than or equal to ℓ(µ), hence the implication.
Remark 3.4.Lemma 3.1 may also be derived from a theorem of Baxter on Toeplitz determinants for certain generating functions [1] (cf. [16, Prop.2.11]), special cases of which appeared in earlier works of Szegő and Onsager.Concretely, Baxter proved that (originally in the language of Toeplitz determinants) if min{ℓ, m} ≤ N then for complex |a j | < 1 and |b i | < 1. Expanding the rational functions in both sides as power series and comparing coefficients, one obtains Lemma 3.1.In a sense, the appearance of magic squares in random matrix theory could have been anticipated due to (3.5).
Remark 3.5.A weaker version of Lemma 3.1, with max in place of min, may be derived from formulas for averages of ratios of characteristic polynomials [6,3].

General moments
Given a matrix with nonnegative integer entries, an SE-chain is a sequence of entries in which each entry is located weakly to the right of and weakly below the preceding entry.The length of an SE-chain is defined as the sum of elements in it.An ne-chain is a sequence of nonzero entries in which each entry is strictly to the right of and strictly above the preceding entry.The length of an ne-chain is defined as the number of elements in it.
The RSK correspondence is a bijection from the set of matrices with nonnegative integers to the set {(P 1 , P 2 ) : P i are SSYTs with the same shape}, see [27,Ch. 7.11] for its description.The bijection takes a matrix A to a pair (P 1 , P 2 ) where the weight of P 1 is row(A) and the weight of P 2 is col(A).We denote by λ the common shape of P 1 and P 2 .A theorem of Schensted [25] (cf.Theorem 8 of Krattenthaler [21] with k = 1) tells us that the largest part of λ (resp.the number of parts in λ) equals the length of the longest SE-chain (resp.ne-chain) of A.
is equal to the number of permutations in S n with longest increasing subsequence of length ≤ N , a result of Rains [23].
Proof of Proposition 4.1.The proof of the evaluation of (4.1) is almost the same as the proof of (1.1) in [7], where N ≥ max{ j ja j , j jb j } was imposed.Instead of imposing this we invoke Schensted's theorem at the end of the proof: As in the proof of (1.1) we may assume j ja j = j jb j = n for some n ≥ 0. Since ℓ j=1 Sc j (U ) aj = e µ (U ) and ℓ j=1 Sc j (U ) bj = e µ (U ), the expansions in (3.3) together with orthogonality of Schur functions [7, Eq. ( 22)] imply that (4.1) equals i.e. the number of pairs (P, Q) of SSYTs where P has weight µ, Q has weight µ, and P and Q have a common shape λ ⊢ n such that λ 1 ≤ N .By the RSK correspondence and Schensted's theorem [25], such pairs are in one-to-one correspondence with the matrices described in the first part of the proposition.Now consider (4.2).As we saw in the proof of Lemma 3.1, (4.2) is equal to the sum in (3.4), i.e. the number of pairs (P, Q) of SSYTs where P has weight µ, Q has weight µ, and P and Q have a common shape λ such that λ ⊢ n and ℓ(λ) ≤ N .By the RSK correspondence and Schensted's theorem [25], such pairs are in one-to-one correspondence with the matrices described in the second part of the proposition. Let Summing (4.1) over all sequences (a j ) j and (b j ) j of nonnegative integers such that j ja j = j b j = n, j a j = j b j = k and applying the first part of Proposition 4.1, we obtain Corollary 4.2.Let n, k, N ≥ 1.Then I k (n; N ) is equal to the number of k × k matrices with nonnegative integer entries whose sum is n, and their longest SE-chain has length ≤ N .
The integral I k (n; N ) was studied extensively in [19].According to Theorem 1.5 of [19], holds uniformly for n, N ≥ 1, where γ k : R ≥0 → R ≥0 is an explicit function supported on [0, k] [19, Eq. (1.12)].Thus, in view of Corollary 4.2, if we pick uniformly at random a k ×k matrix with nonnegative integer entries that sum to n, the probability that its longest SE-chain has length ≤ N can be shown to be Theorem 1.4 of [19] (cf.[24, Thm.1.5]) shows I k (n; N ) equals the number of arrays (x i,j ) 1≤i,j≤k of nonnegative integers satisfying x 1,1 ≤ N , k i=1 x i,i = n, and x i,j is weakly decreasing when either i or j is fixed.We give a similar description of the integrals in Proposition 4.1 using an idea of Rodgers [24, p. 1270].Proposition 4.3.Let N ≥ 1.Given sequences (a 1 , . . ., a ℓ ) and (b 1 , . . ., b ℓ ) of nonnegative integers, let µ and µ be the partitions with a j and b j parts of size j, respectively.The integral (4.1) (resp.(4.2)) equals the number of arrays (x i,j ) 1≤i≤ℓ(µ), 1≤j≤ℓ( µ) of nonnegative integers satisfying each of the following conditions: x i,j is weakly decreasing when either i or j is fixed,
Proof.If j ja j = j jb j , i.e. i µ i = i µ i , then the integrals (4.1) and (4.2) vanish as in the proof of (1.1).In this case there can be no arrays satisfying the third condition with (r, s) = (ℓ(µ), ℓ( µ)), which is what we needed to show.From now on we assume that j ja j = j jb j = n for some n.
A Gelfand-Tsetlin pattern (or GT-pattern) of k rows is a triangular array of nonnegative integers (a i,j ) 1≤i≤j≤k with a i,j ≤ a i+1,j+1 ≤ a i,j+1 when 1 ≤ i, j ≤ k − 1; its largest element is a 1,k .SSYTs with entries in {1, 2, . . ., k} are in one-to-one correspondence, described in detail by Stanley [27,, with such arrays.SSYTs of shape λ = (λ 1 , . . ., λ m ) and weight (w 1 , . . ., w r ) (r ≤ k) correspond to GT-patterns of k rows such that a 1,i = λ k−i+1 and j∈[i,k] a i,j = w 1 + w 2 + . . .+ w k−i+1 for all 1 ≤ i ≤ k (here w i ≡ 0 if i > r, λ i ≡ 0 if i > m).In words, the first row of the pattern recovers the shape of the SSYT (by reversing the row), and the row sums recover the weight.
Summing Proposition 4.3 over all sequences (a j ) j and (b j ) j of k nonnegative integers such that j ja j = j jb j = n and j a j = j b j = k, we recover Theorem 1.4 of [19].

Number-theoretic connections 5.1 A polynomial analogue of d λ
Let λ ⊢ n.Over F q [T ], the polynomial ring over the finite field of q elements, it is straightforward to define an analogue of d λ .Letting M n,q ⊆ F q [T ] be the subset of monic polynomials of degree n, we set If µ, µ are partitions of n then we claim The second equality in (5.1) is just Proposition 2.3.The first equality in (5.1) has to do with a general principle and applies to a general class of functions1 However, the fact that the left-hand side of (5.1) equals to the right-hand side can be established directly, as we sketch now.By definition, f ∈Mn,q d µ,q (f )d µ,q (f ) counts solutions to the equation where deg f i = µ i and deg g j = µ j .We explain how to count such solutions.We can associate with any pair of tuples of solutions (f i ) i and (g j ) j a gcd matrix h i,j := gcd(g i , f j ), analogous to the matrix constructed in the proof of Proposition 2.3.At least if the (g i ) i are pairwise coprime and so are (f j ) j , we may reconstruct them from h i,j via g i = j h i,j and h j = i h i,j .Fortunately, in the large-q limit we can impose these coprimality conditions and only incur an error of o q→∞ (q n ) (the details are left to the reader).Given a gcd matrix (h i,j ) i,j (coming from pairwise coprime (g i ) i and pairwise coprime (f j ) j ) we can further form a degree matrix (deg h i,j ) i,j of the same size, which is counted by N µ, µ .For each degree matrix (d i,j ) i,j counted by N µ, µ we need to count the number of gcd matrices corresponding to it, that is, monic h i,j with deg h i,j = d i,j and h i,j being pairwise coprime (a consequence of the pairwise coprimality of (g i ) i and (f j ) j ).As already mentioned, in the large-q limit these coprimality conditions do not affect asymptotics, and the number of such h i,j is q i,j di,j (1 + o q→∞ (1)) = q n (1 + o q→∞ (1)) (so, always asymptotic to q n , regardless of the specific (d i,j ) i,j ).All in all, we obtain that the left-hand side of (5.1) is equal to the right-hand side, without using the first equality in (5.1).
This idea can be made to work for fixed q as well using a clever construction of Vaughan and Wooley [28, §8], which can be used to show that in fact f ∈Mn,q d µ,q (f )d µ,q (f ) is a polynomial in q of degree n and leading coefficient N µ, µ , but we do not give details.They construct matrices which take into account common factors.They used an inductive process to associate with a solution of i=1 a i,r ; this also works with polynomials instead of integers.The process goes by letting a 1,1 = gcd(m 1 , n 1 ) and then defining, using induction on i + j, a i,j = gcd(m i / ℓ<j a i,ℓ , n j / ℓ<i a ℓ,j ).The above process was discovered independently by Granville and Soundararajan in the proof of [10,Thm. 4].We explain how these gcd matrices arose in their work because it is not to difficult to relate it to matrix integrals.They were interested in the order of magnitude of moments of character sums: Here the sum is over all Dirichlet characters modulo q.Using orthogonality of characters, we have They were also interested in moments of sums of the (Steinhaus) random multiplicative function, which we denote by α and whose definition we now recall.It is a random completely multiplicative function (α(nm) = α(n)α(m) for all n, m ≥ 1), chosen in such a way that (α(p)) p (p prime) are i.i.d.random variables taking values uniformly on {z ∈ C : |z| = 1}.Then we have the orthogonality relation and similarly, The gcd matrices one associates with the solutions counted by M k (x, q) (if x k ≤ q) and M k (x) can be counted and in turn lead to bounds on M k (x, q) and M k (x) as in [10,.We refer the reader to Heap and Lindqvist [15] for asymptotics results for M k (x, q) (x k ≤ q) and M k (x) (cf.Harper, Nikeghbali and Radziwi l l [14]).See also Harper [12,13] for estimates on M k (x) in a wide range of k ≥ 0, including noninteger k.
In function fields, the connection between character sums and secular coefficients is natural.If χ is a nonprincipal Dirichlet character modulo Q, we can form its Dirichlet L-function which is a polynomial whose nth coefficient is exactly a character sum.By Weil's Riemann hypothesis, we can see that (5.3)If χ is odd (i.e.χ is not trivial on F × q ) and primitive we have deg L(u, χ) = deg Q − 1 and the zeros of L all lie on |u| = q −1/2 so that we can write L(u, χ) as a characteristic polynomial of a scaled unitary matrix: Comparing coefficients, we find that f ∈Mn,q χ(f ). (5.4) Since in the large-q limit a random polynomial will be coprime to Q with probability approaching 1, we can deduce from (5.5) (using gcd matrices as used in establishing (5.1)) that holds as q → ∞, where we assume nk ≤ deg Q and that n, k and deg Q are fixed.Here (n k ) stands for the partition of nk consisting of n repeated k times.The term o q→∞ (1) goes to 0 as q → ∞ and may depend on the fixed parameters.We can also package (5.5) as where now α is a Steinhaus random multiplicative function in F q [T ] which satisfies orthogonality relations similar to (5.2), and nk ≤ deg Q.In the large-q limit almost all characters are primitive and odd [20,Eq. (3.25)] and we obtain from (5.3) and (5.4) that where the last equality is (1.1).Here n, k and deg Q are fixed and satisfy nk ≤ deg Q − 1.The fact that the left-hand side of (5.9) converges to the right-hand side is essentially a special case of a deep equidistribution theorem of Katz [17].Katz proved that -at least for squarefree Q -the ensemble (Θ χ ) χ odd, primitive mod Q equidistributes in U (deg Q − 1) as q → ∞.In other words, the average of a continuous function f : U (deg Q − 1) → C over the finite ensemble (Θ χ ) χ odd, primitive mod Q converges, as q → ∞, to an average of f over the full group U (deg Q − 1). 2 For certain test functions f , Katz's result can be proved elementarily, and in fact his proof proceeds by first (without using algebraic geometry) establishing it for a particular family of functions.The elementary proof of (5.9), which corresponds to f (U ) = |Sc n (U )| 2k , certainly does not generalize to general functions.What about traces of symmetric powers?These arise when twisting the Möbius function by a character.Given a Dirichlet character χ modulo Q, we have The nth coefficient of this rational function is (5.11) by Weil's Riemann hypothesis.If χ is odd and primitive we have for all n.In the large-q limit almost all characters are primitive and odd and we obtain from (5.10), (5.11) and (5.12) that to handle the contribution of the principal character).In particular, by using Katz's equidistribution result [17, Thm.], The asymptotic relation (5.13) can be shown to imply that if we replace equality in (5.14) with an asymptotic then it continues to hold in the much wider range k ≤ deg Q − 1, at least if one takes a large-q limit and assumes Q is squarefree.We believe this should hold without taking the large-q limit and for all Q, and we suggest the following conjecture in integers.
Conjecture 5.1.Suppose q and x tend to ∞ and that k < log q.We have Here k is allowed to vary with x and q, and λ is the Liouville function λ(n) = (−1) p, k≥1: p k |n 1 .
This should be contrasted with the more modest range x k ≤ q that occurs in the same problem but without an appearance of µ or λ: (5.15) Remark 5.2.The range x k ≤ q is essentially optimal (up to x o(1) ), even if we replace equality with an asymptotic.In the current formulation this is trivial, since the principal character contributes x 2k /φ(q) to the left-hand side of (5.15).If one removes the principal character, this still should be optimal.We do not attempt to demonstrate this here, but make two comments: 1) if x is an integer divisible by q then n≤x χ(n) vanishes for any nonprincipal χ, showing the left-hand side of (5.15) vanishes for x = q if we remove the principal character, 2) the optimality claim is related to U(N ) |Sc n (U )| 2k dU ∼ N (n k ),(n k ) failing to hold if N ≤ nk(1 − ε) and n → ∞, which we expect can be demonstrated using Proposition 4.3 and the tools in [19].
Already for k = 1 Conjecture 5.1 is a very difficult open problem, related to the variance of µ and λ in arithmetic progressions, see e.g.[18].
We view Conjecture 5.1 as a manifestation of Möbius randomness.One interpretation of it is that the Steinhaus random multiplicative function α (resp.α • µ 2 ) is a good model for λ (resp.µ) twisted by a random Dirichlet character χ modulo q (q → ∞) 3 .It certainly models λ times a random character better than it models just a random character, at least from the point of view of moments. Let From orthogonality of characters we have the identities 1 φ(q) χ mod q n≤x µ(n)χ(n n,m≤x k n≡m mod q (nm,q)=1 µ x,k (n)µ x,k (m).

Proposition 4 . 1 .(
Let N ≥ 1.Given sequences (a 1 , . . ., a ℓ ) and (b 1 , . . ., b ℓ ) of nonnegative integers, let µ and µ be the partitions with a j and b j parts of size j, respectively.The integralU(N ) ℓ j=1 Sc j (U ) aj Sc j (U ) bj dU (4.1)is equal to the the number of ℓ(µ) × ℓ( µ) matrices A with nonnegative integer entries such that row(A) = µ, col(A) = µ and the longest SE-chain in A has length ≤ N .The integralU(N ) ℓ j=1 TrSym j (U )) aj (TrSym j (U )) bj dU (4.2)is equal to the the number of ℓ(µ) × ℓ( µ) matrices A with nonnegative integer entries such that row(A) = µ, col(A) = µ and the longest ne-chain in A has length ≤ N .Proposition 4.1 generalizes (1.1) and Lemma 3.1.If a j = b j = 0 for j ≥ 2 and a 1 = b 1 = n, Proposition 4.1 shows (a condition required by Katz).In the second equality in (5.13) we used Lemma 3.1, which is the reason for the range k ≤ deg Q − 1.In the restricted range nk ≤ deg Q we can mimic (5.5)-(5.7)and obtain 1