A Comment on Local Hypercube Inequalities

Keyou Zhuo; Kilar Zhang; Tian-Shun Chen

A Comment on Local Hypercube Inequalities

T0 review · 0 major / 4 minor · reviewed 2026-08-28 · deepseek-v4-flash

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

Pith's one-line read This paper proves analytically that the local hypercube inequalities for higher-dimensional partition charge functions hold in every dimension, replacing the low-dimensional enumeration and Monte Carlo checks used by the earlier…

desk verdict A clean, honest analytic proof of the local hypercube inequalities, replacing computational checks in the generic-weight regime; the resonant case is explicitly left open. read the letter →

arxiv 2608.23667 v1 pith:UIUNX2HA submitted 2026-08-24 math-ph cs.IThep-thmath.COmath.ITmath.MPmath.RT

Keyou Zhuo , Tian-Shun Chen , Kilar Zhang This is my paper · ORCID

classification math-phcs.IThep-thmath.COmath.ITmath.MPmath.RT

keywords higher-dimensionalpartitionchargefunctionlocalhypercubeinequalityBooleanlatticeorderidealcoordinateflipCalabi-Yaurelationintegralgenericity

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

The paper replaces dimension-by-dimension computation with a single analytic argument. It proves that the local pole orders of both odd- and even-dimensional partition charge functions obey a dichotomy: at the top vertex of any local hypercube, the pole order is 1 for exactly two admissible configurations, and is nonpositive for every other configuration, uniformly in the dimension. The translation is combinatorial: each local slice of a partition is a down-set of a Boolean lattice, and the pole order becomes a signed count of its layers. A fixed coordinate flip pairs each positive contribution with a distinct negative one, which yields the inequality without enumeration. If the proof is right, the two earlier constructions are fully analytic in their local parts.

What carries the argument

The load-bearing object is a standard signed statistic on a Boolean lattice. For a down-set $I\subseteq 2^D$, let $E_r$ count elements of reverse rank $r$ and $C_r$ count those that are saturated, meaning all immediate upper neighbours toward $D$ also lie in $I$. The statistic is $\Phi(I)=E_1-\sum_{2\le r\le d,\,r\text{ even}}E_r+\sum_{3\le r\le d,\,r\text{ odd}}C_r$, and the coordinate flip $\tau_j(A)=A\triangle\{j\}$ is the explicit injection that proves $\Phi(I)\le 0$ whenever a coatom is missing. The classification of admissible ideals from Proposition 4.2 connects this statistic to the charge-function pole order, while the extremal ideals $2^D$ and $2^D\setminus\{D\}$ give $\Phi=1$ by the alternating binomial sum.

What would settle it

Compute the local pole order from equation (26) or (28) for an ideal $I\subseteq 2^D$ satisfying the missing-coatom hypothesis; the proof asserts the value is never positive outside the two admissible ideals. Finding even one such ideal with $\omega^{\mathrm{odd}}_{0,\Delta(n)}(\vec q_d)>0$ while $\Delta(n)\notin G(\vec q_d)$, or the even-dimensional analogue, under a weight vector obeying (15) and (16), would refute the dichotomy.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central claim is Theorem 5.1 and Theorem 6.1. Fix a local hypercube direction set $D$ of size $d$, and let $\Delta(n)$ be a partition inside the $0/1$ hypercube over $D$. Assuming the Calabi-Yau relation $\sum_{i=1}^{n} h_i=0$, the integral genericity condition (16), and that star-cluster arms use distinct positive directions, the local pole order $\omega^{\mathrm{odd}}_{0,\Delta(n)}(\vec q_d)$ equals $1$ exactly when $\Delta(n)\in G(\vec q_d)$ and is at most $0$ otherwise; the same holds for the even-dimensional order $\omega^{\mathrm{even}}_{0,\Delta(n)}(\vec q_d)$. Here $G(\vec q_d)$ is the admissible class of partitions with an addable or removable box projecting to the target point. The odd and even cases differ in detail only at the extreme full-dimensional ranks: in odd dimension an unmatched singleton provides the extra negative object, while in even dimension the built-in endpoint terms absorb the same effect.

Load-bearing premise

The proof assumes the integral genericity condition (16): no integer combination of the weights $h_i$ vanishes except integer multiples of the Calabi-Yau relation $\sum_i h_i=0$, so distinct boxes and clusters always project to distinct points; the resonant case with projection multiplicities is explicitly not covered.

