Cointeraction on noncrossing partitions and related polynomial invariants

Lo\"ic Foissy (LMPA)

REVIEW 1 major objections 6 minor 15 references

Cointeraction on noncrossing partitions and related polynomial invariants

T0 review · 1 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

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

Pith's one-line read The paper establishes that the double bialgebra on noncrossing partitions has a unique polynomial invariant that counts valid colorations and determines the antipode.

desk verdict Solid, detailed paper whose central polynomial invariant has a genuine combinatorial interpretation; the main caveat is a theorem imported from an unpublished preprint, not a flaw in the paper's own logic. read the letter →

arxiv 2501.18212 v2 pith:GIAQ64VZ submitted 2025-01-30 math.CO

Loïc Foissy (LMPA) This is my paper · ORCID

classification math.CO MSC 16T0516T3005A17

keywords noncrossingpartitionscointeractingbialgebraspolynomialinvariantsvalidcolorationsantipodeCatalannumbersRiordanarraysextraction-contractioncoproduct

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

Noncrossing partitions—ways of grouping points on a line into blocks so that blocks never interlace—carry two compatible coalgebra structures: one splits a partition by nested ideals, the other fuses blocks. The paper establishes that, because these two structures interact as a double bialgebra, there is exactly one polynomial invariant $\varphi_{NCP}$ respecting both the product and both decompositions. This invariant counts, at each integer $N$, the valid $N$-colorations of the blocks: colors strictly increase along nesting, and equal-colored blocks must be separated by a lower-colored block. Evaluated at $-1$, it gives a character $\mu_{NCP}$ such that the antipode is $S=(\mu_{NCP}\otimes\mathrm{Id})\circ\delta$, and the paper derives explicit formulas linking the invariant to Catalan numbers, harmonic sums, Riordan arrays, and coefficients of compositional inversion of formal power series.

What carries the argument

The load-bearing object is the double bialgebra structure on $K[\mathrm{NCP}]$: two multiplicative coproducts, $\Delta$ (separation of a partition along ideals of the nesting order) and $\delta$ (extraction-contraction, fusing blocks by an equivalence relation), interacting through $(\Delta\otimes\mathrm{Id})\circ\delta = m_{1,3,24}\circ(\delta\otimes\delta)\circ\Delta$. This interaction makes $K[\mathrm{NCP}]$ a bialgebra in the category of right comodules over itself, and a general theorem for connected double bialgebras then yields the unique morphism $\varphi_{NCP}:K[\mathrm{NCP}]\to K[X]$ by the formula $\varphi_{NCP}(x)=\sum_{k\ge 1}\varepsilon_\delta^{\otimes k}\circ\widetilde{\Delta}^{(k-1)}(x)\,H_k(X)$, where $\widetilde{\Delta}$ is the reduced coproduct of $\Delta$ and $H_k$ are Hilbert polynomials. The combinatorial engine is Proposition 3.1, which identifies each summand with a valid $N$-coloration and turns the invariant into a chromatic-style polynomial; the recursive evaluation rule for $\varphi_{NCP}(\pi)(X+1)$ in terms of the minimal blocks $\mathrm{Base}(\pi)$ then drives the explicit computations of the paper.

What would settle it

For $J_3$, the partition of $\{1,2,3\}$ into three singletons, the paper gives $P_3(X)=X^3-\frac{5}{2}X^2+\frac{3}{2}X$; exhaustive enumeration of valid $N$-colorations of $J_3$ for $N=1,\dots,5$ should produce exactly $P_3(1),\dots,P_3(5)$, and any mismatch would refute Proposition 3.1.

Watch

Extended reading notes

Core claim

