Pith. sign in

REVIEW 3 major objections 4 minor 28 references

C sequential optimization numbers

T0 review · 3 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that C sequential optimization numbers have a closed form and that the case C=(0,1) recovers the unsigned Stirling numbers of the first kind.

desk verdict A credible but under-proved generalization of the Stirling numbers via record sets; the main formula is likely true, but the key factorization step in the general-C proof is asserted rather than shown. read the letter →

arxiv 2411.17127 v1 pith:AEJYTJ5J submitted 2024-11-26 math.CO cs.DM

Zile Hui This is my paper · ORCID
classification math.COcs.DM MSC 05A1505A1911B73
keywords CsequentialoptimizationnumbersStirlingofthefirstkindk-dimensionalcolorboardsproblemsetexplicitupperboundrecurrenceformulaconcentrationmeasure
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper introduces a family of combinatorial numbers attached to a $k$-dimensional color-board problem: for each binary vector $C=(c_0,\dots,c_k)$ and board size $n$, it counts how many configurations of $n$ boards, each split into $k$ smaller boards, have an optimization set of size $m$. The main claim is a closed formula for these C sequential optimization numbers, and a proof that the special case $C=(0,1)$ gives exactly the unsigned Stirling numbers of the first kind. If correct, the paper supplies a more granular definition of those Stirling numbers, together with a recurrence, an explicit upper bound, and a concentration result saying that almost all of the counting mass sits in an interval of length about $\log n$. The interest is that a simple visibility-and-counting problem encodes a classical sequence, and varying $C$ produces a weighted family that inherits and extends Stirling-number behavior.

What carries the argument

