Pith. sign in

REVIEW 3 minor 17 references

If t linear forms have m-th powers forming a minimal dependence, their span has dimension at most (t+m-2)/m.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.3

2026-06-25 23:47 UTC pith:FJDFMUD3

load-bearing objection The paper proves the sharp bound dim L ≤ (t+m-2)/m for spans of linear forms with circuit m-th powers, via a direct Schur-power reduction to the Mirandola-Zémor Kneser theorem.

arxiv 2606.24349 v1 pith:FJDFMUD3 submitted 2026-06-23 math.CO

Sharp bounds for minimal dependencies of linear-form powers

Heng Li , Xizhi Liu This is my paper
classification math.CO
keywords Veronese circuitslinear formsSchur powersKneser theoremdimension boundsminimal dependenciesrational normal curvescircuit dependence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper proves that when the m-th powers of t nonzero homogeneous linear forms are minimally linearly dependent over a field of characteristic zero, the dimension of the span of those forms is bounded above by (t + m - 2)/m. This bound is attained by configurations arising from rational normal curves for infinitely many pairs of t and dimension. The result settles the dimension part of a question of Bukh and shows that the optimal leading constant there is 1/m. The argument translates the setup into coding theory, where the coefficient space of the powers becomes the m-th Schur power of a code that is forced to be a full-support hyperplane, allowing application of a Schur-product version of Kneser's theorem.

Core claim

If ℓ1,…,ℓt are nonzero homogeneous linear forms over a field of characteristic zero such that the powers ℓ1^m,…,ℓt^m form a circuit, then dim L ≤ (t+m-2)/m where L = Span{ℓ1,…,ℓt}. Rational-normal-curve configurations attain equality for infinitely many pairs (t, dim L). The same method produces flat-concentration and interpolation criteria, a Cayley-Bacharach lower bound, Segre-Veronese and positive-characteristic variants, and Hilbert-function constraints for equality cases.

What carries the argument

The m-th Schur power of the coefficient row space of the linear forms, which the circuit assumption turns into a full-support hyperplane to which the Schur-product Kneser theorem applies.

Load-bearing premise

The dependence among the m-th powers must be minimal, i.e., they must form a circuit, and the base field must have characteristic zero.

What would settle it

An explicit set of t linear forms over a characteristic-zero field whose m-th powers form a circuit but whose span has dimension strictly larger than (t + m - 2)/m would disprove the bound.

Watch this falsifier — get emailed when new claim-graph text bears on it.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 3 minor

Summary. The manuscript proves the sharp bound dim L ≤ (t + m - 2)/m, where ℓ1, …, ℓt are nonzero homogeneous linear forms over a characteristic-zero field whose m-th powers form a circuit and L = Span{ℓ1, …, ℓt}. Equality is attained by rational-normal-curve configurations for infinitely many pairs (t, dim L). The argument translates the circuit hypothesis into the statement that the m-th Schur power of the coefficient row space is a full-support hyperplane, then invokes the Mirandola–Zémor Schur-product Kneser theorem; the same reduction produces flat-concentration criteria, an interpolation criterion, a Cayley–Bacharach lower bound, Segre–Veronese and positive-characteristic variants, and Hilbert-function constraints for equality cases.

Significance. If the central claim holds, the paper supplies the sharp finite-dimensional bound for the dimension part of Bukh’s problem and identifies the optimal leading constant 1/m. The coding-theoretic translation is direct and parameter-free, and the explicit equality constructions via rational normal curves confirm sharpness for infinitely many parameters. The method simultaneously yields several auxiliary results on Hilbert functions and interpolation, increasing the manuscript’s utility beyond the main bound.

minor comments (3)
  1. [Introduction / coding-theoretic translation paragraph] The abstract states that the m-th Schur power is a full-support hyperplane, but the precise definition of the coefficient code and the row-space construction should be given explicitly in the first section that introduces the coding-theoretic translation (currently only sketched in the abstract).
  2. [Equality cases] The statement that rational-normal-curve configurations attain equality for infinitely many pairs (t, dim L) is asserted without a reference or self-contained verification; a short appendix or subsection exhibiting the explicit linear forms and verifying the circuit property for at least one infinite family would strengthen the sharpness claim.
  3. [Abstract] The positive-characteristic variant is mentioned only in the abstract; if the manuscript contains a full statement or counter-example, it should be cross-referenced from the main theorem so readers can locate the precise range of validity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of the manuscript, the detailed summary of its contributions, and the recommendation of minor revision. No major comments appear in the report, so we have no specific points requiring response or revision.

Circularity Check

0 steps flagged

No significant circularity; external theorem application

full rationale

The central bound is obtained by a coding-theoretic reduction that maps the circuit hypothesis on m-th powers to a full-support hyperplane in the m-th Schur power, then invokes the external Mirandola-Zémor Schur-product Kneser theorem (distinct authors). No self-citation is load-bearing, no parameter is fitted and renamed as a prediction, and equality cases are exhibited by explicit rational-normal-curve constructions rather than by redefinition. The derivation therefore remains independent of its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper introduces no free parameters or invented entities. It relies on two domain assumptions and an external theorem.

axioms (2)
  • domain assumption The base field has characteristic zero.
    Required for the main theorem and for the applicability of the Schur-product Kneser theorem.
  • domain assumption The powers ℓ1^m,…,ℓt^m form a circuit (minimal linear dependence).
    Central hypothesis that makes the Schur power a full-support hyperplane to which the Kneser theorem applies.

