On Boolean polynomials and the Union-Closed Conjecture

Mario DeFranco

arxiv: 2606.26191 · v1 · pith:2GYQ5NNCnew · submitted 2026-06-24 · 🧮 math.CO

On Boolean polynomials and the Union-Closed Conjecture

Mario DeFranco This is my paper

Pith reviewed 2026-06-26 01:56 UTC · model grok-4.3

classification 🧮 math.CO

keywords Union-Closed ConjectureBoolean polynomialsIntersection-Closed Conjectureset familiescombinatorics

0 comments

The pith

Boolean polynomial ICC_{m,n}(X) is zero precisely when the Union-Closed Conjecture holds for m subsets of an n-element set.

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

The paper constructs a Boolean polynomial ICC_{m,n}(X) for given m and n. It proves that this polynomial is identically zero if and only if the Union-Closed Conjecture holds for every family of m subsets of an n-element universe. The proof uses an equivalent statement known as the Intersection-Closed Conjecture. A reader would care because this equivalence converts a combinatorial conjecture into an algebraic question about polynomial identity.

Core claim

For a set of m subsets of a universe set of size n, the Union-Closed Conjecture is true for this m and n if and only if ICC_{m,n}(X) is the zero Boolean polynomial, where ICC_{m,n}(X) is constructed from the equivalent Intersection-Closed Conjecture.

What carries the argument

The Boolean polynomial ICC_{m,n}(X) encoding the Intersection-Closed Conjecture for m and n.

If this is right

Verifying the Union-Closed Conjecture for fixed m and n is equivalent to checking if ICC_{m,n}(X) is the zero polynomial.
A non-zero ICC_{m,n}(X) yields a counterexample family to the conjecture.
Results about Boolean polynomials can be applied directly to the conjecture via this encoding.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Computer algebra tools could be used to test whether ICC_{m,n}(X) is zero for small m and n.
The construction suggests a possible route to proving the conjecture by showing the polynomial vanishes using algebraic techniques.
This method of encoding set conjectures as polynomial identities may apply to related problems in extremal combinatorics.

Load-bearing premise

The Intersection-Closed Conjecture is equivalent to the Union-Closed Conjecture and the polynomial ICC_{m,n}(X) correctly encodes the conditions of the former.

What would settle it

A specific m and n for which ICC_{m,n}(X) is not the zero polynomial but every family of m subsets of n elements satisfies the Union-Closed Conjecture, or the reverse situation.

read the original abstract

For a set of $m$ subsets of a universe set of size $n$, we construct a Boolean polynomial $\mathrm{ICC}_{m,n}(X)$ such that the Union-Closed Conjecture is true for this $m$ and $n$ if and only if $\mathrm{ICC}_{m,n}(X)$ is the zero Boolean polynomial. We use an equivalent formulation, called the Intersection-Closed Conjecture.

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

This paper claims a Boolean polynomial reformulation of the Union-Closed Conjecture but shows no details in the abstract.

read the letter

The one thing to know is that this paper claims to build a Boolean polynomial ICC_m,n(X) that is the zero polynomial exactly when the Union-Closed Conjecture holds for m subsets of an n-element set, by way of an equivalent intersection-closed statement.

What is actually new here is the concrete link to this polynomial construction for the conjecture.

It does reasonably well at suggesting an algebraic reformulation that could be explored with tools from algebra.

The soft spots are that no construction is given, no equations, and no proof of the equivalence is visible in the abstract. This makes it impossible to check whether the encoding is faithful or if it adds anything beyond restating the problem in polynomial language. If the full paper has those details and they check out without hidden assumptions, then the central claim would hold up.

The math and data aspects aren't applicable here since it's a theoretical reformulation, and citations aren't listed.

This paper is for specialists working on the Union-Closed Conjecture who might want to see if this polynomial viewpoint leads to new attacks or computations.

It deserves a serious referee to verify the construction and see if the equivalence is non-trivial.

I would not cite it in my own work unless the details prove interesting or lead to a resolution.

Bring to reading group only after seeing the full construction.

Recommendation: Yes, it should go to peer review rather than desk reject, as the reformulation idea is worth checking even if it needs substantial revision to include the missing steps.

Referee Report

1 major / 0 minor