The central result is that the polynomial algebra $K[\mathrm{NCP}]$ generated by noncrossing partitions, with product $\cdot$ and two multiplicative coproducts $\Delta$ and $\delta$, is a connected double bialgebra, so it carries a unique double bialgebra morphism $\varphi_{NCP}$ to the polynomial algebra $K[X]$ with $\Delta(X)=X\otimes 1+1\otimes X$ and $\delta(X)=X\otimes X$. Proposition 3.1 gives the combinatorial content: for every noncrossing partition $\pi$, the value $\varphi_{NCP}(\pi)(N)$ is the number of valid $N$-colorations of the blocks of $\pi$, meaning that a block nested inside another receives a strictly smaller color and that two same-colored blocks require a lower-colored block between them when ordered from left to right. From this, the antipode of the Hopf algebra $(K[\mathrm{NCP}],\cdot,\Delta)$ is $S=(\mu_{NCP}\otimes\mathrm{Id})\circ\delta$ with $\mu_{NCP}(\pi)=\varphi_{NCP}(\pi)(-1)$, and $\mu_{NCP}$ takes values that are signed products of Catalan numbers indexed by the connected components of $\pi$. For partitions with no nesting, the paper reduces the computation to one sequence $P_n(X)$, gives a closed recursion for its coefficients in the Hilbert basis, shows its monomial coefficients are governed by exponentiating the Riordan array of $(1+X,X(1+X))$, and identifies the top coefficients through close and nested pairs and linear extensions. It also constructs two related bialgebra morphisms $\Lambda$ and $\Lambda_s$ counting linear and strict linear extensions of the nesting order, proves the duality $\Lambda(\pi)(X)=(-1)^{|\pi|}\Lambda_s(\pi)(-X)$, and shows there is no double bialgebra morphism from $K[\mathrm{NCP}]$ to the hypergraph or mixed-graph double bialgebras sending $J_3$ to a graph.

Load-bearing premise

The proof assumes that the general theorem for connected double bialgebras—existence and uniqueness of the invariant and the antipode formula—applies to $K[\mathrm{NCP}]$; the only nontrivial hypothesis is that repeated reduced coproducts eventually vanish, which the paper says follows from grading by number of blocks but does not prove in detail.

Editorial extensions

If this is right

Since $\mu_{NCP}(\pi)=\varphi_{NCP}(\pi)(-1)$ is a signed product of Catalan numbers, the antipode $S=(\mu_{NCP}\otimes\mathrm{Id})\circ\delta$ can be computed from the fusion coproduct alone, without solving the defining antipode equation.
On the singletons $J_n$, the antipode formula recovers the coefficients of the compositional inverse of a formal power series $x+\sum a_nx^{n+1}$; the paper gives Catalan-number formulas such as the coefficient of $J_1^n$ in $S(J_n)$ being $(-1)^n\,\mathrm{cat}_n$.
For non-nesting partitions, the Hilbert-basis coefficients satisfy $a_{i,n}=\sum_{k=1}^{\lfloor(n+1)/2\rfloor}\binom{n-k+1}{k}a_{i-1,n-k}$, vanish when $n\ge 2i$, and have closed forms involving multiple harmonic sums in the top degrees.
The monomial coefficients of the no-nesting polynomials are obtained by exponentiating the Riordan matrix of $(1+X,X(1+X))$; in particular, the first column of its logarithm is the infinitesimal generator of $X(1+X)$, up to factorials and signs.
The morphisms $\Lambda$ and $\Lambda_s$ count linear and strict linear extensions of the nesting order, and the duality $\Lambda(\pi)(X)=(-1)^{|\pi|}\Lambda_s(\pi)(-X)$ shows that the two counting problems carry equivalent information; both are obtained from $\varphi_{NCP}$ by acting with the characters $\lambda$ and $\lambda_s$.

Reading between the lines

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

