Stanley Length in Permutations and Modules

• Stanley length is defined in probabilistic combinatorics as the length of the largest alternating subsequence of a random permutation, with linear mean, variance, and a Gaussian limit.
• In commutative algebra, Stanley length denotes the minimal number of Stanley spaces in a decomposition of a multigraded module, acting as a quantity invariant distinct from Stanley depth.
• Structural results link Stanley length with properties such as linear quotients and provide actionable bounds in monomial ideal theory and squarefree settings.

Stanley length is a term used in more than one mathematical sense. In probabilistic combinatorics, it denotes the length of the largest alternating subsequence of a uniformly random permutation, a statistic attached to Richard Stanley’s work on alternating subsequences and later discussed under the ironic label “Stanley distribution” (Ekhad, 2010). In commutative algebra, a 2025 paper introduced Stanley length as a new invariant of a finitely generated multigraded module, defined as the minimal number of Stanley spaces in a Stanley decomposition and denoted $\operatorname{slength}(M)$ (Cimpoeas, 23 Jul 2025). Earlier commutative-algebra papers also used “length-type” language for Stanley decompositions in a different way, namely for the parameter $\min_i |Z_i|$ that leads to Stanley depth rather than to the number of summands (Cimpoeas, 2015).

1. Terminological scope

The expression has no single universal meaning across the literature. The main uses represented in current arXiv work are summarized below.

Context	Object	Definition
Random permutations	$X_n$	Length of the largest alternating subsequence of a random permutation
Multigraded modules	$\operatorname{slength}(M)$	Minimal number of Stanley spaces in a Stanley decomposition
Older commutative-algebra usage	“length-type” parameter	Usually $\min_i |Z_i|$, hence Stanley depth

In the probabilistic setting, the term refers to a concrete random variable on $\mathfrak S_n$. In the algebraic setting, it is an invariant built from all possible Stanley decompositions of a module. This suggests that context is indispensable: without it, “Stanley length” can denote either a subsequence statistic or a decomposition invariant.

2. The random-permutation meaning

Let $\mathfrak S_n$ be the set of permutations of $\{1,2,\dots,n\}$ with the uniform distribution. For $\pi \in \mathfrak S_n$, an alternating, or up–down, subsequence is a subsequence

$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$

whose inequalities alternate in direction. In the convention used in "A Note on the Stanley Distribution" (Ekhad, 2010), the alternation starts with “up”: $\min_i |Z_i|$0 Any fixed choice of starting with $\min_i |Z_i|$1 or $\min_i |Z_i|$2 leads to an equivalent asymptotic theory.

The corresponding Stanley length is the random variable

$\min_i |Z_i|$3

For $\min_i |Z_i|$4, Stanley’s analysis yields exact formulas for the expectation and variance: $\min_i |Z_i|$5 With the normalization

$\min_i |Z_i|$6

one has convergence in distribution

$\min_i |Z_i|$7

as $\min_i |Z_i|$8. Equivalently, the raw moments

$\min_i |Z_i|$9

converge to the moments of the standard normal law: $X_n$0

This probabilistic Stanley length is therefore a permutation statistic with linear mean, linear variance, and Gaussian limit. In the note’s terminology, the limiting law of the standardized variable is the “Stanley distribution,” though the note explicitly presents that phrase with intended irony (Ekhad, 2010).

3. Refined asymptotics and probabilistic interpretation

The main refinement in Ekhad’s note is an explicit asymptotic expansion for the standardized moments of $X_n$1 (Ekhad, 2010). For each integer $X_n$2, the even moments satisfy

$X_n$3

Thus the Gaussian value $X_n$4 is approached with an explicit first-order correction of order $X_n$5.

For odd moments, the paper gives an expression with explicit leading constants and higher corrections, but the typed display is noted to be somewhat garbled. The structural content is clear: the leading term is of order $X_n$6, the next correction is of order $X_n$7, and overall

$X_n$8

In summary,

$X_n$9