The machinery is the optimization set of a layered board: a smallest set of board-vectors that dominates every other vector under a coordinatewise $<$ relation, with the additional rule that board $\alpha$ is included only when $c_l=1$ for the number $l$ of layers in which it is dominant. The proof of Theorem 2.1 is carried by a ratio identity $g(S_1)=F_j(C)/F_j(C')\,g(S_3)$ when a new element $j$ is appended to an optimization set; multiplying the ratio over the $k$ layers and summing over all valid subsets yields the closed formula. The recurrence in Theorem 3.1 then follows by splitting configurations according to whether the element $n+1$ is in the optimization set.

What would settle it

For $n=4$, $k=2$, and $C=(0,1,0)$, the closed formula predicts $O_C(4,1)=240$ out of the $576$ possible two-layer colorings. Enumerating the $576$ configurations by hand or by code and counting those whose optimization set has size $1$ would confirm or refute the formula directly.

Watch

Extended reading notes

Core claim

The central discovery is a product-sum formula for the counting numbers $O_C(n,m)$: for $1\le m\le n$, $O_C(n,m+c_k-1)=(n-1)!^k$ times the sum, over all $(m-1)$-subsets $\{j_1,\dots,j_{m-1}\}$ of $\{2,\dots,n\}$, of $\prod_i F_{j_i}(C)\,\prod_i F_{j'_i}(C')$, where $C'=(1,\dots,1)-C$ and $F_j(C)=\sum_{\beta=0}^k \binom{k}{\beta} c_\beta/(j-1)^\beta$. For $C=(0,1)$ the factors reduce to $1/(j-1)$ and the sum becomes the known subset-sum expression for the unsigned Stirling numbers of the first kind, so $O_{(0,1)}(n,m)=s_u(n,m)$. The paper also derives a two-term recurrence, a duality between $C$ and $C'$, an explicit upper bound, and tail estimates showing that the distribution of $m$ is concentrated in a window of length $O(\log n)$ or at the opposite end, depending on the first coordinate of $C$.

Load-bearing premise

The proof assumes that the $k$ layers of the board are counted independently, so the total number of configurations is $n!^k$ and the counting ratio for adding an element to an optimization set factors across layers; if visibility patterns across layers interact, the closed formula collapses.

Editorial extensions

If this is right

  • For $C=(0,1)$, the closed formula is a subset-level definition of the unsigned Stirling numbers of the first kind, from which the classical sum-over-subsets definition follows.
  • The numbers obey the recurrence $O_C(n+1,m+1)=n^kF_{n+1}(C)O_C(n,m)+n^kF_{n+1}(C')O_C(n,m+1)$.
  • Duality holds: $O_C(n,m)=O_{C'}(n,n-m)$, so distributions for complementary parameter vectors mirror each other.
  • For $c_0=0$, almost all of the counting mass lies in values $m\le O(\log n)$; for $c_0=1$ the mass lies near the end, and in both cases the tail probability decays like $e^{-M}$ beyond an explicit threshold.
  • The original $k$-dimensional color-board count is exactly $O_{(0,1,\dots,1)}(n,m)$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • One can view $C$ as a set of switches: setting a coordinate to $0$ removes the contribution of that visibility layer, so the family interpolates between the one-layer Stirling case and the full $k$-dimensional board count.
  • The explicit upper bound is obtained with deliberately crude inequalities; a sharper estimate of the harmonic-type sum would refine the constant in the concentration threshold without changing the $O(\log n)$ window.
  • Because the ratio identity is asserted after the two-layer case and multiplied over $k$, a fully rigorous proof should spell out the layer-independence step; this is the point to check first.
  • A similar counting model with a different dominance relation, such as allowing equality, should produce an analogous family with $F_j$ replaced by another weight, generalizing the construction beyond strict visibility.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper introduces a k-dimensional colour-board counting problem and, through it, a family of numbers O_C(n,m) indexed by a binary vector C=(c0,c1,...,ck). The main object, defined in Definition 2.2, counts optimization sets built from record-like layers, and Theorem 2.1 asserts an explicit weighted-subset formula for O_C. For C=(0,1) with k=1 the formula reduces to the unsigned Stirling numbers of the first kind. The paper then derives a duality, a recurrence, an explicit upper bound, and concentration estimates; for the Stirling case the concentration statement gives an exponential tail bound for the number of cycles in a random permutation.

Significance. If the central formula is fully proved, the paper offers a new weighted generalization of the unsigned Stirling numbers, with a clean special-case identification, a recurrence reducing to the classical one, and an elementary upper-bound method that yields falsifiable tail estimates. The small cases C=(0,0), (0,1), (1,0), (1,1) reduce consistently, which is evidence that the formulas are not merely formal. However, the proof of the k>1 case of Theorem 2.1 rests on an unstated independence/factorization assumption, and the concentration section has indexing and derivation gaps. These are proof-completeness issues that can plausibly be repaired, but they currently prevent the paper from being relied upon.

major comments (3)
  1. [§2, proof of Theorem 2.1, Eq. (5)] The passage from k=1 to general k is not proved. The relation g(S1)=(F_j(C)/F_j(C'))g(S3) is asserted after the C=(0,1) induction, but it presupposes that for each layer β the operation of adding b_{jβ} to Sβ multiplies the count by 1/(j−1), and that the k layers are independent. No lemma states or proves this factorization, so the factors (n−1)!^k and the summed products in the closed formula are not derived. The division by F_j(C') is also undefined for C=(1,1,...,1), a case the proof later says 'also holds' without separate treatment. Small cases are consistent with the formula, so I am not claiming the formula is false, but the main theorem currently has a genuine proof gap.
  2. [§5, Theorem 5.2] The statement bounds P(O_C(n,m>M)), but the proof works with P(O_Cmax(n,i+c_k−1)) for i=M+1,...,n; for c_k=0 this range covers m≥M rather than m>M, and the relationship between M and the support of O_C is never made explicit. More importantly, the line 'P(O_Cmax(n,M+c_k−1)) ≤ exp(−M1)' is not derived. The displayed '≤1/e' bound applies to P(O_Cmax(n,m+c_k)) for m≥ceil(eA), and passing from that one-step bound to an exponential decay in M1 requires an explicit geometric-decay argument that is absent. The concentration claim is load-bearing for the paper's main application, so this derivation needs to be made fully rigorous.
  3. [§5, Theorems 5.1 and 5.3] O_Cmax is defined only for 1≤m≤n, but Theorem 5.3 sums O_Cmax(n,m) from m=0 to n. For c_k=0, O_C(n,0) can be nonzero and O_Cmax(n,0) is undefined; the displayed computation starts at m=1 without explaining the missing term. In fact the intended sum appears to be over the shifted index m+c_k−1 on the support of O_C. The ratio statements in Theorem 5.3 need either a definition of O_Cmax on the full support of O_C or an explicit statement of the correct shifted summation index.
minor comments (4)
  1. [Lemmas 3.3 and 5.1] The notation C=(0,1) is used for a (k+1)-component vector, but these lemmas implicitly take k=1. Please state the dimension explicitly, since for k>1 the vector (0,1) has the wrong length.
  2. [Theorem 3.1] The boundary condition switches from O_C to O_c, and the proof explicitly handles c_k=1 but only says 'the same method can be iterated for c_k=0'; the differing support of the recurrence in the c_k=0 case should be shown.
  3. [Section 4] The phrase 'more basic definition' and the claim that the new definition is 'sufficient but not necessary' for the previous one are informal. Since this is one of the paper's stated contributions, it should be formalized, for example by stating precisely what information the particular-set formula carries beyond the summed definition.
  4. [Throughout] There are several typographical and presentational inconsistencies, including the lowercase '_O_c_' in the boundary condition of Theorem 3.1, 'formula 4' for 'Eq. (4)', and the mixed vector/matrix notation '𝑫𝑪𝑇'. These do not affect the mathematics but should be cleaned up.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the C sequential optimization numbers are defined combinatorially and the Stirling-number identification is derived from the counting theorem, not assumed; neither fitted parameters nor load-bearing self-citations appear.

full rationale

Definition 2.2 fixes O_C(n,m) as the number of permutations/labelings for which the C-weighted record-union size is m; this is a combinatorial count independent of the target formula. Theorem 2.1 then derives the closed form: for C=(0,1) it inductively proves g(S1)=(n-1)!/prod(p-1)(q-1)... for a specified record set, and summing over all m-1-subsets yields O_(0,1)(n,m)=(n-1)! sum prod 1/(j_i-1), the standard unsigned-Stirling sum; Lemma 3.3 only evaluates this derived expression. The general-C step through Eq. (5) assumes a product/independence structure among the k layers, and that unproved factorization is a proof-completeness gap and a correctness risk, but it is not circular because the closed formula is not assumed by Definition 2.2 and no parameter is fitted from the identity being proved. The upper bound in Theorem 5.1 is proved from the recurrence Theorem 3.1 using monotonicity and binomial estimates, and the concentration bounds are tail probabilities applied to that upper bound rather than to the target values themselves. There are no load-bearing self-citations: references [5] and [12] are standard textbooks and [2] is independent; the OEIS comparison is an external benchmark. The Section 4 'more basic definition' label is a novelty/priority claim about a derived record-set count, not a circular reduction of the paper's central theorem to its own assumptions.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central formulas rest on a uniform-product model for the k layers and on standard analytic estimates; no fitted parameters or new physical entities are introduced. The main burden is the unstated independence of layers and the known record-position identity.

assumptions (5)
  • domain assumption The k layers of the color board are independent uniformly random permutations of heights, so the total number of configurations is n!^k.
    Used throughout Definition 2.2 and Theorem 2.1 to normalize probabilities and to factor counts across layers.
  • standard math The number of configurations with a fixed set of left-to-right minima positions S is (n-1)!/product over p in S excluding 1 of (p-1).
    Theorem 4.1 asserts this as the 'more basic definition'; it is a known record-theory identity and underlies Lemma 3.3.
  • standard math H(m) <= log(m)+gamma and sum over j>=2 of 1/(j-1)^beta <= zeta(2)=pi^2/6 for beta>=2.
    Used in Theorem 5.2 to bound H_n C^T.
  • standard math Stirling's approximation m! > sqrt(2*pi*m)*(m/e)^m.
    Used in Theorem 5.2 to convert the factorial bound into an exponential tail.
  • domain assumption Each layer has a unique optimization set S_beta, and the visibility pattern of a board is determined by whether it belongs to S_beta in each layer.
    Needed for the induction in Theorem 2.1 and for the bijective reading of the color-board problem in Lemma 2.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of C sequential optimization numbers." pith.science (2026). https://pith.science/paper/AEJYTJ5J

@misc{pith2026241117127,
  author       = {Pith},
  title        = {Pith review of: C sequential optimization numbers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AEJYTJ5J}},
  note         = {Machine review of arXiv:2411.17127}
}
read the original abstract

This work establishes a definition that is more basic than the previous ones, for the Stirling numbers of first kind, which is a sufficient but not necessary condition for the previous definition. Based on this definition and a combinatorial problem, we discover C sequential optimization numbers, where C is a k+1-tuple vector. For C= (0,1), we prove that C sequential optimization numbers are the unsigned Stirling numbers of first kind. We can deduce the properties of C sequential optimization numbers by following the properties of the Stirling numbers of first kind and we give specific examples such as the recurrence formula and an instance of C sequential optimization numbers. We also give specific new properties such as an explicit upper bound of them. We prove the probability that the unsigned Stirling numbers of first kind are concentrated in O(logn) is nearly 100%.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 25 canonical work pages

  1. [1]

    Introduction Stirling numbers were introduced by the Scottish mathematician James Stirling in his famous treatise [12]. Stirling numbers of the first kind, denoted by s(𝑛, 𝑚), are among the most important sequences in mathematics and have numerous fields such as combinatorics, number theory, numerical analysis, and probability theory [1],[3]. The recurren...

    work page

  2. [2]

    We define the optimization set in Definition 2.1 to solve this problem

    K-dimensional color boards problem We start with a k-dimensional color boards problem in Problem 2.1. We define the optimization set in Definition 2.1 to solve this problem . Based on the optimization set, we define C sequential optimization numbers in Definition 2.2. In Theorem 2.1, we give an expression for the C sequential optimization numbers. In Lemm...

    work page

  3. [3]

    Lemma 3.2 is a special case of 𝑂𝑪(𝑛, 𝑚)

    Several properties of C sequential optimization numbers Lemma 3.1 shows that there is a duality inside C sequential optimization numbers. Lemma 3.2 is a special case of 𝑂𝑪(𝑛, 𝑚). Lemma 3.3 shows that the unsigned Stirling numbers of first kind are (0,1) sequential optimization numbers. Thereafter, we give certain properties of C sequential optimization nu...

    work page

  4. [4]

    Theorem 4.1

    More basic definition In this section, we show that the more basic definitions of the Stirling numbers of first kind and C sequential optimization numbers. Theorem 4.1. Let 𝒂1(1, 𝑎1), 𝒂2(2, 𝑎2),…, 𝒂𝑛(𝑛, 𝑎𝑛) be n 2-dimensional vectors and 𝑎1, 𝑎2, … 𝑎𝑛 be 1,2, … , 𝑛, respectively. 𝑹 = (<, <). 𝑈 = {𝒂1, 𝒂2, … , 𝒂𝑛}. 𝑆 is an optimization set of 𝑈 by 𝑹. 𝑔(𝑆) de...

    work page

  5. [5]

    In Theorem 5.1, we give the upper bound of C sequential optimization numbers

    Explicit upper bound In this section, we give an explicit upper bound of C sequential optimization numbers and employ it to obtain further properties. In Theorem 5.1, we give the upper bound of C sequential optimization numbers. In Lemma 5.1, for 𝐶 = (0,1), we give the upper bound of the unsigned Stirling numbers of first kind. Theorem 5.2 shows that the ...

    work page

  6. [6]

    Proof of Theorem 5.1

    ≥ 𝑂𝑪(𝑛, 𝑚 + 𝑐𝑘 − 1). Proof of Theorem 5.1. We can get ℎ𝛽 = (𝑘 𝛽) ∑ 1 𝑗𝛽 𝑛−1 𝑗=1 = ∑ (𝑘 𝛽) 1 (𝑗 − 1)𝛽 𝑛 𝑗=2 = ∑ 𝑑𝑗,𝛽 𝑛 𝑗=2 𝑯𝑛𝑪𝑇 = ∑ ℎ𝛽𝑐𝛽 𝑘 𝛽=1 = ∑ ∑ 𝑑𝑗,𝛽𝑐𝛽 𝑛 𝑗=2 𝑘 𝛽=1 = ∑ ∑ 𝑑𝑗,𝛽𝑐𝛽 𝑘 𝛽=1 𝑛 𝑗=2 = ∑ 𝐹𝑗(𝑪) 𝑛 𝑗=2 (6) We apply mathematical induction to prove it. First, we prove the boundary condition. For 𝑘 ≥ 1 and 𝑛 ≥ 2, 𝑂𝐂𝑚𝑎𝑥(𝑛, m + 𝑐𝑘 − 1) {= (𝑛 − 1)!𝑘 ∏ 𝐹𝑖+...

    work page

  7. [7]

    This more basic definition has the potential to discover or prove several more sequences or properties

    Conclusion In this work, we give the more basic definition of the Stirling numbers of first kind, which yielded the discovery of C sequential optimization numbers. This more basic definition has the potential to discover or prove several more sequences or properties. We deal with multiple inequalities succinctly and roughly, and some of them still have mu...

    work page

  8. [8]

    J. A. Adell, Explicit upper bounds for the Stirling numbers of the first kind, J. Comb. Theory Ser. A 192 (2022) 105669. https://doi.org/10.1016/j.jcta.2022.105669

    arXiv 2022

Show all 28 references
  1. [9]

    Arratia, S

    R. Arratia, S. DeSalvo, Completely effective error bounds for Stirling numbers of the first and second kinds via poisson approximation, Ann. Combi. 21 (1) (2017) 1–24. https://doi.org/10.1007/s00026-017-0339-z

    2017 doi

  2. [10]

    I. V. Blagouchine, Two series expansions for the logarithm of the gamma function involving Stirling numbers and containing only rational coefficients for certain arguments related to π −1, J. Math. Anal. Appl. 442 (2016), 404 –434. https://doi.org/10.1016/j.jmaa.2016.04.032

    2016 doi

  3. [11]

    Broder, The r -Stirling numbers, Discrete Math

    A.Z. Broder, The r -Stirling numbers, Discrete Math. 49 (3) (1984) 241 -259. https://doi.org/10.1016/0012- 365X(84)90161-4

    1984 doi

  4. [12]

    R. A. Brualdi, Introductory Combinatorics, fifth ed., Pearson Education, Inc, 2009, pp. 289–291, Chapter 8

    2009

  5. [13]

    Chelluri, L.B

    R. Chelluri, L.B. Richmond, N.M. Temme, Asymptotic estimates for generalized Stirling number, Analysis 20 (1) (2000) 1–13. https://doi.org/10.1524/anly.2000.20.1.1

    2000 doi

  6. [14]

    Das, J.E

    I. Das, J.E. Dennis, Normal -boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems, SIAM J. Optim. 8(3) (1998) 631 –657. 18 https://doi.org/10.1137/S1052623496307510

    1998 doi

  7. [15]

    R. M. Everson, D. J. Walker, J. E. Fieldsend, Life on the edge: Characterising the edges of mutually non-dominating sets, Evolutionary Computation, 22 (1) (2014) 479-501. https://doi.org/10.1162/EVCO_a_00124

    2014 doi

  8. [16]

    Grü nberg, On asymptotics, Stirling numbers, gamma function and polylogs, Results Math

    D.B. Grü nberg, On asymptotics, Stirling numbers, gamma function and polylogs, Results Math. 49 (1–2) (2006) 89-125. https://doi.org/10.1007/s00025-006-0211-7

    2006 doi

  9. [17]

    Hamann, R

    A. Hamann, R. Racu, R. Ernst, Methods for multi -dimensional robustness optimization in complex embedded systems, In Proc. of the ACM EMSOFT (2007) 104 - 113. https://doi.org/10.1145/1289927.12899

    2007

  10. [18]

    Hwang, Asymptotic expansions for the Stirling numbers of the first kind, J

    H.-K. Hwang, Asymptotic expansions for the Stirling numbers of the first kind, J. Comb. Theory Ser. A 71 (2) (1995) 343–351. https://doi.org/10.1016/0097-3165(95)90010-1

    1995 doi

  11. [19]

    Jordan, Calculus of Finite Differences, third ed., Chelsea Publishing Co., New York, 1965, pp

    C. Jordan, Calculus of Finite Differences, third ed., Chelsea Publishing Co., New York, 1965, pp. 159–161, Chapter 4

    1965

  12. [20]

    Kuipers, P

    F. Kuipers, P. V. Mieghem, T. Korkmaz, M. Krunz, An overview of constraint -based path selection algorithms for QoS routing, IEEE Commun. Mag. 40 (12) (2002) 50–55. https://doi.org/10.1109/MCOM.2002.1106159

    2002 arXiv

  13. [21]

    Moulin, Dominance solvable voting schemes, Econometric 47 (6) (1979) 1337 –1351

    H. Moulin, Dominance solvable voting schemes, Econometric 47 (6) (1979) 1337 –1351. https://doi.org/10.2307/1914004

    1979 doi

  14. [22]

    Moser, M

    L. Moser, M. Wyman, Asymptotic development of the Stirling numbers of the first kind , J. Lond. Math. Soc. 33 (1958), 133–146. https://doi.org/10.1112/jlms/s1-33.2.133

    1958 doi

  15. [23]

    Perry, P

    M. Perry, P. J. Reny , A general solution to King Solomon’s dilemma , Games Econ. Behav. 26 (1999), 279 –285. https://doi.org/10.1006/game.1998.0655

    1999

  16. [24]

    Serrano, The Theory of Implementation of Social Choice Rules, SIAM Review, 46(3) (2004) 377 -414

    R. Serrano, The Theory of Implementation of Social Choice Rules, SIAM Review, 46(3) (2004) 377 -414. https://doi.org/10.1137/S0036144503435945

    2004 doi

  17. [25]

    Stirling, Methodus differentialis, sive Tractatus de summatione et interpolatione serierum infinitarum, 1730

    J. Stirling, Methodus differentialis, sive Tractatus de summatione et interpolatione serierum infinitarum, 1730

  18. [26]

    N. M. Temme, Asymptotic estimates of Stirling numbers, Stud. Appl. Math. 89 (3) (1993) 233 –243. https://doi.org/10.1002/sapm1993893233

    1993 doi

  19. [27]

    H. S. Wilf, The asymptotic behavior of the Stirling numbers of the first kind, J. Comb. Theory Ser. A 64 (1993) 344–349. https://doi.org/10.1016/0097-3165(93)90103-F

    1993 doi

  20. [28]

    Xue, Primal -dual algorithms for computing weight -constrained shortest paths and weight -constrained minimum spanning trees, In Proc

    G. Xue, Primal -dual algorithms for computing weight -constrained shortest paths and weight -constrained minimum spanning trees, In Proc. of the IEEE IPCCC (2000) 271–277. http://doi.org/10.1109/PCCC.2000.830328

    2000

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.