A natural testable extension is to read Proposition 3.2 as a deletion-contraction rule and ask whether $\varphi_{NCP}$ extends to a two-variable deletion-contraction invariant of noncrossing partitions that specialises back at one variable.
The observed first failure of alternating signs in $P_n$ at $n=29$ suggests that, despite the graph-chromatic flavour, these polynomials are not chromatic polynomials of any graph family; it would be worth characterising the exceptional indices combinatorially.
Since $\delta$ is homogeneous for the degree $|\pi|-\mathrm{length}(\pi)$, the same cointeraction formalism could attach analogous unique polynomial invariants to other combinatorial species equipped with extraction-contraction operations, such as crossing partitions or graphs; the coloration rules would depend on the nesting or crossing data.
The negative results for hypergraphs and mixed graphs imply that any graphical realisation of $\varphi_{NCP}$ would need a richer class of decorated objects; seeking such a realisation, or proving none exists among all finite combinatorial species, is a concrete open direction.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

The paper's core is the polynomial invariant phi_NCP on noncrossing partitions, uniquely determined by the double bialgebra structure (product plus the two coproducts Delta and delta). What's new is the combinatorial read: phi_NCP(pi)(N) counts N-valid colorings of the blocks, with a nesting condition and a separation condition. That interpretation is not pulled from thin air; it falls out of the reduced coproduct and the recursive formula (Prop 3.2). From there the paper gets real mileage: antipode via the character mu_NCP, Catalan-number products, the no-nesting coefficient formulas tied to harmonic sums, and the Riordan-array exponentiation result. The final table of examples is consistent with the formulas, which is good evidence the internal logic is right.

The soft spot is exactly what the stress-test flags: the existence and uniqueness of phi_NCP (Theorem 1.4) is imported from the author's preprint [9], and the connectedness hypothesis of that theorem is not checked in the text before the theorem is applied. The check is easy — the reduced coproduct lowers the number-of-blocks grading — and later in Section 4.1 the paper says the algebra is connected, but that comes after the fact. A referee should ask for the verification up front, or for a proof or published version of [9]'s theorems. This is a dependency, not a demonstrated error. I did not find an internal contradiction, and the combinatorial interpretation is not circular: it is derived from the axioms, not fitted to the output.

Other than that, the main limitation is structural: many of the coefficient formulas are inductive or generating-function identities, and some manipulations are compressed. But the paper is honest about what is closed-form and what is not. The negative results on hypergraph morphisms are a nice touch, and the link to Faà di Bruno is a clean application.

I would send this to a serious referee. The dependence on [9] needs to be addressed, but the central result is meaningful and the paper has enough detail to check. It is a good contribution to the cointeracting-bialgebra program.

Referee Report

1 major / 6 minor

Summary. The paper studies two cointeracting bialgebra structures on noncrossing partitions: a coproduct by separation of blocks with respect to the nesting order, and a coproduct by fusion of blocks. The central object is the unique double bialgebra morphism φ_NCP from K[NCP] to K[X], whose existence and uniqueness are imported from the author's prior work [9]. The paper gives a combinatorial interpretation of φ_NCP(π) as the number of N-valid colorations of π, derives an inductive recurrence for it, and uses it to compute the antipode of the first bialgebra as S = (μ_NCP ⊗ Id)∘δ, where μ_NCP is the character π ↦ φ_NCP(π)(-1). The paper further studies φ_NCP on noncrossing partitions with no nesting, expressing the resulting polynomials in the Hilbert basis and in the monomial basis, with connections to harmonic nested sums, Riordan arrays, the infinitesimal generator of X(1+X), and generalized Stirling numbers. It also introduces two other bialgebra morphisms Λ and Λ_s counting linear extensions and strict linear extensions, proves a duality principle between them, and shows that no double bialgebra morphism exists from K[NCP] to the double bialgebras of hypergraphs or mixed graphs under a natural combinatorial condition.