Editorial extensions

If this is right

The odd-dimensional local inequality branch, previously enumerated for dimension five and Monte Carlo-tested in dimensions seven and nine, is now proven for every odd $n\ge 3$.
The even-dimensional local inequality branch, previously enumerated for dimension six and sampled in dimension eight, is now proven for every even $n\ge 4$.
The local dichotomy is complete: the equality branches established in the earlier papers, together with the new inequality branches, give exactly the statements of Theorems 5.1 and 6.1.
The proof supplies an explicit matching rather than an existence argument, so the bound can be checked directly on any concrete ideal.
The earlier numerical and Monte Carlo checks remain as independent verifications but are no longer needed for the local inequalities.

Reading between the lines

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

Editorial: the matching lemma does not use the global structure of partitions, so the same flip should work for weighted versions of the statistic as long as the weights respect the rank filtration; the paper suggests this direction but does not prove it.
Editorial: the excluded resonant case, where distinct boxes share the same projection, is the natural next target; a treatment would need to attach multiplicities to direction sets and rework the classification in Proposition 4.3.
Editorial: if the local-to-global reduction in the two earlier charge-function papers goes through as sketched, the full charge-function construction becomes analytic rather than partly numerical, which would make higher-dimensional partition charge functions exactly computable.

Share X Bluesky LinkedIn Reddit HN

Formalized claims in Lean

Claim #1: On the paper's own terms, the central claim is Theorem 5.1 and Theorem 6.1. Fix a local hypercube direction set $D$ of size $d$, and let $\Delta(n)$ be a partition inside the $0/1$ hypercube over $D$. Assuming the Calabi-Yau relation $\sum_{i=1}^{n} h_i=0$, the integral genericity condition (16), and that star-cluster arms use distinct positive directions, the local pole order $\omega^{\mathrm{odd

/-- @claim 1 On the paper's own terms, the central claim is Theorem 5.1 and Theorem 6.1. Fix a local hypercube direction set $D$ of size $d$, and let $\Delta(n)$ be a partition inside the $0/1$ hypercube over $D$. Assuming the Calabi-Yau relation $\sum_{i=1}^{n} h_i=0$, the integral genericity condition (16), and that star-cluster arms use distinct positive directions, the local pole order $\omega^{\mathrm{odd -/
def central_claim : Prop :=

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

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

Dear Colleague,

The thing to know: this comment really does deliver a dimension-independent analytic proof of the two local inequality branches that the earlier charge-function papers had only checked by exhaustive enumeration (dimensions 5 and 6) and Monte Carlo sampling (dimensions 7–9 and 8). The proof is elementary but not trivial, and I found no load-bearing errors.

The new piece is the coordinate-flip injection on Boolean lattice down-sets. They define a signed statistic that mirrors the local pole order. If a coatom is missing, flipping that coordinate maps every positive object (reverse-rank-one elements and saturated odd-rank elements) injectively into the even-rank negative class. Downward moves use the ideal property, upward moves use saturation, and involutivity gives injectivity. The extremal dichotomy follows, and the parity cases reduce to careful endpoint bookkeeping. I checked the odd and even endpoint arguments (Theorems 5.1 and 6.1) and the sign conventions in (26) and (28); they line up.

The paper is honest about its scope. The genericity condition (16) is stated plainly, and Section 4.1 says “The resonant case is not covered.” That is a real limitation: anyone needing the inequalities for resonant weight vectors still has to rely on the older computational evidence. The distinct-arm assumption for star clusters is likewise explicit. These are scope restrictions, not hidden flaws. The dependence on the local-factor conventions of [1,2] is also explicit, and although those papers share authors with this comment, the inequality proof does not use the enumeration or Monte Carlo results it replaces, so there is no circularity.

The only soft spot, in proportion, is that the theorems are conditional on genericity; the paper does not push into the non-generic case. That is acceptable for a comment whose purpose is to fill the generic gap, and it is not a defect in the core argument.

I would send this to a referee. It is a legitimate, careful contribution that turns computational checks into theorems for generic weights, and it is written so that verification is easy. If I worked in that area, I would cite it. The proof could be a nice reading-group example, though it is not a major new theory.

In short: solid, honest, and worth publishing after the usual round of refereeing.

Referee Report

0 major / 4 minor

