Gon\v{c}arov Polynomials in Partition Lattices and Exponential Families

Ayomikun Adeniran; Catherine Yan

arxiv: 1907.07814 · v1 · pith:WDUEB5ILnew · submitted 2019-07-17 · 🧮 math.CO

Gonv{c}arov Polynomials in Partition Lattices and Exponential Families

Ayomikun Adeniran , Catherine Yan This is my paper

Pith reviewed 2026-05-24 20:01 UTC · model grok-4.3

classification 🧮 math.CO

keywords Gončarov polynomialspartition latticesexponential familiesvector parking functionscombinatorial interpretationdelta operatorsfinite operator calculus

0 comments

The pith

Any sequence of generalized Gončarov polynomials admits a combinatorial interpretation as weight enumerators in partition lattices and as enumerators of enriched vector parking functions.

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

The paper aims to provide a complete combinatorial interpretation for generalized Gončarov polynomials defined via any delta operator and interpolation grid. It first realizes them as weight enumerators on the partition lattice of a finite set. It then gives a concrete realization within exponential families where the polynomials count various enriched structures related to vector parking functions. This interpretation connects the algebraic theory from finite operator calculus to concrete counting problems in combinatorics. A reader would care because it offers a uniform way to understand these polynomials through enumeration of combinatorial objects.

Core claim

Generalized Gončarov polynomials associated to a pair (Δ, Z) can be realized as weight enumerators in partition lattices, and more concretely in exponential families they enumerate enriched structures of vector parking functions.

What carries the argument

The weight enumerator on the partition lattice, which uses the delta operator and grid to assign weights to set partitions and thereby equals the generalized Gončarov polynomial.

Load-bearing premise

Any delta operator and interpolation grid pair admits a uniform realization as weight enumerators on the partition lattice without additional restrictions.

What would settle it

Compute the generalized Gončarov polynomial for a chosen delta operator and grid on small sets, then compute the corresponding weight enumerator on the partition lattice and check if they match for all values.

read the original abstract

Classical Gon\v{c}arov polynomials arose in numerical analysis as a basis for the solutions of the Gon\v{c}arov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. By replacing the differentiation operator with a delta operator and using the theory of finite operator calculus, Lorentz, Tringali and Yan introduced the sequence of generalized Gon\v{c}arov polynomials associated to a pair $(\Delta, Z)$ of a delta operator $\Delta$ and an interpolation grid $Z$. Generalized Gon\v{c}arov polynomials share many nice algebraic properties and have a connection with the theories of binomial enumeration and order statistics. In this paper we give a complete combinatorial interpretation for any sequence of generalized Gon\v{c}arov polynomials. First, we show that they can be realized as weight enumerators in partition lattices. Then, we give a more concrete realization in exponential families and show that these polynomials enumerate various enriched structures of vector parking functions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper supplies explicit weight-enumerator models for generalized Gončarov polynomials on partition lattices and in exponential families, extending the 2017 algebraic definition to any (Δ, Z) pair.

read the letter

The main takeaway is that the authors realize generalized Gončarov polynomials as weighted sums over partitions and then as enumerators of enriched structures in exponential families that count variants of vector parking functions. This moves the 2017 Lorentz-Tringali-Yan algebraic setup into concrete combinatorial territory for arbitrary delta operators and grids. The lattice model derives weights directly from the operator action and the grid sequence, while the exponential-family version makes the counting more explicit and ties back to known parking-function objects. Both realizations are presented as independent of the original polynomial definition, which avoids circularity. The connection to binomial enumeration and order statistics is handled naturally through the existing theory. The constructions appear to deliver what the abstract promises without obvious fitting or invented parameters. One soft spot is the universality claim: the stress-test note correctly flags that the weight functions must be well-defined for every admissible (Δ, Z) without hidden restrictions such as positivity or monotonicity on the basic sequence. If the explicit formulas in the partition-lattice section impose extra conditions that fail for some delta operators, the “any sequence” statement would need qualification. The abstract asserts completeness, so the proofs presumably address this, but the weight definition itself would need checking for edge cases. This work sits squarely in enumerative combinatorics for readers already comfortable with finite operator calculus and parking functions. It fills a gap left by the prior algebraic paper and gives usable models rather than just existence statements. A serious referee should see it to verify the constructions and confirm the scope of the universality claim.

Referee Report

2 major / 1 minor