Significance. If the external results on which it relies are correct, this is a substantial contribution to the combinatorial Hopf algebra theory of noncrossing partitions. The paper gives an explicit, uniquely determined polynomial invariant with a concrete coloring interpretation, and it connects this invariant to several classical combinatorial objects (Catalan numbers, Stirling numbers, Riordan arrays, formal series inversion), which should be of interest to both combinatorists and free-probabilists. The manuscript is largely self-consistent: the inductive recurrence in Proposition 3.2, the closed formulas for the character μ_NCP in Proposition 3.5, and the coefficient formulas in §3.3 are derived carefully, and the worked examples in the final table match the stated formulas. The main weakness is the reliance on Theorems 1.3 and 1.4 of the author's preprint [9] for the existence, uniqueness, and antipode formula of φ_NCP; these are not re-proved, and the connectedness hypothesis underlying them is not explicitly verified for K[NCP] in the text.

major comments (1)

[§1.2 and §3.1] The construction of the central invariant φ_NCP depends on Theorem 1.4, which is quoted from the author's preprint [9] and concerns connected double bialgebras. The paper does not explicitly verify that K[NCP] satisfies the connectedness hypothesis (local nilpotence of the reduced coproduct \tildeΔ). This is a load-bearing point because the uniqueness in Theorem 1.4, and hence the combinatorial interpretation in Proposition 3.1, relies on it. The verification is simple and should be included: the number-of-blocks grading makes \tildeΔ strictly decrease the block count in each tensor factor, so \tildeΔ^{(k)}(π)=0 for k>|π|. I recommend adding a short proof or at least an explicit statement of this fact before invoking Theorem 1.4.

minor comments (6)

[Title/Abstract] There are several typographical artifacts, such as 'polyn omial' in the running title and 'no ncrossing' in the abstract; these should be corrected.
[Notation 0.1] The notation uses 'rns' in the body text (e.g., 'for any n P N, we denote by rns the set t1,...,nu'), which is presumably a rendering artifact of '[n]'; please ensure consistent use of [n] in the final version.
[Proposition 3.1] In the statement of Proposition 3.1, the notation 'G' appears in 'φ_NCP(G)(n)' but the context indicates this should be the noncrossing partition π; please correct this typo.
[§3.3, proof of Corollary 3.10] The proof ends with 'the result then follows by tedious manipulations of sums'; expanding this step would make the derivation of the formulas for a_{n-2,n} more transparent.
[§5, Proposition 5.1] The first line of Proposition 5.1 contains a garbled symbol 'Let $ P tX, Ău'; this should be typeset correctly (presumably 'Let $ ∈ {X, ⊂}').
[References] The paper cites several OEIS entries by number; since OEIS entries can change or be renumbered, it would be helpful to include the entry names or descriptions as well.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the central invariant is constructed from a general, parameter-free theorem and its combinatorial interpretation is derived, not fitted.

full rationale

The paper's central object, the polynomial invariant φ_NCP, is not fitted to the data it later describes. It is obtained as the unique double bialgebra morphism from K[NCP] to K[X] via the general existence/uniqueness theorem quoted from the author's earlier work [9, Theorem 1.4]. That theorem is stated for arbitrary connected double bialgebras and does not assume the noncrossing-partition result, so invoking it is independent support rather than circularity. In particular, the formula for φ_NCP(π) is the general reduced-coproduct expansion, and Proposition 3.1 then derives the N-valid coloration counting interpretation from that formula rather than defining φ_NCP by those counts. The recurrence in Proposition 3.2 is likewise derived from the already constructed invariant, and the coefficient formulas, antipode formulas, and relations to φ_0, Λ, and Λ_s are all computed from the same constructed object. The only noticeable weakness is that the paper cites [9] for the load-bearing general theorem without reproducing its proof and does not explicitly verify connectedness/local nilpotence of the reduced coproduct for K[NCP], although this is immediate from the number-of-blocks grading. That is a verification and provenance issue, not a reduction of a prediction to its inputs. Accordingly, the circularity score is low and no circular step is identified.

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

No free parameters are fitted; the polynomial invariant is uniquely determined by the double bialgebra axioms. The axioms listed are the background structures and cited theorems that the paper imports.

assumptions (5)