Methodologically, the note sits on top of Stanley’s explicit bivariate generating function

$\operatorname{slength}(M)$0

where $\operatorname{slength}(M)$1 counts permutations of $\operatorname{slength}(M)$2 whose largest alternating subsequence has length $\operatorname{slength}(M)$3. Differentiation in $\operatorname{slength}(M)$4 yields generating functions for moments,

$\operatorname{slength}(M)$5

Stanley’s asymptotic normality uses the Pemantle–Wilf generic normality theorem, while Ekhad’s refinements are produced with Zeilberger’s Maple package HISTABRUT, which automates coefficient asymptotics and the re-normalization needed for standardized moments. The note states that these formulas are not presented with full rigorous proofs but are “certainly rigorizable.”

A comparison emphasized in the note is with the longest increasing subsequence of a random permutation. For LIS, the Baik–Deift–Johansson theorem gives a Tracy–Widom limit, whereas the largest alternating subsequence has a Gaussian limit (Ekhad, 2010). This places the probabilistic Stanley length in a markedly different universality class from LIS.

4. Stanley length as an invariant of multigraded modules

A distinct definition appears in "On the Stanley length of monomial ideals" (Cimpoeas, 23 Jul 2025). Let

$\operatorname{slength}(M)$6

with its standard $\operatorname{slength}(M)$7-grading, and let $\operatorname{slength}(M)$8 be a finitely generated multigraded $\operatorname{slength}(M)$9-module. A Stanley space of $\min_i |Z_i|$0 is a submodule of the form

$\min_i |Z_i|$1

where $\min_i |Z_i|$2 is homogeneous, $\min_i |Z_i|$3, and $\min_i |Z_i|$4 is a free $\min_i |Z_i|$5-module. A Stanley decomposition is a direct sum

$\min_i |Z_i|$6

For such a decomposition, the paper distinguishes two numerical parameters: $\min_i |Z_i|$7 The Stanley depth of $\min_i |Z_i|$8 is the familiar maximal value of $\min_i |Z_i|$9, while the new invariant is

$\mathfrak S_n$0

The paper explicitly describes the contrast as follows: $\mathfrak S_n$1 is a “quality” invariant, whereas $\mathfrak S_n$2 is a “quantity” invariant. A decomposition realizing one need not realize the other.

Several structural properties are established for $\mathfrak S_n$3. If

$\mathfrak S_n$4

is a short exact sequence of finitely generated multigraded modules, then

$\mathfrak S_n$5

For a monomial $\mathfrak S_n$6 and a monomial ideal $\mathfrak S_n$7,

$\mathfrak S_n$8

For a monomial ideal $\mathfrak S_n$9 and a monomial $\mathfrak S_n$0,

$\mathfrak S_n$1

with equality if $\mathfrak S_n$2. Ring extension by a new variable does not change Stanley length: $\mathfrak S_n$3

For monomial ideals $\mathfrak S_n$4, if

$\mathfrak S_n$5

then the paper proves

$\mathfrak S_n$6

$\mathfrak S_n$7

$\mathfrak S_n$8

and

$\mathfrak S_n$9

The most basic lower bound is generator-counting. For any monomial ideal $\{1,2,\dots,n\}$0,

$\{1,2,\dots,n\}$1

where $\{1,2,\dots,n\}$2 is the minimal monomial generating set. In particular,

$\{1,2,\dots,n\}$3

If $\{1,2,\dots,n\}$4 is principal, then

$\{1,2,\dots,n\}$5

The paper also gives an explicit two-variable formula. If

$\{1,2,\dots,n\}$6

with

$\{1,2,\dots,n\}$7

then

$\{1,2,\dots,n\}$8

Finally, a general upper bound is obtained from Janet decomposition. Writing

$\{1,2,\dots,n\}$9

one has

$\pi \in \mathfrak S_n$0

5. Linear quotients, squarefree interpretations, and structural results