Summary. This paper supplies dimension-independent analytic proofs of the local hypercube inequalities used in the odd- and even-dimensional partition charge constructions of [1] and [2]. The authors model a local hypercube partition as a down-set of a Boolean lattice, define the signed statistic Phi combining rank counts E_r and saturation counts C_r, and prove a coordinate-flip injection (Theorem 3.2) that pairs every positive contribution with a distinct negative contribution unless the ideal is one of two extremal ideals. They then translate the local-factor conventions of the prior works into the Boolean-layer formulas (26) and (28), classify admissible ideals under the integral genericity condition (16), and state the local dichotomies in Theorem 5.1 (odd case) and Theorem 6.1 (even case). The resonant case is explicitly excluded, as is the case of weights with integer resonances; the proofs are conditional on the genericity assumption and on star-cluster arms being distinct positive coordinate directions.

Significance. If the proofs are correct, the paper closes a real gap: the inequality branches that were previously verified by exhaustive enumeration in low dimensions and Monte Carlo sampling in higher dimensions are now established analytically in all dimensions, in the generic regime. The coordinate-flip matching is an explicit, constructive sign-reversing injection and is presented with enough detail to be checked directly. The treatment of the parity-dependent full-dimensional endpoints is careful, and the common matching theorem with two endpoint corollaries is a clean way to organize the two cases. The principal limitation is the scope: the main theorems are conditional on the integral genericity condition (16) and on the distinct-arm convention, so the proof does not cover resonant weights or multiple arms in the same direction. This limitation is stated explicitly in the manuscript, but it should be made more prominent in the abstract and introduction.

minor comments (4)

[Abstract] The abstract states that the paper gives dimension-independent analytic proofs of the local inequalities, but it does not mention that the proofs are conditional on the integral genericity condition (16) and on the distinct-arm assumption; since these assumptions are load-bearing for Theorems 5.1 and 6.1, they should be stated in the abstract.
[Section 4.3] The derivation of Equations (26) and (28) from the local-factor formulas (25) and (27) is very terse. In particular, the role of the projection parameter c(□_A)+h_S in deciding which star-cluster factors contribute at u=c(q_d) is not fully spelled out, because the factors are written as functions of u alone; a sentence explaining how Proposition 4.3 converts the factor positions into the rank sums would improve readability.
[Section 4.3] The vacuum factor 1/u is mentioned in the text just before Equation (26) but is not displayed or defined explicitly; since it contributes the term 1{d=n} in both parity formulas, it would help to show its origin in the local-factor conventions of [1] and [2].
[Section 7.1] The sentence 'The explicit matching proves both inequality branches in every corresponding dimension' should be qualified with the conditions under which the theorems are valid, namely integral genericity and distinct positive arm directions; as written it could be read as an unconditional statement.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the inequality proof is a self-contained coordinate-flip matching theorem, and the cited prior work supplies only definitions and non-load-bearing context.

full rationale

The derivation is self-contained after quoting the local-factor conventions (25) and (27) from the prior works. The paper explicitly translates those pole-order formulas into Boolean layer counts E_r and C_r (Section 4.3), then proves a standalone combinatorial theorem (Theorem 3.2 and Corollary 3.3) that Phi(I) <= 0 for every non-extremal down-set, with equality only for 2^D and 2^(D setminus {D}). This theorem is proved by an explicit coordinate-flip injection and does not invoke the enumeration or Monte Carlo evidence it replaces; Section 7.1 explicitly says those computations are no longer needed. The only restrictions - integral genericity condition (16) and distinct-arm directions - are stated as assumptions, and the resonant case is explicitly excluded ('The resonant case is not covered' in Section 4.1), which is a scope limitation, not circularity. Citations to the prior works [1,2] supply definitions and equality-branch context, but the equality values are also recomputed in the proofs (for example, the d = n cases), so the central claim does not reduce to a self-citation. No fitted parameter is renamed as a prediction, and no input is defined in terms of the output.

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

No free parameters are fitted and no new physical or mathematical entities are introduced. The proof depends on the genericity condition, the Calabi-Yau relation, the distinct-arm convention, and the exact local-factor conventions from the two prior papers.

assumptions (4)