standard math K is a commutative field of characteristic zero
Used throughout to define polynomial algebras, Hilbert polynomials, and to ensure binomial and factorial denominators are valid.
standard math The bosonic Fock functor sends twisted (co/bi)algebras to (co/bi)algebras
The passage from the species Com∘NCP to the algebra K[NCP] relies on this functor, cited to [1] (Aguiar-Mahajan).
domain assumption Theorems 1.3 and 1.4 of [9] on double bialgebras
The existence and uniqueness of φ_NCP, and the antipode formula S=(μ_B⊗Id)∘δ, are imported from Foissy's preprint [9]; the paper verifies the double bialgebra axioms but does not re-prove these theorems.
domain assumption The double bialgebra K[NCP] is connected (locally nilpotent reduced coproduct for ∆)
Needed to apply Theorem 1.4; follows from the grading by number of legs, but is not explicitly proved in the paper.
standard math Noncrossing partitions with the nesting order form a finite poset under the block ordering
The definitions of ideals and colorations depend on this partial order being well-founded; it is a standard property of noncrossing partitions and is used in Lemma 2.5 and throughout.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Cointeraction on noncrossing partitions and related polynomial invariants." pith.science (2026). https://pith.science/paper/GIAQ64VZ

@misc{pith2026250118212,
  author       = {Pith},
  title        = {Pith review of: Cointeraction on noncrossing partitions and related polynomial invariants},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GIAQ64VZ}},
  note         = {Machine review of arXiv:2501.18212}
}

read the original abstract

We study the structure of two cointeracting bialgebras on noncrossing partitions appearing in the theory of free probability. The first coproduct is given by separation of the blocks of the partitions into two parts, with respect to the nestings, while the second one is given by fusion of blocks. This structure implies the existence of a unique polynomial invariant respecting the product and both coproducts. We give a combinatorial interpretation of this invariant, study its values at -1 and use it for the computation of the antipode. We also give several results on its coefficients when applied to noncrossing partitions with no nesting. This leads to unexpected links with harmonic nested sums, Riordan arrays, composition of formal series and generalized Stirling numbers. This polynomial invariant is shown to be related to other ones, counting increasing or strictly increasing maps for the nesting order on noncrossing partitions, through the action of several characters.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

15 extracted references · 14 canonical work pages

[9]

, Bialgebras in cointeraction, the antipode and the eulerian idempotent, arXiv:2201.11974, 2022

arXiv 2022
[1]

29, American Mathematical Society, Providence, RI, 2010, With forewords by Kenneth Brown and Stephen Chase and André Joyal

Marcelo Aguiar and Swapneel Mahajan, Monoidal functors, species and Hopf algebras , CRM Monograph Series, vol. 29, American Mathematical Society, Providence, RI, 2010, With forewords by Kenneth Brown and Stephen Chase and André Joyal

work page 2010
[2]

Biane, Free probability and combinatorics , Proceedings of the international congress of mathematicians, ICM 2002, Beijing, China, August 20–28, 200 2

P. Biane, Free probability and combinatorics , Proceedings of the international congress of mathematicians, ICM 2002, Beijing, China, August 20–28, 200 2. Vol. II: Invited lectures, Beijing: Higher Education Press; Singapore: World Scientiﬁ c/distributor, 2002, pp. 765– 774

work page 2002
[3]

175 (1997), no

Philippe Biane, Some properties of crossings and partitions , Discrete Math. 175 (1997), no. 1-3, 41–53

work page 1997
[4]

Adrian Celestino, Kurusch Ebrahimi-Fard, Frédéric Pat ras, and Daniel Perales, Cumulant- cumulant relations in free probability theory from Magnus’ expansion, Found. Comput. Math. 22 (2022), no. 3, 733–755

work page 2022
[5]

Adrián Celestino, Kurusch Ebrahimi-Fard, and Daniel Pe rales, Relations between inﬁnites- imal non-commutative cumulants , Doc. Math. 26 (2021), 1145–1185 (English)