pith-pipeline@v0.9.1-grok · 5771 in / 1374 out tokens · 27955 ms · 2026-06-25T23:47:30.886897+00:00 · methodology

0 comments
read the original abstract

Motivated by the dimension-bound part of a problem of Bukh, we study Veronese circuits: how large can the span of $t$ linear forms be if their $m$-th powers are minimally linearly dependent? We prove the sharp finite dimension bound \[ \dim L\leq \frac{t+m-2}{m}. \] Here $\ell_1,\ldots,\ell_t$ are nonzero homogeneous linear forms over a field of characteristic zero, the powers $\ell_1^m,\ldots,\ell_t^m$ form a circuit, and $L=\Span\{\ell_1,\ldots,\ell_t\}$. Rational-normal-curve configurations attain equality for infinitely many pairs $(t,\dim L)$; in particular, the affine bound itself is sharp and the optimal leading constant in Bukh's question is $1/m$. The proof uses a coding-theoretic translation: the coefficient row space of the powers is the $m$-th Schur power of the coefficient code, and the minimality hypothesis makes this Schur power a full-support hyperplane to which the Schur-product Kneser theorem of Mirandola and Z\'emor applies. The same method yields flat-concentration and interpolation criteria, a Cayley--Bacharach lower bound, Segre--Veronese and positive-characteristic variants, and Hilbert-function constraints for equality and near-equality in Veronese circuits.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references

  1. [1]

    Alexander and A

    J. Alexander and A. Hirschowitz. Polynomial interpolation in several variables.J. Algebraic Geom., 4(2):201–222, 1995

    1995

  2. [2]

    Bernardi, E

    A. Bernardi, E. Carlini, M. V. Catalisano, A. Gimigliano, and A. Oneto. The Hitchhiker Guide to: Secant Varieties and Tensor Decomposition.Mathematics, 6(12):Paper No. 314, 86 pp., 2018

    2018

  3. [3]

    Białynicki-Birula and A

    A. Białynicki-Birula and A. Schinzel. Representations of multivariate polynomials by sums of univariate polynomials in linear forms.Colloq. Math., 112(2):201–233, 2008. Corrigendum: Colloq. Math. 125 (2011), no. 1, 139

    2008

  4. [4]

    B. Bukh. Interesting problems that I cannot solve. https://www.borisbukh.org/problems.html. Accessed June 23, 2026

    2026

  5. [5]

    B. Bukh. Extremal graphs without exponentially small bicliques.Duke Math. J., 173(11):2039–2062, 2024

    2039

  6. [6]

    E. D. Davis, A. V. Geramita, and F. Orecchia. Gorenstein algebras and the Cayley-Bacharach theorem. Proc. Amer. Math. Soc., 93(4):593–597, 1985

    1985

  7. [7]

    Eisenbud, M

    D. Eisenbud, M. Green, and J. Harris. Cayley-Bacharach theorems and conjectures.Bull. Amer. Math. Soc. (N.S.), 33(3):295–324, 1996

    1996

  8. [8]

    A. V. Geramita, M. Kreuzer, and L. Robbiano. Cayley-Bacharach schemes and their canonical modules. Trans. Amer. Math. Soc., 339(1):163–189, 1993

    1993

  9. [9]

    Iarrobino and V

    A. Iarrobino and V. Kanev.Power sums, Gorenstein algebras, and determinantal loci, volume 1721 of Lecture Notes in Math.Springer-Verlag, Berlin, 1999

    1999

  10. [10]

    M. Kneser. Abschätzung der asymptotischen Dichte von Summenmengen.Math. Z., 58:459–484, 1953

    1953

  11. [11]

    Kreuzer, L

    M. Kreuzer, L. N. Long, and L. Robbiano. On the Cayley-Bacharach property.Comm. Algebra, 47(1):328–354, 2019

    2019

  12. [12]

    J. M. Landsberg.Tensors: geometry and applications, volume 128 ofGrad. Stud. Math.American Mathematical Society, Providence, RI, 2012

    2012

  13. [13]

    Mirandola and G

    D. Mirandola and G. Zémor. Critical pairs for the product Singleton bound.IEEE Trans. Inform. Theory, 61(9):4928–4937, 2015

    2015

  14. [14]

    Randriambololona

    H. Randriambololona. On products and powers of linear codes under componentwise multiplication. In S. Ballet, M. Perret, and A. Zaytsev, editors,Algorithmic arithmetic, geometry, and coding theory, volume 637 ofContemp. Math., pages 3–78. American Mathematical Society, Providence, RI, 2015

    2015

  15. [15]

    B. Reznick. Sums of even powers of real linear forms.Mem. Amer. Math. Soc., 96(463):viii+155, 1992

    1992

  16. [16]

    B. Reznick. Patterns of dependence among powers of polynomials. In S. Basu and L. Gonzalez-Vega, editors,Algorithmic and quantitative real algebraic geometry, volume 60 ofDIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 101–121. American Mathematical Society, Providence, RI, 2003

    2003

  17. [17]

    A. Sładek. Linear dependence of powers of linear forms.Ann. Math. Silesianae, 29:131–138, 2015. 20

    2015