REVIEW 3 major objections 5 minor 8 references
A New Formula of q-Fubini Numbers via Goncharov polynomials
T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read A new combinatorial formula expresses q-Fubini numbers as sums over ordered partitions of products of q-binomial coefficients.
desk verdict A plausible q-analog of Goncarov polynomials with a promising Fubini formula, but the main theorem's proof assumes p_n(0)=0 without justification, so the derivation as written does not go through. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the generalized $q$-Goncharov polynomial sequence $(t_{n,q}(x))_{n\ge0}$ associated with a pair $(\partial_q,\mathcal{Z})$, defined by $\varepsilon_{z_i}(\partial_q^i t_{n,q})=[n]_q!\,\delta_{i,n}$ and expanded as $t_{n,q}(x)=p_n(x)-\sum_{i=0}^{n-1}\begin{bmatrix}n\\ i\end{bmatrix}_q p_{n-i}(z_i)t_{i,q}(x)$. Its constant terms, when the $q$-delta operator's basic sequence vanishes at $0$, obey the recurrence $t_{n,q}(0)=-\sum_{i=0}^{n-1}\begin{bmatrix}n\\ i\end{bmatrix}_q p_{n-i}(z_i)t_{i,q}(0)$, which the paper solves combinatorially by ordered partitions. Replacing each $p_{n-i}(z_i)$ by $-1$ turns that recurrence into the defining recurrence of $q$-Fubini numbers, from which the ordered-partition product formula follows.
What would settle it
Compute $t_{2,q}(0)$ for a q-delta operator whose basic sequence has $p_2(0)\neq0$, directly from the defining condition $\varepsilon_{z_i}(\partial_q^i t_{n,q})=[n]_q!\,\delta_{i,n}$ and from formula (18); if the two results differ, the formula as stated fails outside the assumption $p_n(0)=0$, while if they agree the assumption is removable.
Extended reading notes
Core claim
The paper's central claim is that for $n\ge 0$, with $f_{0,q}=1$, $$f_{n,q}=\sum_{k=1}^{n}\sum_{\rho\in \mathcal{P}^k_n}\prod_{i=0}^{k-1}\begin{bmatrix}s_{k-i}\\ b_{k-i}\end{bmatrix}_q,$$ where $\mathcal{P}^k_n$ indexes ordered partitions of $\{1,\dots,n\}$ into $k$ blocks, $b_i$ is the size of the $i$-th block, and $s_i=b_1+\cdots+b_i$. The proof introduces the generalized $q$-Goncharov basis $(t_{n,q})_{n\ge0}$ by the biorthogonality condition $\varepsilon_{z_i}(\partial_q^i t_{n,q})=[n]_q!\,\delta_{i,n}$; expands constant terms into a recurrence over ordered partitions; and, assuming the basic polynomials $p_n$ satisfy $p_n(0)=0$ and replacing each $p_{n-i}(z_i)$ by $-1$, identifies the resulting recurrence $f_{n,q}=\sum_{k=0}^{n-1}\begin{bmatrix}n\\ k\end{bmatrix}_q f_{k,q}$ with the $q$-Fubini numbers. The same framework also yields algebraic properties for the $q$-deformed polynomials, including shifted grids, $q$-binomial expansions, and a $q$-analog of the classical Goncharov interpolation formulas.
Load-bearing premise
The load-bearing premise is that the basic polynomials $p_n(x)$ of the q-delta operator satisfy $p_n(0)=0$ for every $n\ge1$; the paper invokes this to drop the $p_n(0)$ term in the constant-term recurrence, but its own Definition 2.2 only guarantees $\tilde g_n(0)=0$, which does not force $p_n(0)=0$.
Editorial extensions
If this is right
- If Proposition 4.3 holds, $q$-Fubini numbers can be computed directly from an ordered partition without iterating a recurrence; for fixed $n$ the sum has only finitely many terms.
- The classical Fubini-number formula in the Goncharov setting is recovered in the limit $q\to1$, since $q$-binomial coefficients become ordinary binomial coefficients and the $q$-recurrence becomes the classical ordered Bell recurrence.
- The same $q$-Goncharov interpolation machinery extends to other $q$-delta operators, giving formulas for the constant terms of the corresponding $q$-Goncharov basis whenever the basic sequence vanishes at zero.
- The algebraic properties established in Section 3, such as shift-invariance and $q$-binomial expansions, hold for the $q$-deformed basis and specialize to known results for $q$-difference operators.
Reading between the lines
- The ordered-partition sum suggests a probabilistic reading: if one orders the blocks of a random ordered partition, the product of $q$-binomial coefficients counts the $q$-weighted ways to choose the elements that close each block, which could connect to $q$-analogs of parking functions or order statistics.
- Because the proof's operative input is the recurrence plus vanishing at zero, the same derivation should work for any basis of $q$-binomial type whose associated delta operator annihilates constants at the origin; operators whose basic sequence has $p_2(0)\neq0$ would need an extra term and likely produce a different enumeration.
- The formula could be reorganized by the size of the last block to produce a bivariate generating function for $q$-Fubini numbers, allowing comparison with known $q$-Eulerian or $q$-Stirling identities.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to introduce a q-deformation of the generalized Goncharov polynomials associated with a q-delta operator and a grid, and to use these polynomials to derive a new combinatorial formula for q-Fubini numbers. The main results are: a uniqueness/existence theorem for the q-Goncharov basis (Theorem 3.1), algebraic properties analogous to the classical case (Propositions 3.2–3.10), a combinatorial expression for the constant terms of the q-Goncharov polynomials (Theorem 4.1), and a recurrence (Proposition 4.2) from which the explicit ordered-partition formula for q-Fubini numbers (Proposition 4.3, Eq. (21)) is obtained.
Significance. If the derivation were sound, the paper would give a new q-analog of the Goncharov polynomial approach to binomial enumeration, together with an explicit, testable sum over ordered partitions for q-Fubini numbers. The final formula (21) is concrete and matches the standard q-Fubini recurrence for small n, and the paper's attempt to connect q-delta operators with order statistics is a reasonable research direction. However, the manuscript as written contains a load-bearing gap: Theorem 4.1 invokes an unstated assumption p_n(0)=0 that fails for basic sequences allowed by Definition 2.2, and the subsequent derivation of the q-Fubini recurrence rests on an invalid substitution. These issues mean the central derivation is not established, though the formula itself appears repairable by a more direct combinatorial argument.
major comments (3)
- [Section 4, Eq. (19)] The proof of Theorem 4.1 begins with 'by considering that p_n(0)=0, for all n≥1', but this condition is neither stated in Theorem 4.1 nor implied by Definition 2.2. For example, for n=2 condition (ii) gives \tilde g_2(0)=p_2(0)+(q;q)_2 q/(q^2;q^2)_1=0, so p_2(0)=-q(1-q), which is nonzero for generic q. Thus for the q-Hermite basic sequence of the Askey-Wilson operator, the paper's own setup permits p_2(0)≠0. Evaluating Eq. (13) at x=0 then yields t_{n,q}(0)=p_n(0)-∑_{i=0}^{n-1} \binom{n}{i}_q p_{n-i}(z_i) t_{i,q}(0), so Eq. (19) is missing the p_n(0) term. Consequently formula (18) is not established for the stated class of q-delta operators; it already fails at n=2 when p_2(0)≠0.
- [Section 4, proof of Theorem 4.1] The induction step does not correctly handle the grid indices. In the induction hypothesis the author writes T_i(0) using z_{n-s_{k-j}}, but formula (18) for the value at level i should involve z_{i-s_{k-j}}; the displayed expression in the proof has n in place of i. This makes the claimed comparison of coefficients between T_n(0) and the right-hand side of Eq. (19) unjustified. Moreover, the bijection between P_{n,i} and subsets X of [n] with |B_1|=n-i does not by itself account for the product of q-binomial coefficients and the p-values attached to all blocks, so the coefficient identity is not proven.
- [Section 4, Proposition 4.2] The proof of recurrence (20) is not valid as written. The passage from Eq. (19) to (20) is described by 'Substituting T_i(0) by f_{i,q} and replacing p_{n-i}(z_i) by -1', but f_{i,q} was defined as the number of monomials in the constant term, and no argument is given that this number equals the result of evaluating the algebraic expression T_i(0) at p_{n-i}(z_i)=-1. The substitution is a formal manipulation without combinatorial justification, and the recurrence is therefore not derived from the Goncharov constant-term construction. Since Proposition 4.3 depends directly on (20), the q-Fubini formula is not a valid consequence of the paper's arguments as presented.
minor comments (5)
- [Abstract] The first sentence of the abstract is grammatically incomplete; it would be better to rewrite as a full sentence, e.g., 'We connect the generalized Goncharov polynomials... with binomial enumeration and order statistics.'
- [Theorem 3.1] The proof of Theorem 3.1 is only a reference sketch ('follow the same technique adopted in [5], section 2, by replacing n! with [n]_q!'). Since uniqueness and existence are used throughout the paper, a more detailed argument would improve readability and verifiability.
- [Section 2, Definition 2.2] The notation \tilde g_n(x) in Eq. (2) is not motivated before its use; the reader must infer that the condition \tilde g_n(0)=0 is a normalization for the basic sequence. A brief explanatory sentence would clarify why this condition appears.
- [Section 4, Proposition 4.2] The phrase 'number of monomials in this constant term' is ambiguous because t_{n,q}(0) is a scalar, not a polynomial in a variable; if the intended meaning is a count of terms in the expansion (18), this should be stated precisely.
- [Throughout] There are numerous typographical and formatting issues, including inconsistent use of \binom{n}{i}_q versus [n choose i]_q, and the corrupted brace characters in Section 3.7. These should be corrected in a final revision.
Circularity Check
No circularity found: the q-Fubini formula is derived from recurrence (20) and Theorem 4.1 rather than assumed as an input.
full rationale
The paper's derivation chain is not circular. The q-Goncarov polynomials are introduced by the q-biorthogonality condition (7), expressed in the basic-polynomial basis by Proposition 3.8, and Theorem 4.1 solves the resulting recurrence (19) by induction over ordered partitions. Proposition 4.2 then converts that solution into recurrence (20) by substituting p=-1, and Proposition 4.3 reads off the ordered-partition formula (21). No step assumes the q-Fubini formula as an input, and no fitted parameter or data set is repackaged as a prediction. The paper contains no self-citations and does not invoke a same-author uniqueness theorem to force a choice. The reviewer's objection that Eq. (19) uses the unproven condition p_n(0)=0 for all n≥1, stated at Section 4 just before Eq. (19), is a correctness risk rather than a circularity: an unsupported premise can invalidate a derivation without making it circular. The circularity score is therefore 0.
Assumptions & free parameters
assumptions (3)
- standard math Ismail's q-umbral calculus: every q-delta operator has a unique basic sequence satisfying \partial_q p_n = [n]_q p_{n-1} and \tilde g_n(0)=0.
- domain assumption The q-translation E^a_q is an invertible q-shift-invariant operator and E^a_q E^b_q = E^{a⊕b}_q.
- ad hoc to paper The basic sequence (p_n(x)) satisfies p_n(0)=0 for all n≥1.
Cite this review
Pith. "Pith review of A New Formula of q-Fubini Numbers via Goncharov polynomials." pith.science (2026). https://pith.science/paper/74YROP34
@misc{pith2026190806939,
author = {Pith},
title = {Pith review of: A New Formula of q-Fubini Numbers via Goncharov polynomials},
year = {2026},
howpublished = {\url{https://pith.science/paper/74YROP34}},
note = {Machine review of arXiv:1908.06939}
}
abstract
Connected the generalized Goncharov polynomials associated to a pair ($\partial,\mathcal{Z}$) if a delta operator $\partial$ and an interpolation grid $\mathcal{Z}$, introduced by Lorentz, Tringali and Yan in [7], with the theory of binomial enumeration and order statistics, a new $q$-deformed of these polynomials given in this paper allows us to derive a new combinatorial formula of $q$-Fubini numbers. A combinatorial proof and some nice algebraic and analytic properties have been expanded to the $q$-deformed version.
Reference graph
Works this paper leans on
-
[1]
G. Andrews, R. Askey, R. Roy, Special Functions. Cambridge un iversity press, Cambridge (1999)
work page 1999
-
[2]
M. E. H. Ismail, An Operator Calculus for or the Askey-Wilson oper ator. Ann. Combin. 5,333-348 1 (2001)
work page 2001
-
[3]
M. E. H. Ismail, Classical and quantum orthogonal polynomials in on e variable, Encyclopedia of Mathematics and its Applications, vol. 98, Cambridge University Press, Cambridge, 2009
work page 2009
-
[4]
W. P. Johnson, q-Extensions of identities of Abel-Rothe type, Discrete Mathematic s 159 (1996), pp. 161-177
work page 1996
- [5]
-
[6]
J.P.S. Kung, X. Sun, C.H. Yan, Gon˘ carov-Type Polynomials and Ap- plications in Combinatorics, preprint, 2006. (Available at the url http://www.math.tamu.edu/∼cyan/Files/DGP.pdf.)
work page 2006
-
[7]
R. Lorentz, S. Tringali, C.H. Yan, Generalized Gon˘ carov polynomials, S. Butler, et al. (Eds.), Connections in Discrete Mathematics : A Celebration of the Work of Ron Graham, Cambridge University Press, Cambridge, 2018, pp. 56 -85
work page 2018
-
[8]
N. J. A. Sloane and S. Plouffe, ”The Encyclopedia of Integer Sequ ences,” Academic Press, San Diego, CA, 1995
work page 1995
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.