domain assumption Integral genericity: no resonance sum a_i h_i = 0 except integer multiples of the Calabi-Yau relation (Equation 16).
Explicitly assumed in Lemma 4.1, Propositions 4.2 and 4.3, and Theorems 5.1 and 6.1. The resonant case is excluded in Section 4.1.
domain assumption Calabi-Yau relation sum_{i=1}^n h_i = 0 (Equation 15).
Background from the charge-function constructions of the cited works, used throughout the translation to Boolean layer counts.
domain assumption Star-cluster arms use distinct positive coordinate directions.
Assumed in Theorems 5.1 and 6.1; if repeated directions were allowed, the star statistic and the saturation interpretation would change.
ad hoc to paper The local factor formulas (25) and (27) reproduce the conventions of the prior works [1] and [2].
The paper states these are the local factors of the prior works without re-deriving them; the whole translation to Boolean layer counts depends on their exact form.

how reviews work

0 comments

Cite this review

Pith. "Pith review of A Comment on Local Hypercube Inequalities." pith.science (2026). https://pith.science/paper/UIUNX2HA

@misc{pith2026260823667,
  author       = {Pith},
  title        = {Pith review of: A Comment on Local Hypercube Inequalities},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UIUNX2HA}},
  note         = {Machine review of arXiv:2608.23667}
}

read the original abstract

This comment gives dimension-independent analytic proofs of the local inequalities arising in the odd- and even-dimensional constructions of higher-dimensional partition charge functions. The prior works established these inequalities by exhaustive computation in low dimensions and tested them numerically in selected higher dimensions.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

[1]

Charge functions for odd dimensional partitions

Shang Xiang, Hao Feng, Keyou Zhuo, Tian- Shun Chen, and Kilar Zhang. Charge func- tions for odd dimensional partitions.Journal of High Energy Physics, 2026(5):141, 2026. doi: 10.1007/JHEP05(2026)141. URL https: //arxiv.org/abs/2512.07758

work page Pith review arXiv 2026
[2]

Charge functions for all dimensional partitions

Hao Feng, Tian-Shun Chen, and Kilar Zhang. Charge functions for all dimensional parti- tions, 2025. URL https://arxiv.org/abs/ 2512.24343

work page Pith review arXiv 2025
[3]

¨Uber zerlegungen von zahlen durch ihre gr¨ ossten gemeinsamen theiler

Richard Dedekind. ¨Uber zerlegungen von zahlen durch ihre gr¨ ossten gemeinsamen theiler. InFest-Schrift der Herzoglichen Technischen Hochschule Carolo-Wilhelmina, pages 1–40. Vieweg+Teubner Verlag, 1897. ISBN 9783663072249. doi: 10.1007/ 978-3-663-07224-9 1. Reprinted in Gesam- melte mathematische Werke, Vol. 2, pp. 103– 148

work page
[4]

Finite- n Estimate of Dedekind Numbers by Layer- Ratio Monte Carlo

Tian-Shun Chen, Hao Feng, Haozhe Wang, Chian-Shu Chen, and Kilar Zhang. Finite- n Estimate of Dedekind Numbers by Layer- Ratio Monte Carlo. 6 2026

work page 2026
[5]

Garsia and Stephen C

Adriano M. Garsia and Stephen C. Milne. Method for constructing bijections for clas- sical partition identities.Proceedings of the National Academy of Sciences of the United States of America, 78(4):2026–2028, 1981. doi: 10.1073/pnas.78.4.2026. URL https: //doi.org/10.1073/pnas.78.4.2026

work page doi:10.1073/pnas.78.4.2026 2026
[6]

Monoidal Bicategories and Hopf Algebroids

Robin Forman. Morse theory for cell com- plexes.Advances in Mathematics, 134(1): 90–145, 1998. doi: 10.1006/aima.1997

work page doi:10.1006/aima.1997 1998
[7]

Kozlov.Combinatorial Algebraic Topology, volume 21 ofAlgorithms and compu- tation in mathematics

Dmitry Kozlov.Combinatorial Algebraic Topology, volume 21 ofAlgorithms and 9 Analytic proofs in odd and even dimensions A comment on local hypercube inequalities Computation in Mathematics. Springer, Berlin, Heidelberg, 2008. doi: 10.1007/ 978-3-540-71962-5. URL https://doi.org/ 10.1007/978-3-540-71962-5

work page doi:10.1007/978-3-540-71962-5 2008
[8]

Joseph B. Kruskal. The number of sim- plices in a complex. In Richard Bell- man, editor,Mathematical Optimization Tech- niques, pages 251–278. University of Cali- fornia Press, Berkeley, 1963. doi: 10.1525/ 9780520319875-014. URL https://doi.org/ 10.1525/9780520319875-014