Summary. The manuscript asserts the construction of a Boolean polynomial ICC_{m,n}(X) for any m subsets of an n-element universe such that the Union-Closed Conjecture holds for these parameters if and only if ICC_{m,n}(X) is the zero polynomial; the construction proceeds via an equivalent Intersection-Closed Conjecture formulation.

Significance. A correct algebraic encoding of this form would recast the Union-Closed Conjecture as a question about the vanishing of a specific Boolean polynomial, which could in principle enable new proof strategies via computer algebra systems or Boolean ring theory. The absence of any explicit construction, equations, or verification steps in the manuscript prevents evaluation of whether this potential is realized.

major comments (1)

[Abstract] Abstract: the central claim states that ICC_{m,n}(X) is constructed so that the Union-Closed Conjecture holds for given m and n precisely when the polynomial is identically zero, yet no definition of ICC_{m,n}(X), no derivation steps, and no proof of the equivalence are supplied. Without these, the if-and-only-if statement cannot be checked.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their report. We agree that the submitted manuscript omits the explicit definition of ICC_{m,n}(X), the derivation steps, and the proof of equivalence, which prevents verification of the central claim.

read point-by-point responses

Referee: [Abstract] Abstract: the central claim states that ICC_{m,n}(X) is constructed so that the Union-Closed Conjecture holds for given m and n precisely when the polynomial is identically zero, yet no definition of ICC_{m,n}(X), no derivation steps, and no proof of the equivalence are supplied. Without these, the if-and-only-if statement cannot be checked.

Authors: We agree with the referee. The submitted version does not supply the definition of the Boolean polynomial ICC_{m,n}(X), the derivation from the Intersection-Closed Conjecture, or the proof that its vanishing is equivalent to the Union-Closed Conjecture holding for the given m and n. This was an omission during manuscript preparation. In the revised version we will include the full explicit construction, all intermediate equations, and the complete equivalence proof. revision: yes

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper states that it constructs the Boolean polynomial ICC_{m,n}(X) such that the Union-Closed Conjecture holds for given m and n precisely when this polynomial is identically zero, via an equivalent Intersection-Closed formulation. This is presented as an explicit construction of an equivalent statement. No equations, derivations, self-citations, fitted parameters, or ansatzes are supplied in the available text that would allow any load-bearing step to reduce to its own inputs by construction. The central claim is therefore an encoding rather than a derivation that collapses into a tautology or self-reference.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract only; no explicit free parameters, additional axioms, or invented entities are described beyond the stated equivalence to the Intersection-Closed Conjecture.

axioms (1)

domain assumption The Intersection-Closed Conjecture is equivalent to the Union-Closed Conjecture.
Invoked in the abstract as the formulation used to construct the polynomial.

pith-pipeline@v0.9.1-grok · 5578 in / 1051 out tokens · 21177 ms · 2026-06-26T01:56:51.800903+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

2 extracted references · 2 canonical work pages · 1 internal anchor

[1]

The journey of the union-closed sets conjecture

Bruhn, Henning; Schaudt, Oliver (2015). “The Journey of the Union-Closed Sets Conjecture”. Graphs and Combinatorics. 31 (6): 2043?2074. arXiv:1309.3297. doi:10.1007/s00373-014-1515-0

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/s00373-014-1515-0 2015
[2]

and Zamaraev, Viktor (2024) Union-closed sets and Horn Boolean functions

Lozin, Vadim V. and Zamaraev, Viktor (2024) Union-closed sets and Horn Boolean functions. Journal of Combinatorial Theory, Series A, 202 . 105818. doi:10.1016/j.jcta.2023.105818 ISSN 0097-3165. 7

work page doi:10.1016/j.jcta.2023.105818 2024

[1] [1]

The journey of the union-closed sets conjecture

Bruhn, Henning; Schaudt, Oliver (2015). “The Journey of the Union-Closed Sets Conjecture”. Graphs and Combinatorics. 31 (6): 2043?2074. arXiv:1309.3297. doi:10.1007/s00373-014-1515-0

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/s00373-014-1515-0 2015

[2] [2]

and Zamaraev, Viktor (2024) Union-closed sets and Horn Boolean functions

Lozin, Vadim V. and Zamaraev, Viktor (2024) Union-closed sets and Horn Boolean functions. Journal of Combinatorial Theory, Series A, 202 . 105818. doi:10.1016/j.jcta.2023.105818 ISSN 0097-3165. 7

work page doi:10.1016/j.jcta.2023.105818 2024