work page 2021
[6]

Kurusch Ebrahimi-Fard, Loïc Foissy, Joachim Kock, and F rédéric Patras, Operads of (non- crossing) partitions, interacting bialgebras, and moment -cumulant relations, Adv. Math. 369 (2020), 54 (English)

work page 2020
[7]

Pure Appl

Loïc Foissy, Commutative and non-commutative bialgebras of quasi-pose ts and applications to Ehrhart mials , Adv. Pure Appl. Math. 10 (2019), no. 1, 27–63

work page 2019

Show all 15 references

[8]

Electron

, Chromatic polynomials and bialgebras of graphs , Int. Electron. J. Algebra 30 (2021), 116–167

2021
[10]

, Contractions and extractions on twisted bialgebras and col oured Fock functors , arXiv:2301.09447, 2023

2023 arXiv
[11]

, Hopf algebraic structures on hypergraphs and multi-comple xes, arXiv:2304.00810, 2023

2023 arXiv
[12]

, Hopf-algebraic structures on mixed graphs , arXiv:2301.09449, 2023

2023 arXiv
[13]

Alexandru Nica and Roland Speicher, Lectures on the combinatorics of free probability , Lond. Math. Soc. Lect. Note Ser., vol. 335, Cambridge: Cambr idge University Press, 2006 (English)

2006
[14]

217 (2000), no

Rodica Simion, Noncrossing partitions, Discrete Math. 217 (2000), no. 1-3, 367–409

2000
[15]

Neil J. A. Sloane, The on-line encyclopedia of integer sequences , https://oeis.org/. 37

Pith tools

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

[1] [9]

, Bialgebras in cointeraction, the antipode and the eulerian idempotent, arXiv:2201.11974, 2022

arXiv 2022

[2] [1]

29, American Mathematical Society, Providence, RI, 2010, With forewords by Kenneth Brown and Stephen Chase and André Joyal

Marcelo Aguiar and Swapneel Mahajan, Monoidal functors, species and Hopf algebras , CRM Monograph Series, vol. 29, American Mathematical Society, Providence, RI, 2010, With forewords by Kenneth Brown and Stephen Chase and André Joyal

work page 2010

[3] [2]

Biane, Free probability and combinatorics , Proceedings of the international congress of mathematicians, ICM 2002, Beijing, China, August 20–28, 200 2

P. Biane, Free probability and combinatorics , Proceedings of the international congress of mathematicians, ICM 2002, Beijing, China, August 20–28, 200 2. Vol. II: Invited lectures, Beijing: Higher Education Press; Singapore: World Scientiﬁ c/distributor, 2002, pp. 765– 774

work page 2002

[4] [3]

175 (1997), no

Philippe Biane, Some properties of crossings and partitions , Discrete Math. 175 (1997), no. 1-3, 41–53

work page 1997

[5] [4]

Adrian Celestino, Kurusch Ebrahimi-Fard, Frédéric Pat ras, and Daniel Perales, Cumulant- cumulant relations in free probability theory from Magnus’ expansion, Found. Comput. Math. 22 (2022), no. 3, 733–755

work page 2022

[6] [5]

Adrián Celestino, Kurusch Ebrahimi-Fard, and Daniel Pe rales, Relations between inﬁnites- imal non-commutative cumulants , Doc. Math. 26 (2021), 1145–1185 (English)

work page 2021

[7] [6]

Kurusch Ebrahimi-Fard, Loïc Foissy, Joachim Kock, and F rédéric Patras, Operads of (non- crossing) partitions, interacting bialgebras, and moment -cumulant relations, Adv. Math. 369 (2020), 54 (English)

work page 2020

[8] [7]

Pure Appl

Loïc Foissy, Commutative and non-commutative bialgebras of quasi-pose ts and applications to Ehrhart mials , Adv. Pure Appl. Math. 10 (2019), no. 1, 27–63

work page 2019