Summary. The manuscript claims to furnish complete combinatorial interpretations for every sequence of generalized Gončarov polynomials G_n(x; Δ, Z) associated to an arbitrary delta operator Δ and interpolation grid Z. It first realizes the polynomials as weight enumerators on the partition lattice Π_n and then supplies a more concrete realization inside exponential families, where the polynomials count enriched structures on vector parking functions.

Significance. If the claimed realizations are uniform and free of hidden restrictions on Δ or Z, the work would supply a direct combinatorial bridge between finite operator calculus and the enumeration of parking-function-like objects, extending known algebraic properties into explicit counting interpretations on lattices and families. The dual realizations (lattice weights followed by exponential-family enrichment) constitute a concrete strength.

major comments (2)

[partition lattices realization] Partition-lattice section: the weight function w on Π_n is asserted to realize G_n(x; Δ, Z) for every admissible pair (Δ, Z) without further restrictions, yet the construction is not shown to remain well-defined when the basic sequence of Δ lacks non-negative coefficients or when Z fails to be strictly increasing; this generality is load-bearing for the abstract's 'any sequence' claim.
[exponential families realization] Exponential-families section: the passage from the lattice weights to the enumeration of enriched vector parking functions is presented as immediate, but no explicit bijection or weight-preserving map is supplied that works for arbitrary Δ; without this step the second realization does not independently confirm the first.

minor comments (1)

[introduction] Notation for the pair (Δ, Z) is introduced in the abstract but the precise dependence of the weight function on the action of Δ is not restated when the lattice construction begins.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for highlighting points where additional clarification would strengthen the manuscript. We address each major comment below.

read point-by-point responses

Referee: [partition lattices realization] Partition-lattice section: the weight function w on Π_n is asserted to realize G_n(x; Δ, Z) for every admissible pair (Δ, Z) without further restrictions, yet the construction is not shown to remain well-defined when the basic sequence of Δ lacks non-negative coefficients or when Z fails to be strictly increasing; this generality is load-bearing for the abstract's 'any sequence' claim.

Authors: The weight function on Π_n is defined algebraically via the action of the delta operator Δ on the poset and the values of the grid Z; this construction is formal and remains well-defined in the polynomial ring for any delta operator (whose basic sequence may carry signed coefficients) and any grid Z. Non-negativity of coefficients and monotonicity of Z are needed only to guarantee a positive combinatorial count, not for the algebraic identity itself. We will insert a short clarifying paragraph after the definition of w to state the precise domain of validity and to note that the abstract claim refers to the algebraic realization for arbitrary admissible (Δ, Z). revision: partial
Referee: [exponential families realization] Exponential-families section: the passage from the lattice weights to the enumeration of enriched vector parking functions is presented as immediate, but no explicit bijection or weight-preserving map is supplied that works for arbitrary Δ; without this step the second realization does not independently confirm the first.

Authors: The second realization is obtained by transporting the lattice weights through the standard exponential formula that equates weighted set partitions with structures in an exponential family. While this transport is canonical once the lattice weights are fixed, we agree that spelling out the explicit weight-preserving correspondence for a general delta operator would make the argument self-contained. In the revised version we will add a dedicated paragraph (or short subsection) that describes the map from weighted partitions to enriched vector parking functions, verifying that the weights are preserved for arbitrary Δ. revision: yes

Circularity Check

0 steps flagged

Minor self-citation on prior algebraic definition; new combinatorial realizations are independent

full rationale

The paper cites Lorentz, Tringali and Yan (with author overlap on Yan) solely for the prior algebraic definition of generalized Gončarov polynomials associated to (Δ, Z). The central claims consist of independent constructions: realizing the polynomials as weight enumerators on the partition lattice Π_n and then in exponential families enumerating enriched vector parking functions. These realizations are presented as direct constructions from the action of Δ and the grid Z, with no indication that the weights or enumerators are defined in terms of the target polynomials themselves or that any counts reduce to fitted parameters by construction. The derivation chain for the interpretations is therefore self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The paper rests on the prior definition of generalized Gončarov polynomials via finite operator calculus (cited Lorentz-Tringali-Yan work) and the standard theory of partition lattices and exponential families; no new free parameters or invented entities are visible from the abstract.

pith-pipeline@v0.9.0 · 5693 in / 993 out tokens · 16615 ms · 2026-05-24T20:01:24.167383+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

19 extracted references · 19 canonical work pages

[1]