work page doi:10.1525/9780520319875-014 1963

Show all 11 references

[9]

Gyula O. H. Katona. A theorem of finite sets. InTheory of Graphs: Proceedings of the Col- loquium Held at Tihany, Hungary, September 1966, pages 187–207. Akad´ emiai Kiad´ o, Bu- dapest, 1968. URL https://www.renyi.hu/ ~ohkatona/publang.html

1966
[10]

Stanley.Enumerative Combina- torics, volume 1 ofCambridge Studies in Ad- vanced Mathematics, vol

Richard P. Stanley.Enumerative Combina- torics, volume 1 ofCambridge Studies in Ad- vanced Mathematics, vol. 49. Cambridge Uni- versity Press, Cambridge, 2 edition, 2012. doi: 10.1017/CBO9781139058520. URL https: //doi.org/10.1017/CBO9781139058520. 10

2012 doi
[1650]

URL https://doi.org/10.1006/ aima.1997.1650

1997

Pith tools

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

[1] [1]

Charge functions for odd dimensional partitions

Shang Xiang, Hao Feng, Keyou Zhuo, Tian- Shun Chen, and Kilar Zhang. Charge func- tions for odd dimensional partitions.Journal of High Energy Physics, 2026(5):141, 2026. doi: 10.1007/JHEP05(2026)141. URL https: //arxiv.org/abs/2512.07758

work page Pith review arXiv 2026

[2] [2]

Charge functions for all dimensional partitions

Hao Feng, Tian-Shun Chen, and Kilar Zhang. Charge functions for all dimensional parti- tions, 2025. URL https://arxiv.org/abs/ 2512.24343

work page Pith review arXiv 2025

[3] [3]

¨Uber zerlegungen von zahlen durch ihre gr¨ ossten gemeinsamen theiler

Richard Dedekind. ¨Uber zerlegungen von zahlen durch ihre gr¨ ossten gemeinsamen theiler. InFest-Schrift der Herzoglichen Technischen Hochschule Carolo-Wilhelmina, pages 1–40. Vieweg+Teubner Verlag, 1897. ISBN 9783663072249. doi: 10.1007/ 978-3-663-07224-9 1. Reprinted in Gesam- melte mathematische Werke, Vol. 2, pp. 103– 148

work page

[4] [4]

Finite- n Estimate of Dedekind Numbers by Layer- Ratio Monte Carlo

Tian-Shun Chen, Hao Feng, Haozhe Wang, Chian-Shu Chen, and Kilar Zhang. Finite- n Estimate of Dedekind Numbers by Layer- Ratio Monte Carlo. 6 2026

work page 2026

[5] [5]

Garsia and Stephen C

Adriano M. Garsia and Stephen C. Milne. Method for constructing bijections for clas- sical partition identities.Proceedings of the National Academy of Sciences of the United States of America, 78(4):2026–2028, 1981. doi: 10.1073/pnas.78.4.2026. URL https: //doi.org/10.1073/pnas.78.4.2026

work page doi:10.1073/pnas.78.4.2026 2026

[6] [6]

Monoidal Bicategories and Hopf Algebroids

Robin Forman. Morse theory for cell com- plexes.Advances in Mathematics, 134(1): 90–145, 1998. doi: 10.1006/aima.1997

work page doi:10.1006/aima.1997 1998

[7] [7]

Kozlov.Combinatorial Algebraic Topology, volume 21 ofAlgorithms and compu- tation in mathematics

Dmitry Kozlov.Combinatorial Algebraic Topology, volume 21 ofAlgorithms and 9 Analytic proofs in odd and even dimensions A comment on local hypercube inequalities Computation in Mathematics. Springer, Berlin, Heidelberg, 2008. doi: 10.1007/ 978-3-540-71962-5. URL https://doi.org/ 10.1007/978-3-540-71962-5

work page doi:10.1007/978-3-540-71962-5 2008

[8] [8]

Joseph B. Kruskal. The number of sim- plices in a complex. In Richard Bell- man, editor,Mathematical Optimization Tech- niques, pages 251–278. University of Cali- fornia Press, Berkeley, 1963. doi: 10.1525/ 9780520319875-014. URL https://doi.org/ 10.1525/9780520319875-014

work page doi:10.1525/9780520319875-014 1963