One of the sharpest results in the 2025 framework concerns ideals with linear quotients (Cimpoeas, 23 Jul 2025). A monomial ideal $\pi \in \mathfrak S_n$1 has linear quotients if its minimal generators can be ordered

$\pi \in \mathfrak S_n$2

so that each colon ideal

$\pi \in \mathfrak S_n$3

is generated by variables. In that situation, there is a canonical Stanley decomposition

$\pi \in \mathfrak S_n$4

and therefore

$\pi \in \mathfrak S_n$5

Thus linear quotients imply minimal possible Stanley length.

The paper also proves a characterization via partial ideals. If $\pi \in \mathfrak S_n$6 is minimally generated by $\pi \in \mathfrak S_n$7, then the following are equivalent: there exists an order $\pi \in \mathfrak S_n$8 giving linear quotients, and for each $\pi \in \mathfrak S_n$9 the partial ideal

$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$0

admits a Stanley decomposition

$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$1

This gives a stepwise interpretation of minimal-length decompositions.

The converse “$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$2 implies linear quotients” is only partially valid. It holds when $$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$3, and it also holds for monomial ideals in two variables. It fails in general: the paper gives the counterexample

$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$4

for which

$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$5

but $$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$6 does not have linear quotients.

In the squarefree setting, Stanley length admits a simplicial-combinatorial interpretation. For squarefree monomial ideals $$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$7, let

$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$8

be the associated relative simplicial complex. If

$$\pi_{i_1},\pi_{i_2},\dots,\pi_{i_k}\qquad (1\le i_1<\cdots<i_k\le n)$$9

is an interval partition, define $\min_i |Z_i|$00. Then

$\min_i |Z_i|$01

Consequences include the trivial upper bound

$\min_i |Z_i|$02

and the lower bound that $\min_i |Z_i|$03 is at least the number of facets of $\min_i |Z_i|$04.

The squarefree theory also interacts well with standard operations. Polarization cannot increase Stanley length: $\min_i |Z_i|$05 and passing to radicals cannot increase it: $\min_i |Z_i|$06 For symbolic powers of squarefree ideals,

$\min_i |Z_i|$07

6. Relation to Stanley depth and earlier commutative-algebra usage

Before $\min_i |Z_i|$08 was introduced as a separate invariant, commutative-algebra papers usually attached the word “length” to Stanley decompositions in a different way. For a decomposition

$\min_i |Z_i|$09

the natural “length-type” parameter was

$\min_i |Z_i|$10

and the corresponding module invariant was

$\min_i |Z_i|$11

One paper states explicitly that this is “not usually called ‘Stanley length’ in the literature,” but that it is the basic size parameter of a decomposition (Cimpoeas, 2015). Other papers likewise refer to Stanley depth as “Stanley length” in an older or alternative terminology (Shen, 2014).

This older usage is visible in explicit families. For the path ideal $\min_i |Z_i|$12 of length $\min_i |Z_i|$13 in the line graph $\min_i |Z_i|$14, one has

$\min_i |Z_i|$15

for all $\min_i |Z_i|$16 (Cimpoeas, 2015). In the same older framework, quotients of complete intersection monomial ideals satisfy sharp lower and upper bounds for Stanley depth, and in important cases exact formulas, again treating $\min_i |Z_i|$17 as the relevant Stanley-type length parameter (Cimpoeas, 2012).

The modern 2025 invariant therefore does not replace Stanley depth; it complements it. The distinction is sharp: $\min_i |Z_i|$18 whereas

$\min_i |Z_i|$19

This terminological split suggests a stable conceptual division. In current usage, Stanley length either denotes the permutation statistic $\min_i |Z_i|$20 of alternating subsequences (Ekhad, 2010) or the summand-count invariant $\min_i |Z_i|$21 (Cimpoeas, 23 Jul 2025), while older commutative-algebra usage often employed the phrase informally for Stanley depth or for the size parameter $\min_i |Z_i|$22 attached to a decomposition (Cimpoeas, 2015).