Tight Cylindric Partitions

• Tight cylindric partitions are a subclass where no integer appears in every row, thus refining the standard cylindric partition model.
• Their generating functions exactly match the principal specializations of 𝔰𝔩₍ᵣ₎ characters, eliminating extra enumeration factors seen in ordinary models.
• They admit combinatorial realizations through abaci, DHK partitions, and multisum recurrences, linking them to Rogers–Ramanujan-type identities and affine algebra representations.

Tight cylindric partitions are cylindric partitions subject to an additional exclusion condition: for every integer $j \ge 1$, there exists at least one row in which the part $j$ does not occur. Equivalently, no part value is present in all rows simultaneously. For a profile $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$ of rank $r\ge 2$ and level $\ell=c_1+\cdots+c_r$, the tight class $T_c$ refines the ordinary cylindric partition class $C_c$, and its bivariate generating function $T_c(z,q)$ records the maximum part and the total weight. In the modern formulation, tight cylindric partitions are characterized by exact principal specializations of $\mathfrak{sl}_r$-characters, while earlier work on cylindric plane partitions and cylindric partitions supplied the product formulas, $(q,t)$-weights, path models, asymptotics, and partition-analysis methods from which the tight theory emerged (Kanade et al., 20 Aug 2025, Langer, 2012).

1. Definitions, profiles, and basic statistics

Fix $j$0 and a profile $j$1 with level $j$2. A cylindric partition of profile $j$3 is an $j$4-tuple of partitions $j$5 satisfying the periodic dominance conditions

$j$6

together with the wrap-around condition

$j$7

Parts beyond the length of a partition are regarded as $j$8. The rank is $j$9, the level is $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$0, the largest part is $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$1, and the weight is

$c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$2

The associated dominant integral highest weight for $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$3 is

$c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$4

A cylindric partition is tight if for every integer $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$5 there exists at least one row $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$6 such that $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$7 does not occur as a part of $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$8. The set of all cylindric partitions of profile $c=(c_1,\dots,c_r)\in \mathbb Z_{\ge 0}^r$9 is denoted $r\ge 2$0, and the tight subset is denoted $r\ge 2$1. The bivariate generating functions are

$r\ge 2$2

The literature summarized here uses several profile formalisms. In the cylindric plane partition framework, one fixes a binary string $r\ge 2$3 and studies periodic interlacing sequences $r\ge 2$4 with $r\ge 2$5. In the asymptotic framework, one fixes a sign profile $r\ge 2$6 with $r\ge 2$7. A plausible implication is that the subject is organized around several equivalent periodic-interlacing encodings, each optimized for a different problem: exact products, asymptotics, or representation-theoretic interpretation.

2. Earlier cylindric models and the emergence of tightness

Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. For a binary profile $r\ge 2$8, a cylindric plane partition is a periodic interlacing sequence

$r\ge 2$9

such that for each $\ell=c_1+\cdots+c_r$0,

• if $\ell=c_1+\cdots+c_r$1, then $\ell=c_1+\cdots+c_r$2 is a horizontal strip;
• if $\ell=c_1+\cdots+c_r$3, then $\ell=c_1+\cdots+c_r$4 is a horizontal strip.

The weight is

$\ell=c_1+\cdots+c_r$5

This framework also has a non-intersecting lattice-path model on a cylinder, with a precise bijection between cylindric plane partitions and path families.

In this earlier setting, the paper does not define “tight” explicitly. The closest notion is the “minimal family of non-intersecting lattice paths.” In the path model, paths live on a triangular lattice wrapped on a cylinder of period $\ell=c_1+\cdots+c_r$6, and a minimal family is intended to have no extraneous vertical gaps between paths beyond those forced by non-intersection. The summary further states that, in the literature intuition, “tight” often means configurations minimizing gaps, and a natural specialization is obtained by fixing an alternating profile $\ell=c_1+\cdots+c_r$7, such as

$\ell=c_1+\cdots+c_r$8

and imposing minimal vertical spacing between paths at each $\ell=c_1+\cdots+c_r$9, so that all surface cubes have level $T_c$0. Under these constraints, the family is “tight” in the sense of minimal separation; locally, steps alternate, eliminating $T_c$1 patterns. In terms of the interlacing sequence, this corresponds to alternately adding and removing horizontal strips, forcing the thinnest possible evolution (Langer, 2012).

This interpretation yields a concrete small case. For $T_c$2 and $T_c$3, the Schur specialization gives