J. L. Frank and J. K. Shaw, Abel-Goncarov polynomial expansions, J. Approx. Theory 10 (1974), No. 1, 6-22

work page 1974
[2]

V. L. Gonˇ carov, Recherches sur les d´ eriv´ ees successives des fonctions analytiques. Etude des valeurs que les d´ eriv´ ees prennent dans une suite de domaines, Bull. Acad. Sc. Leningrad (1930), 73-104

work page 1930
[3]

V. L. Gonˇ carov, The Theory of Interpolation and Approximation of Functions , Gostekhiz- dat: Moscow, 1954

work page 1954
[4]

Haslinger, Abel-Goncarov polynomial expansions in spaces of holomorp hic functions , J

F. Haslinger, Abel-Goncarov polynomial expansions in spaces of holomorp hic functions , J. Lond. Math. Soc. (2) 21 (1980), No. 3, 487-495

work page 1980
[5]

Henle, Binomial enumeration on dissects , Trans

M. Henle, Binomial enumeration on dissects , Trans. Amer. Math. Soc. 202 (1975), 1-39

work page 1975
[6]

Joni and G.-C

S.A. Joni and G.-C. Rota, Coalgebras and bialgebras in Combinatorics , Umbral calculus and Hopf algebras (Norman, Okla., 1978), Contemp. Math., 6, Amer. Ma th. Soc., Providence, R.I., 1982, 1–47

work page 1978
[7]

A. G. Konheim and B. Weiss, An occupancy discipline and applications , SIAM J. Appl. Math. 14 (1966), No. 6, 1266-1274

work page 1966
[8]

Kung, A probabilistic interpretation of the Gonˇ carov and relate d polynomials , J

J.P.S. Kung, A probabilistic interpretation of the Gonˇ carov and relate d polynomials , J. Math. Anal. Appl. 79 (1981), 349–351

work page 1981
[9]

J. P. S. Kung and C. Yan, Goncarov polynomials and parking functions , J. Combin. Theory Ser. A 102 (2003), No. 1, 16-37

work page 2003
[10]

Levinson, The Gontcharoﬀ polynomials , Duke Math

N. Levinson, The Gontcharoﬀ polynomials , Duke Math. J. 11 (1944), No. 4, 729-733

work page 1944
[11]

Lorentz, S

R. Lorentz, S. Tringali, C. Yan, Generalized Goncarov polynomials, S. Butler et al. (Eds.), Connections in Discrete Mathematics: A Celebration of the Work of R on Graham, Cam- bridge University Press, Cambridge, 2018, 56–85

work page 2018
[12]

Mullin, G.-C

R. Mullin, G.-C. Rota, On the foundations of combinatorial theory. III. Theory of b ino- mial enumeration . 1970 Graph Theory and its Applications (Proc. Advanced Sem., Mat h. Research Center, Univ. of Wisconsin, Madison, Wis., 1969) pp. 167- 213 Academic Press, New York

work page 1970
[13]

The On-Line Encyclopedia of Integer Sequences, https://oeis .org

work page
[14]

Ray, Umbral calculus, binomial enumeration and chromatic polyn omials, Trans

N. Ray, Umbral calculus, binomial enumeration and chromatic polyn omials, Trans. Amer. Math. Soc. 309 (1988), No. 1, 191-213

work page 1988
[15]

G.-C. Rota, D. Kahaner, and A. Odlyzko, On the foundations of combinatorial theory. VII. Finite operator calculus , J. Math. Anal. Appl. 42 (1973), No. 3, 684-760

work page 1973
[16]

R. P. Stanley, Enumerative combinatorics. Vol. 2. Cambridge St udies in Advanced Mathe- matics, 62. Cambridge University Press, Cambridge, 1999

work page 1999
[17]

J. M. Whittaker, Interpolatory function theory , Cambridge Tracts in Math. and Math. Physics 33, Cambridge University Press: Cambridge, 1935

work page 1935
[18]

H. S. Wilf, generatingfunctionology. Third edition. A K Peters, Ltd., Wellesley, MA, 2006

work page 2006
[19]

Yan, Parking Functions, M

C. Yan, Parking Functions, M. B´ ona (ed.),Handbook of Enumerative Combinatorics , Dis- crete Math. Appl., CRC Press Boca Raton, FL, 2015, 835–893. 18

work page 2015

[1] [1]

