WorksMathematics
Two families of Young tableaux with periodic walls: Counting formulas and differential transcendence
Abstract
Banderier, Marchal, and Wallner studied the enumeration problem for Young tableaux with walls. These are similar to standard Young tableaux, except that local decreases are allowed at some walls. In 2021, Banderier and Wallner counted Young tableaux with periodic walls, in which the elementary blocks are Young diagrams of shape . They obtained exact counting formulas for of the classes up to symmetry. In this paper, we first derive recurrences for counting the remaining two classes of Young tableaux with periodic walls. We then prove that their counting exponential generating functions are differentially transcendental. Consequently, they are neither D-algebraic nor D-finite. This disproves a conjecture of Banderier and Wallner.
2020 Mathematics subject classification: Primary 05A15; Secondary 06A07, 34M15.
Introduction
Banderier, Marchal, and Wallner [1, 2] considered a variation of standard Young tableaux, called Young tableaux with walls. It is very difficult to find a counting formula for such Young tableaux. We now introduce the necessary definitions.
Let be a partition of , denoted . The Young diagram of is obtained by drawing a collection of left-justified arrays of cells, where row has cells reading from bottom to top. We also denoted the Young diagram of by . A standard Young tableau of is an assignment of to the cells of the Young diagram, each number appearing once, such that rows are increasing from left to right, and columns are increasing from bottom to top. We refer to [12 Section 1.7] for details of these definitions.
A Young building of shape is a pair , where is a subset of the edges of Young diagram of . The elements of are called walls. A Young tableau with walls over is a filling of the cells of by labels , such that each label appears exactly once and the labels are increasing along each row and column (conditions for standard Young tableaux), but two labels separated by a wall in need not be increasing. Denote by (or ) the set of all such tableaux. It reduces to the set of standard Young tableaux of shape when is empty. See Figure 1 for an example of Young tableaux with walls of shape in . The walls in are depicted as bold red edges.
Figure 1. A Young building and a Young tableau with walls.
Banderier, Marchal, and Wallner [1] studied the enumeration of certain rectangular Young tableaux with walls using density methods and bijections. Through the enumeration of two classes of Young tableaux with walls, Lin et al. [5] proved the well-known tree-child network conjecture of Pons and Batle [9]. The solution of this conjecture was facilitated by the connection established by Chang et al. [4 Remark 3.3] between tree-child networks and Young tableaux with walls.
Banderier and Wallner [2] considered Young tableaux with periodic walls and obtained several counting formulas. By employing the kernel method and the lattice path enumeration theory, Liu and Xin [7] obtained the generating function for a class of two-row Young tableaux with periodic walls.
Let be a building of rectangular shape. Define to be the Young building formed by connecting blocks of horizontally. Then Young tableaux with walls over are called Young tableaux with periodic walls. Let denote the set of all such tableaux. Note that is allowed to contain the rightmost edges of . Figure 2 illustrates a Young building on the left and a Young building with periodic walls on the right.
Figure 2. A Young building (denoted by ) on the left and a Young building with periodic walls on the right.
Banderier and Wallner [2] counted Young tableaux with periodic walls by the density method and bijection with binary trees. Let . They considered a classification of periodic shapes (a total of different models). In other words, there are 64 distinct sets . Two of them are shown in Figure 2 and Figure 3. From the perspective of counting , there are actually 32 models in total by symmetry. Based on their counting formulas, Banderier and Wallner classified these 32 counting models into the following four classes: (P) simple products, (A) algebraic, (H) hypergeometric, (Z) zig-zag. They also obtained exact counting formulas for 30 of these 32 counting models; see [2 Table 1]. The formulas for the remaining counting models in Figure 2 and Figure 3 are unknown. They are denoted by Z2 and Z3, respectively.
Figure 3. A Young building (denoted by ) on the left and a Young building with periodic walls on the right.
Let and count the Young tableaux with periodic walls of types Z2 and Z3 with blocks. That is
Each such tableau has cells, and the empty tableau has counts . We first specify the normalization, since the number of blocks and the number of cells give different series. Define
The exponential generating functions in which the variable marks cells are therefore and . The usual exponential generating series of the sequences indexed by the number of blocks are
In particular, Banderier and Wallner proposed the following conjecture.
Conjecture 1.1. (Banderier and Wallner [2]) The exponential generating functions and are D-algebraic but not D-finite.
The main motivation of this paper is to resolve Conjecture 1.1. We give counting formulas for both families and prove that their exponential generating functions are in fact differentially transcendental. These series require a separate analysis: changing a factorial normalization does not in general preserve differential algebraicity.
A function is differentially algebraic (or D-algebraic) over if it satisfies
for some integer and some nonzero polynomial . It is differentially transcendental if no such polynomial exists. It is D-finite if it satisfies a nonzero linear differential equation with coefficients in . These definitions also apply to formal series. A sequence is P-recursive if, for some , there are polynomials , not all zero, such that
for every sufficiently large integer . Equivalently, its ordinary generating series is D-finite; see [10 Theorem 1.5]. For further details on the definitions, we refer the reader to [13 Chapters 5 and 6].
Theorem 1.2. The generating functions and are defined in (1). Then neither nor is D-finite over . Equivalently, the sequences and are not P-recursive. Moreover,
and the associated auxiliary series has radius of convergence , which is not an algebraic number.
Theorem 1.3. The series and in (2) have radius of convergence zero. As formal power series, each is differentially transcendental over . Consequently, neither series is D-algebraic, and neither is D-finite. More precisely,
and
We also obtained two recurrences for and ; see Theorem 2.3. This allows us to compute certain concrete values quickly. Computing all counts with requires arithmetic operations and entries of working memory. As a byproduct, non-recursive formulas for and are given in Proposition A.1. However, they are not convenient for computation.
The rest of this paper is organized as follows. In § 2, we associate and with their corresponding posets, and then obtain recurrences for and . § 3 is mainly devoted to proving Theorem 1.2. § 4 mainly concerns the proof of Theorem 1.3. Section A is a byproduct; it mainly contains the non-recursive formulas for and .
Two posets and their counting formulas
This section gives the details of the two families of posets, denoted by and , and the counts and of their linear extensions with blocks. These objects were introduced in the Introduction. We describe the order relations in each family. We then express and as integrals over order polytopes. These integral formulas are the basis for the later analysis. We also record a polynomial recursion, which gives single sums with integer coefficients. This recursion is useful for computation, but the later arguments do not rely on it.
Order relations and order polytopes
We describe and by their order relations. In this way, the objects do not depend on a diagram convention.
Write for the bottom-row cells and for the top-row cells, read from left to right. In both families the bottom row is a chain:
For , the additional generating relations are
For Z3, they are
The orders are the transitive closures of the stated relations. No other adjacent-cell relations are imposed. In particular, in (4), is isolated. Also, has only its attachment to .
A legal labeling is a bijection from the cells to that preserves these orders. Thus it is a linear extension of the corresponding poset.
Figure 4 shows the two orders for . Every arrow points from a smaller element to a larger one. The isolated element in the second diagram is part of the counting problem and contributes to the factorial .
Figure 4. The two posets with two blocks. Only generating order relations are drawn.
For a finite poset with elements, its order polytope is
The volume formula
is due to Stanley [11 Corollary 4.2]. For completeness, the hyperplanes on which two coordinates coincide have measure zero. Off these hyperplanes, each ordering of all coordinates describes an open simplex of volume . Such a simplex belongs to exactly when the ordering is a linear extension. These simplices have disjoint interiors. They cover the order polytope up to measure zero. This proves (5).
Set
We use the same symbols for cells and their coordinates in the order polytope. Once the bottom-row coordinates are fixed, the coordinates in different top-row components can be integrated independently.
Proposition 2.1. For , we have
Proof. For (3), fix the bottom-row coordinates. For each , the coordinates and only interact with . The relations are and . Thus, for fixed , we have and . Their integral is
The pairs for different are independent. Multiplying over all and then integrating over the bottom chain gives (6) by (5).
For (4), again fix the bottom-row coordinates. The coordinate only interacts with . The relation is . Thus its integral is
For , the pair only interacts with . The relations are and . For fixed , the integral is
The isolated coordinate contributes a factor 1. These are all the top-row components. Multiplying them and integrating over the bottom chain gives (7).
A polynomial recursion
To write the density formulas in (6) and (7) in iterative form, we introduce an integral operator. Define
For , direct integration gives
Thus maps into itself.
In the following proposition, subscripts denote partial derivatives with respect to . Thus and . The same convention applies to .
Proposition 2.2. The counts can be evaluated by
Let be the solutions of
Then
The functions in (13) are entire in .
Proof. We first record two properties of . From (8), we have
We use these properties below. The polynomial is the integral over with weight . This statement follows by induction. For , the integral is . To pass from to , applying adds the coordinate with weight . The factor can be rewritten as the integral over the last coordinate . Thus
Differentiating this integral with respect to the upper limit removes the last integration. By the Leibniz rule, the derivative is
At , the result is (6).
Similarly,
Each further application of appends two coordinates and puts a factor at the first appended coordinate. The weight obtained in this way is exactly the integrand in (7). Hence (10) follows.
The relevant series are
They satisfy , and . Differentiating twice in gives (11)–(12), including the initial values. Equation (10) gives (13).
For convergence, we use the multiple-integral form of . Since on , we obtain the following estimate. For and , set
Then
Hence the displayed series converge locally uniformly in . The convergence is uniform for . Their first -derivatives have analogous bounds obtained by differentiating (8). Their second derivatives are controlled by the integral equations. This justifies the differentiations. Alternatively, the density integrals give
These inequalities prove directly that and are entire.
Single sums with integer coefficients
The operator formula already gives a short exact calculation. The following form avoids polynomial integration during the calculation. It uses integer coefficients throughout the recurrence. For a positive integer parameter , define
Here when or . The recurrence is used for and . For each positive integer , every nonzero entry is a positive integer. In this paper we only need the cases . The initial polynomials in (10) are linear combinations of for .
Theorem 2.3. For , we have
For , we have
The coefficients are determined by (14). Computing all counts with requires arithmetic operations and entries of working memory.
Proof. The factorial basis makes the calculation explicit. For , (9) becomes
We claim that
At , the claim is the trivial identity . Assume it holds at . Applying , the first term in the preceding monomial formula contributes to the coefficient with index at level . The second term with old index has degree before applying . Its extra minus sign changes to . Its integer multiplier is
There are no other contributions to this degree. Thus its total coefficient is exactly (14). This proves (17) by induction.
For , use in (17), differentiate in , and evaluate at . The differentiation changes into . The first identity in (10) gives (15).
For , write the initial polynomial as . Use (17) with in place of , first with and then with . Evaluation at and the second identity in (10) give (16).
There are entries in row of each triangle. Each entry requires a bounded number of integer additions and multiplications. Hence the rows through require arithmetic operations. Consecutive factorials up to can be computed in further operations. The displayed sums use rational operations at index . Therefore they use operations in total. Each new row needs only the preceding row. Retaining the current rows and factorials uses entries. No bound on the number of bits in an entry is asserted.
For example, the first three rows for are
Thus (15) gives
For , the two initial entries give .
Expanding the integrands directly also gives the subset sums in Section A. Those formulas contain terms; (15) and (16) collect the calculation into rows of the integer recurrence.
The formulas yield the following values. They also agree with direct enumeration of linear extensions for all entries displayed.
| 0 | 1 | 1 |
| 1 | 3 | 8 |
| 2 | 119 | 416 |
| 3 | 13,761 | 56,136 |
| 4 | 3,178,785 | 14,433,600 |
| 5 | 1,226,341,035 | 6,042,488,040 |
| 6 | 711,310,157,271 | 3,743,684,613,216 |
Table 1.
The elementary proof of thm:ABnotDfinite
In this section we prove Theorem 1.2. The theorem states the exponential growth of the normalized counts and the non--recursiveness of and . Our proof uses the integral formulas from § 2 and a standard fact about -finite series. We begin with the normalization.
Let
We first prove the limits
Since decreases on , we have . The product is symmetric. Its integral over the ordered simplex is therefore times its integral over the cube. By (6),
For a lower bound, fix and restrict the integral to . This avoids the zero of at . On that simplex,
It follows that
Taking the -th roots in (18) and (19) gives
Hence .
For the second family, we compare the integrands. Since and for , the integrand in (7) is at least the integrand in (6). Hence . Consequently,
For the reverse inequality, use and, for ,
Therefore
For , integrate and first. The resulting lengths and are at most . Thus
For , the same inequality holds because . Hence
Taking th roots gives
Together with the lower bound, this yields . In particular,
Next we show that the generating functions are not -finite. Recall that a formal power series is -finite if it satisfies a linear differential equation with polynomial coefficients. We use the following standard fact. See, for instance, [13 Chapter 6] or [8].
Lemma 3.1. A -finite series with rational coefficients and finite positive radius of convergence has an algebraic radius of convergence.
Proof. First, an equation with coefficients in can be replaced by one with coefficients in . To see this, fix the order and degree bounds of the given equation, and regard its finitely many coefficients as unknowns. Equating coefficients of powers of gives a homogeneous linear system over . The row space of this possibly infinite system is spanned by finitely many rows. Its kernel has the same dimension over as after scalar extension to . Thus a nonzero complex solution implies a nonzero rational solution.
We now use the equation with rational coefficients. Let
be such an equation. A germ of a solution continues analytically through an ordinary point. Indeed, after division by , this follows from the existence theorem for an analytic first-order linear system applied to . Hence every singular point of the germ on its finite circle of convergence is a zero of . At least one such singular point exists; otherwise finitely many neighborhoods covering that circle would extend to a larger disk. Its radius is therefore for a zero of . Both and its complex conjugate are algebraic, and . Thus is algebraic.
The ordinary series and have radius , because and . This number is transcendental by the transcendence of [6]. By Lemma 3.1, neither series is -finite. Thus neither nor is -recursive.
For each fixed , the ratio
is a rational function of . If a polynomial-coefficient recurrence existed for , substitute and clear denominators. The result would be a nonzero polynomial-coefficient recurrence for , a contradiction. The same argument applies to and . Using the factorial factor instead, we also find that neither nor is -recursive. Hence and are not -finite. This proves Theorem 1.2.
Section 3 proved that and are not -finite. The next section disproves the Banderier–Wallner conjecture. That is, we show that the block-counted series and are differentially transcendental. The method is different: a coefficient criterion based on ratio limits, combined with a probabilistic representation of the normalized counts.
Disproving the Banderier–Wallner conjecture
We prove Theorem 1.3 for the block-counted exponential generating functions in (2). Both are differentially transcendental as formal series, and their coefficient ratios tend to after division by . Their radii of convergence are zero, while their ordinary Borel transforms, obtained by dividing the coefficient of by one further factor , have radius . The differential-algebraic classification of is understood coefficient by coefficient in .
Radius zero alone does not imply differential transcendence. For example, the Euler series has radius zero and satisfies
Differentiation gives the homogeneous linear equation
so is -finite. The obstruction used here is the transcendental value of the coefficient ratio, together with rationality and positivity of the coefficients.
In the Euler example, and . The limit is algebraic, so Theorem 4.2 below does not exclude differential algebraicity. The obstruction in our application is that the limit is transcendental.
A coefficient criterion for differential transcendence
We first prove the factorial convolution estimates needed for the criterion.
Lemma 4.1. Let be a sequence of positive real numbers such that
For every fixed nonnegative integer , we have
For every fixed integer , the corresponding restricted -fold convolution also satisfies
The constants in these estimates may depend on and .
Proof. Choose sufficiently small that
Since , there is an integer such that
After enlarging the constant to cover the finitely many indices , the upper inequality gives
If and , telescoping the lower inequality from to gives
Combining these bounds yields
We estimate the sum on the right beginning at any fixed . For , the ratio of consecutive terms is
For all sufficiently large , this ratio is bounded by a fixed number less than , uniformly in that range. Hence this part of the sum is bounded by a constant times . For , use
The sum of over this second range is therefore exponentially small, since . Symmetry in and proves the binary convolution estimate.
Taking shows that the unrestricted binary convolution is bounded by a constant times . Increasing that constant to cover the finitely many small values of , induction gives
for every fixed . In a restricted -tuple, choose an index whose value is smallest. Then . There are at most choices of that index. After fixing it, bound the convolution of the remaining indices by the unrestricted estimate. The resulting upper bound is
as required. For , the factor can be taken to be 1.
The coefficient linearization in the next theorem is related to Borinsky’s asymptotic linearization [3 Proposition 55 and Remark 57]. The argument given here requires only a positive coefficient ratio limit; it does not assume a complete asymptotic expansion.
Theorem 4.2. Let , where for all sufficiently large . Suppose that
If is differentially algebraic over , then is an algebraic number.
Proof. The proof has three steps. First, we reduce to a differential polynomial over whose total degree in the variables is minimal. Second, we expand this relation in a Taylor expansion around the truncated series . The linear part carries the dominant contribution , while the nonlinear remainder is smaller by Lemma 4.1. Third, comparing coefficients gives a nonzero polynomial equation for .
We first show that a differential polynomial relation can be chosen over . Clear the denominators in a relation over and retain the finitely many monomials in that occur. Regard their coefficients as unknowns. Substitution of and comparison of coefficients of gives a homogeneous linear system with rational entries and finitely many columns. Its row space has a basis consisting of finitely many rows. Consequently its kernel is already the kernel of a finite rational matrix, whose rank is the same over and . A nonzero complex solution therefore implies a nonzero rational solution.
Among all nonzero polynomials satisfying
choose one whose total degree in the variables is smallest. Denote that degree by . It is positive, since a nonzero polynomial in alone cannot vanish as a formal series. For every index on which depends, its partial derivative with respect to is a nonzero polynomial of smaller total degree. Minimality of therefore implies that
is a nonzero formal series. Write its first term as
and set , where the maximum is over the indices on which depends. The choice of records the dominant power of in the linear term below. The truncation index will be chosen large enough to make the nonlinear remainder negligible compared with .
The ratio hypothesis implies, by a finite product of consecutive ratios, that for every fixed integer ,
Negative shifts follow by taking reciprocals of the corresponding positive-shift products. In particular, for fixed nonnegative integers ,
Choose a large fixed integer , and set
Taylor expansion of the polynomial in its variables is an exact finite identity:
Here each is a polynomial, and every monomial of has at least two factors among . The coefficients of those monomials are polynomials in .
Every difference is divisible by for . Substitution in a polynomial thus shows that is divisible by . Choose so large that
and so that all coefficients with are positive. It follows that has first term . If does not depend on , then both and are identically zero.
For sufficiently large , the coefficient of is zero, since it is a polynomial. Likewise, in the linear part, the relevant coefficients of equal those of . Each contains only finitely many terms. Applying the fixed-shift estimate to these terms gives
Indeed, the first term of contributes , and every later term has a smaller power of .
We now bound the nonlinear remainder. Replace any nonpositive initial coefficients of by positive numbers, obtaining a sequence that agrees with at all sufficiently large indices. It has the same ratio limit, so Lemma 4.1 applies. Enlarge if necessary so that for . The fixed-shift estimate also gives
whenever this coefficient is nonzero. All such indices satisfy , so the constants can be chosen uniformly over the relevant indices.
Consider a remainder monomial containing factors, with derivative orders . Its coefficient of degree is bounded in absolute value by a constant times
There are at most factors, each of derivative order at most , so this is . Multiplication by a fixed power , with , preserves that bound: the coefficient is shifted from to , and . Since the remainder contains only finitely many such terms,
The exact Taylor identity therefore gives
This is a nonzero Laurent polynomial equation over . To check that its polynomial is nonzero, observe that in this sum, so the exponent is different for each index . Every coefficient is nonzero. Multiplying by a sufficiently large power of produces a nonzero ordinary polynomial over satisfied by . Thus is algebraic. □
Proof of Theorem 1.3 by ratio limits
The criterion Theorem 4.2 requires the limit of the consecutive ratio . Our growth estimates in Theorem 1.2 give only the -th root limits of the normalized counts. We therefore need a passage from root limits to ratio limits. The passage uses the following properties of and .
Lemma 4.3. The sequences and are moment sequences of positive finite measures supported on , and . Moreover, both sequences are log-convex:
The proof of Lemma 4.3 is given in § 4.3. It uses a probabilistic representation of and as moments of positive measures, which is independent of the coefficient criterion above.
Now we are ready to give the proof of Theorem 1.3 as follows.
Log-convexity implies that the ratios and increase with . Since the representing measures are supported on , we have and , so these ratios are bounded above by . Hence both limits exist. For a positive sequence with , the root limit equals the ratio limit whenever the latter exists. The root limits are known by Theorem 1.2: , and follows from and . Therefore
Consequently
For the coefficients of , the factorial normalization gives the exact ratio
For , the same calculation uses in place of and gives the same limit. Both coefficient sequences consist of positive rational numbers. Since is transcendental by the transcendence of (see [6]), Theorem 4.2 proves that and are differentially transcendental. Every -finite series satisfies a differential polynomial equation, so neither series is -finite.
It remains to verify the stated convergence properties. For either coefficient sequence, the ratio just proved implies
Taking a finite product of these ratios and then taking the -th roots gives
The Cauchy–Hadamard formula therefore gives radius for each ordinary Borel transform. For any , the same limit gives after increasing to cover the initial indices. Finally,
because . Thus the radii of convergence of and are zero. This completes the proof of Theorem 1.3 modulo the proof of Lemma 4.3 in § 4.3.
Positive moment representations
Recall the normalized counts and their exponential growth limits:
The limits were proved in Theorem 1.2. We strengthen them to ratio limits by representing the normalized counts as moments of positive measures.
The construction below applies to the equations for and . It uses three features that are specific to and to the initial-value problems (2.9) and (2.10). First, for , after the substitution , the functions and satisfy a linear system whose first equation has no zeroth-order term. For , the same system has an additional forcing term in the first equation. Second, the coefficient
is nonnegative on , so it can serve as a switching rate. Third, the integral is bounded by , so the resulting random variable has bounded support. Under these three conditions, the system is the generator of a two-state Markov process, and its solution is the exponential moment of that process. No general differential equation admits such a representation.
Set
In particular, , and is nonnegative and continuous on every compact subinterval of . We give the switching-process construction and the elementary differential equations for its weighted probabilities explicitly.
Let , , be a Poisson process of rate 1, starting at and having right-continuous counting paths: its increments on disjoint intervals are independent, and
Let be independent of this process, with values 1 and , each of probability . Define the common time-changed process
For , set
This common construction makes the random integrals jointly measurable in , as required for the double integrals below. On each compact interval with , the cumulative Poisson time is finite. Thus switches sign a finite number of times almost surely on that interval, and its switching rate at is . The time change is explicit:
Although this quantity tends to infinity as , the integral defining has a pathwise limit , because
Moreover,
No value of the terminal sign is needed.
For and , define
where denotes expectation and an indicator. Their initial values are . We claim that
To verify this, fix in a compact interval below 1 and condition on the sign at and the Poisson increments over . The probabilities of no switch, one switch, and at least two switches are, respectively,
On a path with no switch, the extra exponential weight is , according to the sign. On a path with one switch it is ; its correction is multiplied by a switching probability of order . The weights already accumulated before are bounded by . Independent Poisson increments therefore give
with the coefficients on the right evaluated at . Division by and passage to the limit proves (20).
Proposition 4.4. The first normalized count is the moment
For the second family, set
Then
Both and are moment sequences of positive finite measures supported on .
Proof. For the first family, evaluate (11) at and set and , with dependence on understood. The differential equation for and the identity give
Consequently and satisfy the same system as and in (20). Their initial values are also the same, since and . Uniqueness for the linear system on each compact interval below gives
The solution is continuous at by (11). The random integral converges pathwise there, and its exponential is bounded by . Dominated convergence and (13) therefore yield
Changing the independent initial sign to changes to without changing its distribution. Thus all odd moments vanish. The exponential series converges uniformly for on bounded sets of , so expectation can be taken term by term:
Comparison with the definition of proves the asserted formula for .
For the second family, evaluate (12) at and set and . This time the equations are
Hence and satisfy (20) with the same extra term in both equations, and with zero initial values. It follows that
This identity can be checked directly: differentiation of the right side gives the homogeneous system under the integral, and its upper endpoint contributes ; its value at is zero. Linear-system uniqueness then proves the identity. Adding the two signs and dividing by 2 gives
Integrate over and use (13):
All weights are bounded by , and the integration domain has finite area. The same symmetry and uniform convergence argument as before therefore gives
For , comparison of coefficients yields
which is equivalent to the asserted formula for . In particular, , in agreement with .
Finally, is the -th moment of the distribution of . The sequence is the -th moment of the positive measure obtained by integrating the distributions of with weight . Their total masses are 1 and 1/3, respectively. The bound places both supports in .
We also record the log-convexity used in § 4.2. For a positive finite measure supported on , the Cauchy–Schwarz inequality gives
Applied to the measures representing and , this gives and for .
Subset sum formulas for and
The elementary simplex integral used here is
To verify it, integrate first. The factor is obtained, and the exponent of increases by . The next integration gives the factor . Repeating this operation through gives exactly the product in (A.1).
Proposition A.1. For every integer ,
For every integer ,
Empty products are 1, and sums over empty index sets are 0. The value at in (A.2) is interpreted using the single empty binary vector.
Proof. Expand the integrand in (6) as
In (A.1), the cumulative exponent at position is , and the cumulative exponent at position is . Substituting these values proves (A.2).
For (7), the expansion is
At positions and , the cumulative exponent is the same, namely . Equation (A.1) now gives (A.3). □
Data availability: Data availability is not applicable to this article as no new data were created or analyzed in this study.
Acknowledgments: We are also grateful to Dr. Zihao Zhang for many useful suggestions. Feihu Liu was partially supported by the Postdoctoral Fellowship Program and China Postdoctoral Science Foundation (No. BX2026002). Guoce Xin was partially supported by the National Natural Science Foundation of China (No. 12571355).
References
- [1]C. Banderier, P. Marchal, and M. Wallner, Rectangular Young tableaux with local decreases and the density method for uniform random generation, in GASCom 2018: Random and Exhaustive Generation of Combinatorial Structures, CEUR Workshop Proceedings 2113 (2018), 60–68. 1, 2
- [2]C. Banderier and M. Wallner, Young tableaux with periodic walls: counting with the density method, Séminaire Lotharingien de Combinatoire 85B (2021), Article #47. 1, 2, 3
- [3]M. Borinsky, Generating asymptotics for factorially divergent sequences, Electronic Journal of Combinatorics 25 (2018), no. 4, #P4.1. 13DOI
- [4]Y.-S. Chang, M. Fuchs, H. Liu, M. Wallner, and G.-R. Yu, Enumerative and distributional results for d-combining tree-child networks, Advances in Applied Mathematics 157 (2024), Article 102704. 2arxiv.org/abs/2209.03850
- [5]Z. Lin, F. Liu, J. Liu, J. Liu, and G. Xin, Proof of a conjecture on Young tableaux with walls, arXiv:2601.09551. (2026). 2arxiv.org/abs/2601.09551
- [6]F. Lindemann, Ueber die Zahl π, Mathematische Annalen 20 (1882), 213–225. 11, 16
- [7]F. Liu and G. Xin, Simple generating functions for certain Young tableaux with periodic walls, arXiv:2401.14627. (2024). 2arxiv.org/abs/2401.14627
- [8]L. Lipshitz, D-finite power series, Journal of Algebra 122 (1989), no. 2, 353–373. 10DOI
- [9]M. Pons and J. Batle, Combinatorial characterization of a certain class of words and a conjectured connection with general subclasses of phylogenetic tree-child networks, Scientific Reports 11 (2021), 21875. 2DOI
- [10]R. P. Stanley, Differentiably finite power series, European Journal of Combinatorics 1 (1980), no. 2, 175–188. 4DOI
- [11]R. P. Stanley, Two poset polytopes, Discrete & Computational Geometry 1 (1986), 9–23. 5DOI
- [12]R. P. Stanley, Enumerative Combinatorics (volume 1), second Edition. Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge University Press, (2012). 1
- [13]R. P. Stanley, Enumerative Combinatorics (volume 2), second Edition. Cambridge Studies in Advanced Mathematics, vol. 208, Cambridge University Press, (2023). 4, 10