$T_c$4

the ordinary partition generating function. In the Hall–Littlewood specialization $T_c$5, tightness forces only arm-length-zero, level-$T_c$6 peak/valley contributions to remain. This does not yet constitute the modern definition of tight cylindric partitions, but it isolates the minimal-gap geometry that the later theory formalizes.

3. Character identities and product formulas

The defining structural feature of tight cylindric partitions is the disappearance of the extra factor that occurs for ordinary cylindric partitions. It is well known that

$T_c$7

where $T_c$8 denotes principal specialization. By contrast, tight cylindric partitions satisfy the exact identity

$T_c$9

Thus the tight class matches the principal specialization with no extra factor.

Let $C_c$0 and $C_c$1. The univariate generating function has the periodic product form

$C_c$2

For two rows, with $C_c$3, this specializes to

$C_c$4

The paper states that this is “$C_c$5 times” the Gordon–Andrews/Andrews–Bressoud product, depending on the parity of $C_c$6 (Kanade et al., 20 Aug 2025).

This product-theoretic perspective aligns the tight subclass directly with affine-character combinatorics. It also clarifies the contrast with ordinary cylindric partitions: the tight condition removes precisely the global overcount responsible for the factor $C_c$7.

4. Functional equations and explicit two-row formulas

For general rank $C_c$8, define

$C_c$9

For any nonempty subset $T_c(z,q)$0, let $T_c(z,q)$1 be the composition determined by

$T_c(z,q)$2

with $T_c(z,q)$3 and indices modulo $T_c(z,q)$4. The tight analog of the Corteel–Welsh recurrences is

$T_c(z,q)$5

The term

$T_c(z,q)$6

accounts for partitions whose maximum appears in the first position of all $T_c(z,q)$7 rows and is later deleted; the right-hand side is an inclusion–exclusion sum over “addboxes” operations.

For two rows, one obtains “diamond relations.” If $T_c(z,q)$8, then

$T_c(z,q)$9

There is also a recurrence without inclusion–exclusion: $\mathfrak{sl}_r$0

These recurrences are solved explicitly in the two-row case. For $\mathfrak{sl}_r$1,

$\mathfrak{sl}_r$2

equals each of the following multisums.

First, in terms of independent $\mathfrak{sl}_r$3, with $\mathfrak{sl}_r$4,

$\mathfrak{sl}_r$5

Second, in terms of nonincreasing $\mathfrak{sl}_r$6,

$\mathfrak{sl}_r$7

At $\mathfrak{sl}_r$8, these specialize to known parity refinements of Andrews–Gordon and Andrews–Bressoud multisums, up to the standard $\mathfrak{sl}_r$9-dilation noted in the paper. For level $(q,t)$0, more generally,

$(q,t)$1

and for $(q,t)$2 this begins

$(q,t)$3

(Kanade et al., 20 Aug 2025).

5. Combinatorial realizations: paths, abaci, DHK partitions, and partition analysis

The tight condition has several combinatorial realizations. In the cylindric plane partition model, the $(q,t)$4-Macdonald weight can be expressed plethystically as

$(q,t)$5

where

$(q,t)$6

Here “peak” means a local $(q,t)$7 pattern, “valley” means $(q,t)$8, the leg length is the level in the path model, and the arm length counts inversion gaps. Under the tight specialization described in that paper—alternating profile and minimal vertical separation—every surface cube has level $(q,t)$9, and the weight simplifies because all contributing peaks and valleys occur at level $j$00 and with minimal arm lengths (Langer, 2012).

In the dedicated tight theory for two rows, the relevant combinatorial model is the 2-string abacus. A 2-string abacus of type $j$01 has yoked pairs of beads, and a yoke has shape $j$02 if the top bead is $j$03 positions to the right of the bottom bead. Tightness means that no yoke can be shifted further left; equivalently, yokes are as close together as possible. There is a bijection between 2-rowed cylindric partitions of profile $j$04 and 2-string abaci of type $j$05, and tight cylindric partitions correspond exactly to tight abaci.

The same two-row tight objects are also in bijection with the colored partitions studied by Dousse, Hardiman, and Konan. A DHK partition of type $j$06 is a weakly decreasing colored sequence

$j$07

with colors $j$08 satisfying

$j$09

with the final $j$10 colored $j$11 and exactly one part equal to $j$12. If

$j$13