J. L. Frank and J. K. Shaw, Abel-Goncarov polynomial expansions, J. Approx. Theory 10 (1974), No. 1, 6-22

work page 1974

[2] [2]

V. L. Gonˇ carov, Recherches sur les d´ eriv´ ees successives des fonctions analytiques. Etude des valeurs que les d´ eriv´ ees prennent dans une suite de domaines, Bull. Acad. Sc. Leningrad (1930), 73-104

work page 1930

[3] [3]

V. L. Gonˇ carov, The Theory of Interpolation and Approximation of Functions , Gostekhiz- dat: Moscow, 1954

work page 1954

[4] [4]

Haslinger, Abel-Goncarov polynomial expansions in spaces of holomorp hic functions , J

F. Haslinger, Abel-Goncarov polynomial expansions in spaces of holomorp hic functions , J. Lond. Math. Soc. (2) 21 (1980), No. 3, 487-495

work page 1980

[5] [5]

Henle, Binomial enumeration on dissects , Trans

M. Henle, Binomial enumeration on dissects , Trans. Amer. Math. Soc. 202 (1975), 1-39

work page 1975

[6] [6]

Joni and G.-C

S.A. Joni and G.-C. Rota, Coalgebras and bialgebras in Combinatorics , Umbral calculus and Hopf algebras (Norman, Okla., 1978), Contemp. Math., 6, Amer. Ma th. Soc., Providence, R.I., 1982, 1–47

work page 1978

[7] [7]

A. G. Konheim and B. Weiss, An occupancy discipline and applications , SIAM J. Appl. Math. 14 (1966), No. 6, 1266-1274

work page 1966

[8] [8]

Kung, A probabilistic interpretation of the Gonˇ carov and relate d polynomials , J

J.P.S. Kung, A probabilistic interpretation of the Gonˇ carov and relate d polynomials , J. Math. Anal. Appl. 79 (1981), 349–351

work page 1981

[9] [9]

J. P. S. Kung and C. Yan, Goncarov polynomials and parking functions , J. Combin. Theory Ser. A 102 (2003), No. 1, 16-37

work page 2003

[10] [10]

Levinson, The Gontcharoﬀ polynomials , Duke Math

N. Levinson, The Gontcharoﬀ polynomials , Duke Math. J. 11 (1944), No. 4, 729-733

work page 1944

[11] [11]

Lorentz, S

R. Lorentz, S. Tringali, C. Yan, Generalized Goncarov polynomials, S. Butler et al. (Eds.), Connections in Discrete Mathematics: A Celebration of the Work of R on Graham, Cam- bridge University Press, Cambridge, 2018, 56–85

work page 2018

[12] [12]

Mullin, G.-C

R. Mullin, G.-C. Rota, On the foundations of combinatorial theory. III. Theory of b ino- mial enumeration . 1970 Graph Theory and its Applications (Proc. Advanced Sem., Mat h. Research Center, Univ. of Wisconsin, Madison, Wis., 1969) pp. 167- 213 Academic Press, New York

work page 1970

[13] [13]

The On-Line Encyclopedia of Integer Sequences, https://oeis .org

work page

[14] [14]

Ray, Umbral calculus, binomial enumeration and chromatic polyn omials, Trans

N. Ray, Umbral calculus, binomial enumeration and chromatic polyn omials, Trans. Amer. Math. Soc. 309 (1988), No. 1, 191-213

work page 1988

[15] [15]

G.-C. Rota, D. Kahaner, and A. Odlyzko, On the foundations of combinatorial theory. VII. Finite operator calculus , J. Math. Anal. Appl. 42 (1973), No. 3, 684-760

work page 1973

[16] [16]

R. P. Stanley, Enumerative combinatorics. Vol. 2. Cambridge St udies in Advanced Mathe- matics, 62. Cambridge University Press, Cambridge, 1999

work page 1999

[17] [17]

J. M. Whittaker, Interpolatory function theory , Cambridge Tracts in Math. and Math. Physics 33, Cambridge University Press: Cambridge, 1935

work page 1935

[18] [18]

H. S. Wilf, generatingfunctionology. Third edition. A K Peters, Ltd., Wellesley, MA, 2006

work page 2006

[19] [19]

Yan, Parking Functions, M

C. Yan, Parking Functions, M. B´ ona (ed.),Handbook of Enumerative Combinatorics , Dis- crete Math. Appl., CRC Press Boca Raton, FL, 2015, 835–893. 18

work page 2015