This paper investigates how products of stabilizing symmetric group representations follow specific recursive relations, introducing new difference operators to describe their behavior.
Contribution
It introduces a novel class of difference operators to characterize recursive relations in products of stabilizing representations.
Findings
01
Products satisfy recursive relations.
02
New difference operators effectively describe these relations.
03
Advances understanding of representation stability.
Abstract
We study representation stability in the sense of Church and Farb. We show that products of stabilizing Sn -representations fulfill certain recursive relations which can be described by a new class of difference operators.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
We study representation stability in the sense of Church and Farb. We show that products of stabilizing Sn-representations fulfill certain recursive relations which can be described by a new class of difference operators.
1. Introduction
We study representations of the symmetric group Sn and formulate our statements about Sn-representations in the world of symmetric functions. We refer to Macdonald [2] for background on Sn-representations and symmetric functions. The Z-module of symmetric functions corresponding to (virtual) Sn-representations is denoted by Λn. A number partition λ of n∈N is a finite weakly decreasing sequence λ=(λ1,...,λl) of positive integers such that λ1+...+λl=n. We also write λ⊢n or ∣λ∣=n in that case. The number l=l(λ) is the length of λ. The set of Schur functions {sλ∣λ⊢n} is a basis of Λn. We define the componentwise sum of two partitions λ=(λ1,...,λl) and μ=(μ1,...,μk) with l≤k by
λ+μ=(λ1+μ1,...,λl+μl,μl+1,...,μk).
For a fixed partition λ we denote by sμ+λ the function sμ+λ and extend this definition from the basis of Schur functions linearly to all symmetric functions. By ΛNn0,k we denote the Z-module of sequences {fn}n∈N with fn∈Λnk+n0 for all n∈N. For every n0∈N, every partition λ and every divisor m of ∣λ∣ we define
[TABLE]
[TABLE]
We write Δλ for Δ1λ. For a partition λ=(λ1,...,λl) and n≥λ1 we write(n,λ) for (n,λ1,λ2,...,λl). We consider sequences of Schur functions of the form {s(n,λ)}n≥λ1∈ΛN∣λ∣,1. Let α1,...,αk∈N and λ1,...,λk be number partitions. Then the sequence of products {s(n+α1,λ1)⋯s(n+αk,λk)}n is an element of ΛNα1+∣λ1∣+⋯αk+∣λk∣,k. We can apply difference operators Δ∣μ∣/kμ on it where ∣μ∣ is a multiple of k. Now, we are in position to formulate our main theorem.
Theorem 1.0**.**
Let α1≥α2≥α3≥≥0 and λ1,λ2,λ3 be number partitions. Then
(a)
[TABLE]
The set {Δ(2),Δ(1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
(b)
[TABLE]
[TABLE]
The set {Δ2(3,3),Δ(3),Δ(2,1),Δ(1,1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
There is experimental evidence that an analogous statement about fourfold products holds. We formulate this in the following conjecture. We do not provide a complete proof of this statement but show how our methods indicate its validity until reaching a point where the number of cases to discuss is massive.
Conjecture 1.0**.**
Let α1≥α2≥α3≥α4≥0 and λ1,λ2,λ3,λ4 be number partitions. Then
[TABLE]
[TABLE]
The multiset {Δ3(4,4,4),Δ2(3,3,2),Δ(4),Δ(3,1),Δ(2,2),Δ(2,2),Δ(2,1,1),Δ(2,1,1),Δ(1,1,1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
We show in Lemma 2.1 that every difference operator Δmλ is linear so that we can expand the theorem to a wider set of symmetric function sequences.
A sequence {fn}n∈ΛNn0,1 stabilizes at N∈N in the sense of Church and Farb [1] if
[TABLE]
We get the following corollary.
Corollary 1.0**.**
Let m1,m2,m3,N1,N2,N3∈N and {fn(1)}n,{fn(2)}n,{fn(3)}n be sequences such that {fn(i)}n∈ΛNmi,1 stabilizes at Ni for all i∈{1,2,3}. Then
(a)
[TABLE]
[TABLE]
The set {Δ(2),Δ(1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
(b)
[TABLE]
[TABLE]
The set {Δ2(3,3),Δ(3),Δ(2,1),Δ(1,1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
In the same way, Conjecture 1.0 is equivalent to the following statement.
Conjecture 1.0**.**
Let m1,...,m4,N1,...,N4∈N and {fn(1)}n,{fn(2)}n,{fn(3)}n,{fn(4)}n be sequences such that {fn(i)}n∈ΛNmi,1 stabilizes at Ni for all i∈{1,2,3,4}. Then
[TABLE]
[TABLE]
The multiset {Δ3(4,4,4),Δ2(3,3,2),Δ(4),Δ(3,1),Δ(2,2),Δ(2,2),Δ(2,1,1),Δ(2,1,1),Δ(1,1,1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
We formulate a statement about products of arbitrariely many stabilizing sequences as a question.
Question 1.0**.**
Let k≥1 and {fn(1)}n∈ΛNm1,1,...,{fn(k)}n∈ΛNmk,1 be stabilizing sequences. Let {λ1,...,λr} be the set of partitions of the numbers k,2k,...,(k−1)k. Is there a set of nonnegative integers {q1,...,qk−1} and a number N such that
[TABLE]
and q1+...+qk−1 is minimal with this property
and how can we compute the numbers q1,...,qr and N?
Let k≥1, α1≥⋯≥α4≥0 and μ1,…,μk be number partitions. We consider the sequence {s(n+α1,μ1)⋯s(n+αk,μk)}n∈ΛNα1+∣μ1∣+⋯+αk+∣μk∣,k. Let {λ1,...,λr} be the set of partitions of the numbers k,2k,...,(k−1)k. Is there a set of nonnegative integers {q1,...,qk−1} and a number N such that
[TABLE]
and q1+...+qk−1 is minimal with this property
and how can we compute the numbers q1,...,qr and N?
We show in the following lemma that the difference operators commute such that we are free to choose their order and that they are linear.
Lemma 2.1**.**
Let λ and μ be partitions, m a divisor of ∣λ∣ and l a divisor of ∣μ∣ with ∣μ∣/l=∣λ∣/m. Let n0≥0 and {fn}n∈ΛNn0,∣λ∣/m. Then
(i)
[TABLE]
(ii)
The map Δmλ:ΛNn0,∣λ∣/m→ΛNn0,∣λ∣/m is linear.
Proof.
(i)
We have
[TABLE]
[TABLE]
(ii) Δmλ is the difference of the shift operator {fn}n↦{fn+m}n which is linear and the map {fn}n↦{fn+λ}n which is a linear extension.
■
It follows from Lemma 2.1 (i) that we can define iterated products ∏Δ∈DΔ over sets of difference operators D={Δm1λ1,…,Δmrλr}.
Now, we prove Corollary 1.0 using Theorem 1.0 and Lemma 2.1 (ii).
Proof.
(a) The sequence {fn(i)}n∈ΔNmi,1 stabilizes at Ni for every i∈{1,2}. It follows that fn(i) is a linear combination of Schur functions s(n+αi,λi) with αi≥1−Ni and λi⊢mi−αi for all n≥Ni. Theorem 1.0 yields that
(b) The sequence {fn(i)}n∈ΔNmi,1 stabilizes at Ni for every i∈{1,2,3}. It follows that fn(i) is a linear combination of Schur functions s(n+αi,λi) with mi≥αi≥1−Ni and λi⊢mi−αi for all n≥Ni. Suppose α1≥α2≥α3. Theorem 1.0 yields that
We want to show next that we can restrict to products of homogeneous symmetric functions s(n) if we additionally multiply with a constant sequence.
Lemma 2.2**.**
Let k∈N and λ1,...,λm be number partitions of multiples of k.
If for all number partitions β and α1,...,αk−1∈N the sequence {s(n+α1)⋯s(n+αk−1)s(n)sβ}n∈ΛNα1+⋯+αk−1+∣β∣,k fulfills
[TABLE]
*for all n greater than some number n0(α1,...,αk−1,∣β∣) then
for all number partitions μ1,...,μk and α1,...,αk−1∈N the sequence
for all n>\max\{n_{0}(\alpha_{1}+i_{1},...,\alpha_{k}+i_{k},|\mu_{1}|-i_{1}+...+|\mu_{k}|-i_{k})~{}|~{}i_{q}\in\{0,...,l(\mu_{q})\}~{}\text{for all q\in{1,...,k}}\}.
Proof.
Let αk=0.
The Jacobi-Trudi identity yields
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where for γ∈{μ1,...,μk} the matrix Mγ,i is the matrix we get by deleting the ith column of
[TABLE]
The degree of ∏q=1kdet(Mμq,iq) is ∣μ1∣−i1+...+∣μk∣−ik. It follows from the assumption that this sequence
vanishes under Δn1λ1...Δnmλm for n>\max\{n_{0}(\alpha_{1}+i_{1},...,\alpha_{k}+i_{k},|\mu_{1}|-i_{1}+...+|\mu_{k}|-i_{k})~{}|~{}i_{q}\in\{0,...,l(\mu_{q})\}~{}\text{for all q\in{1,...,k}}\}.
■
It follows that to prove Theorem 1.0 it is sufficient to prove the following
Proposition 2.0**.**
Let α1,α2,α3∈N and β be a number partition.
(a)
The sequence {s(n+α1)s(n)sβ}n∈ΛNα1+∣β∣,2 fulfills
[TABLE]
(b)
The sequence {s(n+α1)s(n+α2)s(n)sβ}n∈ΛNα1+α2+∣β∣,3 fulfills
[TABLE]
[TABLE]
(c)
The sequence {s(n+α1)s(n+α2)s(n+α3)s(n)sβ}n∈ΛNα1+α2+α3+∣β∣,4 fulfills
[TABLE]
[TABLE]
For every symmetric function f and l∈N we write f≤l for the part of the Schur function decomposition of f with partitions of length less than or equal to l and f>l for the part of the Schur function decomposition with partitions of length greater than l.
Lemma 2.3**.**
Let k,n0,l∈N and {fn}n∈ΛNn0,k. Let λ1,...,λm be number partitions of multiples of k. Suppose
[TABLE]
Then
[TABLE]
Proof.
We have
[TABLE]
[TABLE]
We can write
[TABLE]
for a function gn with only partitions of length greater than l in its Schur function decomposition. It follows
[TABLE]
All partitions with length less than or equal to l appear in (∏i:l(λi)≤lΔ∣λi∣/kλi)(fn)≤l while all partitions with length greater than l appear in (∏i:l(λi)≤lΔ∣λi∣/kλi)gn+Δ∣λ1∣/kλ1...Δ∣λm∣/kλm(fn)>l and it follows that each of these two parts must itself be zero.
■
Consider a semistandard skew tableau T of shape ν/β and weight (n+α1,n+α2,...,n+αk). We split T into two parts: The part of the first β1 columns which we call the centre of T and denote it centre(T) and the rest which we call the arm of T and denote it arm(T). For example, let
[TABLE]
Then
[TABLE]
For fixed β and k, there are only finitely many tableaux appearing as centres of tableaux of shape ν/β for arbitrary ν and we denote this finite set by ck(β). We denote the set of semistandard Young tableaux of weight γ and arbitrary shape by ST(γ) and the number of occurences of the Symbol i in the tableau c∈ck(β) by c(i)
Lemma 2.4**.**
Let α1,...,αk∈N and β be a number partition. Then
[TABLE]
for all n∈N.
Proof.
We have
[TABLE]
where the sum runs over all semistandard skew tableau T′ of shape ν/β for any ν and weight (n+α1,n+α2,...,n+αk)
We can rewrite this sum by splitting every such skew tableau into its centre and arm:
[TABLE]
where the sum runs over all T∈ST((n+α1−c(1),...,n+αk−c(k))) such that T has as most as many rows as c has rows of length β1. Note that ∑Tsshape(T) is the part of s(n+α1−c(1))...s(n+αk−c(k)) with Schur functions with partitions with at most as many rows as c has rows of length β1.
■
The following lemma follows from the previous two lemmas.
Lemma 2.5**.**
Let k∈N and β be a number partition. Let λ1,...,λm be number partitions of multiples of k.
If for all numbers α1,...,αk∈N there is a number N(α1,...,αk) such that the sequence {s(n+α1)...s(n+αk)}∈ΛNα1+...+αk,k fulfills
[TABLE]
then the sequence {s(n+α1)...s(n+αk)sβ}∈ΛNα1+...+αk+∣β∣,k fulfills
[TABLE]
[TABLE]
This lemma shows that it is sufficient to prove the following proposition.
Proposition 2.0**.**
Let α1≥α2≥0.
(a)
The sequence {s(n+α1)s(n)}n∈ΛNα1,2 fulfills
[TABLE]
The set {Δ(2),Δ(1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
(b)
The sequence {s(n+α1)s(n+α2)s(n)}n∈ΛNα1+α2,3 fulfills
[TABLE]
[TABLE]
The set {Δ2(3,3),Δ(3),Δ(2,1),Δ(1,1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
We do not provide a complete proof of the following statement about fourfold products but show how our methods point to its validity until reaching a point where the number of cases to discuss is massive.
Conjecture 2.0**.**
Let α1≥α2≥α3≥0.
The sequence {s(n+α1)s(n+α2)s(n+α3)s(n)}n∈ΛNα1+α2+α3,4 fulfills
[TABLE]
[TABLE]
The multiset {Δ3(4,4,4),Δ2(3,3,2),Δ(4),Δ(3,1),Δ(2,2),Δ(2,2),Δ(2,1,1),Δ(2,1,1),Δ(1,1,1,1)} is minimal in the sense that the above sequence is not eventually zero if we remove one of the difference operators.
In the whole section n and α1≥α2≥α3 are natural numbers.
In the next lemmas, we use partial matrices of the form
[TABLE]
For every i∈{1,...,k−1}, we write ai for the ith row of a and ∣ai∣ for the sum of the entries of the ith row. Let k,n∈N and α=(α1,...,αk)∈N0k with α1≥...≥αk. Let Pk,n,α be the set of all partial matrices
a11a21⋮a(k−1),1ak,1a12a22a(k−1),2a13……a2,(k−1)a1k with real entries and
[TABLE]
[TABLE]
[TABLE]
or written as vector inequalities and equalities:
[TABLE]
[TABLE]
Pk,n,α is a convex polytope in R(2k+1). If M is a set of partial matrices we write MZ for its subset of partial matrices with only integer valued entries.
Proposition 3.0**.**
Let k,n∈N and α=(α1,...,αk)∈N0k with α1≥...≥αk. The polytope Pk,n,α is (2k)-dimensional.
Proof.
Pk,n,α is contained in the affine subspace defined by
[TABLE]
The above matrix has rank k. This implies that the affine subspace has dimension (2k+1)−k=(2k).
Otherwise, Pk,n,α contains the following (2k)+1 affine independent points. For every i∈{0,...,k−1} we construct min{1,i} points starting with
[TABLE]
We get the next point by moving n+αk diagonally left and down:
[TABLE]
Now, we move n+αk−1 and n+αk diagonally left and down:
[TABLE]
We go on moving the rightmost nonzero values diagonally left and down until getting the point
[TABLE]
We constructed 1+1+2+⋯(k−1)=(2k)+1 affine independent points lying in Pk,n,α.
■
Lemma 3.1**.**
Let k,n∈N and α=(α1,...,αk)∈N0k with α1≥...≥αk. Then
[TABLE]
Proof.
The product ∏i=1ks(n+αi) is the homogeneous symmetric function h(n+α1,...,n+αk). It follows from the transition matrix between the basis of Schur functions and the basis of homogeneous symmetric functions that h(n+α1,...,n+αk) is the sum ∑Tsshape(T) running over all semistandard Young tableaux T of weight (n+α1,...,n+αk). For every such tableau T let ai,j(T) be the number of (i+j−1)’s in the ith row. Then the map given by
[TABLE]
is a bijection between the semistandard Young tableaux T of weight (n+α1,...,n+αk) and Pk,n,αZ.
■
Lemma 3.2**.**
Let k≥1 and α=(α1,...,αk)∈N0k with α1≥...≥αk. We consider the sequence {∏i=1ks(n+αi)}n∈ΛN∣α∣,k. For all n≥1, we have
[TABLE]
[TABLE]
Proof.
It follows from the previous lemma that
[TABLE]
There is an injection Pk,n−1,αZ→Pk,n,αZ given by
[TABLE]
The matrices that are not hit by this map are those with a [math] in the first column. This property is equivalent to ak,1=0 because of 0≤ak,1≤ak−1,1≤...≤a11.
■
We look at the polytope Δ(1k)Pk,n,α:={A∈Pk,n,α:ak,1=0}.
Proposition 3.0**.**
Let k≥1 and α=(α1,...,αk)∈N0k with α1≥...≥αk. Δ(1k)Pk,n,α is a facet of Pk,n,α.
Proof.
Δ(1k)Pk,n,α is a proper face of Pk,n,α because of ak,1=0 for all A∈Δ(1k)Pk,n,α but not for every A∈Pk,n,α and ak,1≥0 for all A∈Pk,n,α. This face is ((2k)−1)-dimensional because the set of (2k)+1 many affine independent points of Pk,n,α given in the proof of Proposition 3.0 contains exactly one point that does not lie in Δ(1k)Pk,n,α.
■
Lemma 3.3**.**
Let k≥1 and α=(α1,...,αk)∈N0k with α1≥...≥αk. We consider the sequence {∏i=1ks(n+αi)}n∈ΛN∣α∣,k. For all n≥2, we have
There is an injective map {A∈Pk,n−1,αZ:ak,1=0}↦{A∈Pk,n,αZ:ak,1=0} given by
[TABLE]
The matrices that are not hit are those with
ai1=0 for a 1≤i≤k−1 or a1k=0. We can reduce the condition to a1k=0 or ak−1,1=0 because of 0≤ak−1,1≤ak−2,1≤...≤a11.
■
Let Δ(2,1k−2)Δ(1k)Pk,n,α={A∈Δ(1k)Pk,n,α:a1k=0∨ak−1,1=0}.
Proposition 3.0**.**
Let k≥1 and α=(α1,...,αk)∈N0k with α1≥...≥αk. Δ(2,1k−2)Δ(1k)Pk,n,α is the union of the two facets {A∈Δ(1k)Pk,n,α:a1,k=0} and {A∈Δ(1k)Pk,n,α:ak−1,1=0} of Δ(1k)Pk,n,α.
Proof.
The two sets are proper subsets of Δ(1k)Pk,n,α and faces because of a1,k≥0 and ak−1,1≥0 for all A∈Δ(1k)Pk,n,α. {A∈Δ(1k)Pk,n,α:ak−1,1=0} is a facet of Δ(1k)Pk,n,α because the set of (2k)+1 many affine independent points of Pk,n,α given in the proof of Proposition 3.0 contains exactly two points with ak−1,1>0. For {A∈Δ(1k)Pk,n,α:a1,k=0} we slightly modify the list of affine independent points given in the proof of Proposition 3.0. For every i∈{2,...,k−2} we take the i points
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
We additionally take the k−1 points
[TABLE]
and
[TABLE]
These are 2+3+...+(k−2)+(k−1)=(2k)−1 many affine independent points.
■
We want to apply the map Δ(3) next. We treat the two sets Qn,21={A∈P3,n−1,αZ∣a31=0∧a21=0} and Qn,13={A∈P3,n−1,αZ∣a31=0∧a13=0∧a21>0} separately.
There is an injection Qn−1,21→Qn,21 given by
[TABLE]
The only matrix that is not hit by this map is
n+α100n+α2n0. It follows
[TABLE]
[TABLE]
We have
[TABLE]
It follows that for every B∈Qn−1,13 there is exactly one A∈Qn,13 with (∣a1∣,∣a2∣)=(∣b1∣+3,∣b2∣). It is the matrix A with a21=b21−1. There is one matrix in Qn−1,13 and one or two matrices in Qn,13 not involved in this correspondence depending on the parity of n+∣α∣. These matrices are
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Now in
Δ(3)Δ(2,1)Δ(1,1,1)(s(n+α1)s(n+α2)s(n)), the Schur function s(2n+∣α∣,n) from before is subtracted and what is left is
[TABLE]
[TABLE]
Applying Δ2(3,3) to this yields [math].
We show the minimality of the set {Δ2(3,3),Δ(3),Δ(2,1),Δ(13)} next. We see above that Δ(3)Δ(2,1)Δ(1,1,1)(s(n+α1)s(n+α2)s(n)) is not zero. The term Δ2(3,3)Δ(3)Δ(2,1)(s(n+α1)s(n+α2)s(n)) is not zero because the summand s(n+α1,n+α2,n) in the Schur function expansion of s(n+α1)s(n+α2)s(n) is not cancelled by Δ(3) or Δ(2,1) because ∣a1∣≥n−1+α2 for all A∈P3,n−1,αZ and it is not cancelled by Δ2(3,3) because ∣a1∣≥n−2+α2 for all A∈P3,n−2,αZ. The term Δ2(3,3)Δ(2,1)Δ(13)(s(n+α1)s(n+α2)s(n)) is not zero because the summand s(3n+∣α∣) in the Schur function expansion of s(n+α1)s(n+α2)s(n) is not cancelled. In order to show that the term Δ2(3,3)Δ(3)Δ(13)(s(n+α1)s(n+α2)s(n)) is not zero we show that the multiplicity of s(2n+∣α∣,n) in its Schur function decomposition is not zero. We denote the multiplicity of a Schur function sλ in a symmetric function f by mult(λ,f). Now, we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The four involved numbers count in this order the number of matrices in Δ(14)P4,n,αZ of the form
[TABLE]
[TABLE]
[TABLE]
[TABLE]
It follows
[TABLE]
[TABLE]
■
The next lemmas are dedicated to the statement Conjecture 2.0 about fourfold products.
There is an injective map Δ(2,1,1)Δ(14)P4,n−1,αZ→Δ(2,1,1)Δ(14)P4,n,αZ given by
[TABLE]
The matrices that are not hit are those with a13=0∨a21=0∨a32=0∨a31=a21∨a21+a22+a23=a11+a12+a13. a21=0 implies a31=a21 because of 0≤a31≤a21.
■
Let (Δ(2,1,1))2Δ(14)P4,n,α:={A∈Δ(2,1,1)Δ(14)P4,n,α:a13=0∨a32=0∨a31=a21∨a21+a22+a23=a11+a12+a13}. We know so far that
[TABLE]
is a sequence of unions of faces of P4,n,α with corresponding dimensions
[TABLE]
where we say that the dimension of a union of polytopes is the maximum of the dimensions of the polytopes.
Here, we have again that the subset (Δ(2,1,1))2Δ(14)P4,n,α⊆Δ(2,1,1)Δ(14)P4,n,α is a union of faces. Its dimension is 3 because the face
{A∈P4,n,α:a41=a14=a13=0}⊆(Δ(2,1,1))2Δ(14)P4,n,α contains the 4 affine independent points
[TABLE]
[TABLE]
Lemma 3.5**.**
We have
[TABLE]
[TABLE]
Proof.
There is an injection (Δ(2,1,1))2Δ(14)P4,n−1,αZ→(Δ(2,1,1))2Δ(14)P4,n,αZ given by
[TABLE]
The matrices that are not hit are those with a12=0 or a22=0 or a23=0 or a21+a22=a11+a12 or a31+a32=a21+a22.
■
Let Δ(2,2)(Δ(2,1,1))2Δ(14)P4,n,α:={A∈(Δ(2,1,1))2Δ(14)P4,n,α:a12=0∨a22=0∨a23=0∨a21+a22=a11+a12∨a31+a32=a21+a22}. The face {A∈P4,n,α:a41=a14=a13=a23=0}⊆Δ(2,2)(Δ(2,1,1))2Δ(14)P4,n,α has dimension 2 because it contains the 3 affine independent points
[TABLE]
[TABLE]
We summarize that
[TABLE]
is a sequence of unions of faces of P4,n,α with corresponding dimensions
[TABLE]
Bibliography2
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] T. Church, B. Farb, Representation theory and homological stability, Advances in Mathematics 245 (2013) 250–314
2[2] I.G. Macdonald, Symmetric Functions and Hall Polynomials, 2. ed., Clarendon Press, Oxford, 1995