then the same recurrence as for the two-row tight generating function implies

$j$14

At $j$15,

$j$16

(Kanade et al., 20 Aug 2025).

A distinct but related two-row approach is MacMahon’s partition analysis. For $j$17 and $j$18, a cylindric partition is a pair of weakly decreasing rows $j$19 and $j$20 with inter-row inequalities of the form

$j$21

That paper does not define “tight cylindric partitions” explicitly. Instead, it states that in the literature “tightness” typically refers to saturating the difference or interlacing constraints, and that within the partition-analysis framework tightness can be imposed by replacing weak inequalities by equalities or fixed minimal differences. The $j$22-operator elimination rules remain available; for example,

$j$23

The paper develops explicit generating functions for ordinary two-row cylindric partitions, including

$j$24

and states that the same pipeline should apply after imposing equality or fixed-difference constraints (Li et al., 31 Jan 2025).

6. Asymptotics, profile dependence, and special cases

For ordinary cylindric partitions of width $j$25 and sign profile $j$26 with $j$27, let

$j$28

Borodin’s product formula may then be written

$j$29

If

$j$30

then, under the nontriviality condition $j$31,

$j$32

where

$j$33

The paper emphasizes that, unlike skew plane partitions of fixed width, the asymptotic order for cylindric partitions depends on the profile $j$34, not only on the width $j$35. Both the exponential rate and the leading constant vary with $j$36 (Han et al., 2017).

This profile sensitivity is relevant to the tight theory even though the asymptotic paper concerns ordinary rather than tight cylindric partitions. A plausible implication is that asymptotics for tight subclasses should also retain detailed profile dependence rather than collapsing to a width-only invariant.

Several special cases clarify the geometry. In the Schur specialization of the $j$37-enumeration, the product reduces to Borodin’s formula. In the Hall–Littlewood specialization $j$38, only arm-length-zero contributions survive in the plethystic weight. For reverse plane partitions, obtained by imposing $j$39, one recovers Okada’s product

$j$40

For alternating profile in the tight-path sense, the $j$41 Schur case again collapses to the ordinary partition product (Langer, 2012).

The recent theory also records concrete tight examples. For the two-row tight profile $j$42,

$j$43

is tight, with

$j$44

so its contribution to $j$45 is $j$46. The associated tight abacus has yokes of shapes $j$47, and its cumulative-left-vacancy data yields the corresponding DHK partition after reversing (Kanade et al., 20 Aug 2025).

7. Conceptual significance and open directions

Tight cylindric partitions sit at the intersection of three strands of the literature. The first is the exact enumeration of cylindric plane partitions via product formulas, $j$48-vertex operators, and lattice-path models. The second is the asymptotic theory of cylindric partitions, where profile dependence is visible both in the exponential rate and in the Gamma-product leading constant. The third is the two-row finite-$j$49 theory, where MacMahon partition analysis, Rogers–Ramanujan-type identities, Andrews–Gordon and Bressoud refinements, and Bailey-type hierarchies emerge from explicit recurrences and alternating $j$50-binomial sums.

The 2025 tight theory isolates a class for which the representation-theoretic meaning is especially clean: $j$51 is exactly the principal specialization of the $j$52-character. In two rows, the theory simultaneously admits functional equations, multisum closed forms, an abacus realization, and a bijection with DHK colored partitions. This positions tight cylindric partitions as a sharpened version of cylindric partition combinatorics in which the global overlap of equal parts across all rows is forbidden rather than merely weighted away.

The open directions stated in the literature include a direct proof of the two-row closed forms independent of the $j$53-difference telescoping method, extension of bivariate analyses to tight $j$54-rowed cases with $j$55, explicit bijections between tight cylindric partitions and Kleshchev multipartitions for $j$56 in Rogers–Ramanujan-type identities, investigation of unimodality phenomena for the $j$57-coefficients of both tight and ordinary cylindric generating functions, clarification of the representation-theoretic meaning of the maximum-part statistic, and analogs of results such as Gessel–Krattenthaler determinantal formulas for the tight setting (Kanade et al., 20 Aug 2025).

These directions are closely aligned with the methods already present in the surrounding literature. The partition-analysis paper states that equality or fixed-difference constraints can be encoded directly in the crude generating function and then treated by the same $j$58-elimination machinery, suggesting a systematic route toward tight two-row generating functions and further Bailey-generated hierarchies (Li et al., 31 Jan 2025).