Pith. sign in

REVIEW 1 major objections 4 minor 1 cited by

Convex Transference for Degree Powers in Extremal Set Systems

T0 review · 1 major / 4 minor · reviewed 2026-08-04 · deepseek-v4-flash

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

Pith's one-line read A new transference method proves sharp real-exponent degree-power bounds for t-intersecting, intersecting, and bounded-matching-uniform families, with complete equality classifications.

desk verdict A genuinely reusable convex-transfer framework for degree powers, with three sharp applications; the main risk is the external Wu–Zhang second-moment input, not the internal proof. read the letter →

arxiv 2607.28616 v2 pith:YZJSNMQQ submitted 2026-07-30 math.CO

Mengyu Cao , Mei Lu , Haixiang Zhang This is my paper · ORCID
classification math.CO
keywords mathcalrealbinomeveryrangeequalityextremalframework
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 studies families of k-element subsets of an n-element set. For each small subset R, count how many family members contain R; this is the degree d(R). The paper asks which family makes the sum of d(R)^p largest, for real exponents p. For p=1 this is the classical Erdős–Ko–Rado problem; for p=2 it weights pairs of members with large overlap. Previous work solved the p=2 case for several important constraints and hinted at integer p via Newton expansions.

The authors build a general 'transference' method. They show that if you know the largest possible degree and the first two moments of the degree distribution (or the first moment plus a certain excess mass), you can construct a quadratic or piecewise-linear majorant of x^p that is exact on the degrees of the conjectured extremal family. This transfers the sharp p=2 result to every real p≥2 (or p≥1) without needing higher-moment counts, and it also tells you when equality can happen.

Three applications are proven. (1) Among t-intersecting families in the sharp Wilson range, the full t-star maximizes the sum of codegree p-th powers for all p≥2, with all equality families listed. (2) Among intersecting families with n≥2k, the point-star maximizes the r-degree power sum for every level r, with equality only the point-star for p>2. (3) Among families with matching number at most s in the linear range, the family of all k-sets meeting a fixed s-set uniquely maximizes the codegree p-th power sum for every p≥1.

Extended reading notes

Core claim

Lemma 2.6 is the engine: if a nonnegative sequence satisfies x_i ≤ min{m,D}, Σx_i = cm and Σx_i^2 ≤ B(m), where B is matched to a target two-level distribution, then Σx_i^p ≤ aD^p + (N−a)L^p for every real p≥2, and for p>2 equality forces the target multiset. The paper's headline application is Theorem 1.1: a full t-star maximizes co_p among t-intersecting families for every real p≥2 in the sharp range n≥(t+1)(k−t+1), with all equality cases determined.

Load-bearing premise

The first application assumes the sharp tight-pair estimate of Wu–Zhang [21, Theorem 1.4] as a black box (Lemma 2.3): for t-intersecting families in the Wilson range, the number of (k−1)-codegree pairs is at most (1/2)(k−t)(n−k) C(n−t,k−t). The transference framework only converts this quadratic statistic into real-p bounds; it cannot repair a false second-moment input. The paper does not reprove this estimate, and it is also used to derive the equality cases. Equality claims additionally depend on the Ahlswede–Khachatrian boundary classification. If either external input has an unstated range restriction, Theorem 1.1 would require rework.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 4 minor

Summary. The paper develops a convex-transference framework for bounding degree power sums of uniform set families. The framework takes as input sharp low-order information (first and second moment bounds, or first moment plus an excess-mass bound) and transfers it to sharp bounds on ℓ_{r,p} for every real p, retaining equality information. Three applications are given: (1) Theorem 1.1 extends the Wu–Zhang quadratic theorem for t-intersecting families to every real p ≥ 2 throughout the sharp Erdős–Ko–Rado range, with equality classifications including boundary cases; (2) Theorem 1.5 handles all r-degree levels for intersecting families at n ≥ 2k; (3) Theorem 1.7 gives the sharp codegree-power bound for families with matching number at most s in Frankl's linear range. The analytic engine consists of three majorant certificates: an endpoint secant, a two-point Hermite envelope, and a one-knot hinge envelope. The equality analyses use the EKR/Wilson/Ahlswede–Khachatrian boundary classification, Bey's inequality with a Johnson-scheme spectral decomposition, and Frankl's matching theorem.

Significance. If the external inputs are correct, this is a significant and reusable contribution. The transfer principles in Lemmas 2.4–2.7 are genuinely modular: they are parameter-free in the combinatorial sense, being constructed solely from the target degree distribution, and they convert quadratic or excess-mass estimates into real-power bounds without requiring higher-moment counts. The applications are exact and include complete equality classifications, including the previously overlooked boundary families in the p = 2 case of Theorem 1.1. The paper also answers Zhou–Yuan's problem in the sharp star range and removes the integrality restriction on p for the matching-number problem. The main caveat is the dependence of Theorem 1.1 on the Wu–Zhang tight-pair bound; this is clearly acknowledged and does not affect the framework itself, but the exact statement of that external theorem should be verified and made precise.

major comments (1)
  1. [Lemma 2.3 / Theorem 1.1] The headline theorem's upper bound and its p=2 equality classification import the Wu–Zhang tight-pair estimate M2(F) ≤ (k−t)(n−k) C(n−t,k−t) verbatim, including the boundary n=(t+1)(k−t+1). This is load-bearing because the analytic transfer cannot repair a false second-moment input. The manuscript cites [21, Theorem 1.4] but does not reproduce its exact hypotheses. Since the authors later note in Remark 1.2 that the equality statement of [21] needs supplementation, the referee requests a precise statement of [21, Theorem 1.4] — or a verification sketch — confirming that the inequality holds with equality at the stated boundary and that there is no hidden strictness restriction. This is a verification request rather than an internal error.
minor comments (4)
  1. [Lemma 5.2] The assertion that shifting does not increase the matching number is invoked without proof. It is standard, but a reference or a one-sentence justification would improve self-containedness.
  2. [Section 5.2, proof of Lemma 5.5] The claim that Φ_{q−1} is monotone under inclusion is used to compare the q≥2 contributions. This is true because the excess is computed pointwise, but the manuscript could spell this out.
  3. [Theorem 1.7] There is a small typo in the equality statement: 'Fis isomorphic' should read 'F is isomorphic'.
  4. [Section 2, Lemma 2.6] Lemma 2.6 is dense and its parameters are somewhat intricate. A short table translating the abstract parameters (N, L, D, M, a, c, ξ, η) into the quantities used in Theorems 1.5 and 1.7 would aid readability.
Assumptions & free parameters 0 free parameters · 9 assumptions · 0 invented entities

The paper is a pure-math proof contribution; it fits no parameters and introduces no new mathematical entities. All invoked results are standard theorems or clearly cited recent results.

assumptions (9)
  • domain assumption Wilson's exact Erdős–Ko–Rado bound: for t-intersecting families F⊆C([n],k) with n≥(t+1)(k−t+1), |F| ≤ C(n−t,k−t); above the threshold equality only for full t-stars.
    Theorem 2.1; used in Lemma 2.3 for the first-moment bound and in the equality analysis of Theorem 1.1.
  • domain assumption Ahlswede–Khachatrian boundary classification at n=(t+1)(k−t+1): equality families are full t-stars or {F : |F∩Z| ≥ t+1} for some |Z|=t+2.
    Theorem 2.1; used for p=2 equality cases in Theorem 1.1.
  • domain assumption Bey's degree-square inequality (2.1) for arbitrary uniform families.
    Theorem 2.2; the quadratic input for Theorem 1.5.
  • domain assumption Wu–Zhang tight-pair estimate: ζ_{k−1}(F) ≤ (1/2)(k−t)(n−k) C(n−t,k−t) for t-intersecting F in the Wilson range.
    Lemma 2.3; the second-moment input for Theorem 1.1. Not reproved here.
  • domain assumption Frankl's matching theorem in the range n≥(2s+1)k−s: ν(F)≤s implies |F|≤C(n,k)−C(n−s,k), with equality iff F≅B_S.
    Theorem 5.1; used in the proof of Theorem 1.7 and in the codegree-excess inequality.
  • domain assumption Frankl's nested cross-dependence inequality (Lemma 5.4) for nested cross-dependent families.
    Used in Lemma 5.5 to bound the q=0 and q=1 contributions of the codegree excess.
  • standard math Johnson association scheme spectral decomposition and eigenvalues θ_j^(r), equation (4.2).
    Section 4; used in Proposition 4.1 to classify equality at n=2k.
  • standard math Hermite–Genocchi integral representation of divided differences for x^p on [0,E].
    Lemma 2.5; establishes the Hermite majorant for real p≥2.
  • standard math Standard shifting properties: termination, matching number not increased, and compression of shadows.
    Lemma 5.2 and Lemma 5.3; some parts proved, others standard.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Convex Transference for Degree Powers in Extremal Set Systems." pith.science (2026). https://pith.science/paper/YZJSNMQQ

@misc{pith2026260728616,
  author       = {Pith},
  title        = {Pith review of: Convex Transference for Degree Powers in Extremal Set Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YZJSNMQQ}},
  note         = {Machine review of arXiv:2607.28616}
}
abstract

For a family $\mathcal{F}\subseteq\binom{[n]}k$ and $R\in\binom{[n]}r$, let $d_{\mathcal{F}}(R)=|\{F\in\mathcal{F}:R\subseteq F\}|$ and $\ell_{r,p}(\mathcal{F})=\sum_{R\in\binom{[n]}r}d_{\mathcal{F}}(R)^p$; at the codegree level, write $co_p(\mathcal{F})=\ell_{k-1,p}(\mathcal{F})$. We introduce a new convex-transference method for degree-power extremal problems and develop it into a reusable input--transfer--rigidity framework independent of any particular set-system problem. We give three exact applications. First, a full $t$-star maximizes $co_p$ among $t$-intersecting families for every real $p\geq2$ in the sharp range $n\geq(t+1)(k-t+1)$, with all equality cases determined. This extends the Wu--Zhang quadratic theorem to real exponents and answers a problem of Zhou--Yuan throughout the sharp Erd\H{o}s--Ko--Rado range. Second, if $n\geq2k$, a full point-star maximizes $\ell_{r,p}$ for every $1\leq r\leq k-1$ and real $p\geq2$, again with complete equality classification; thus the framework is not confined to codegrees. Third, if $\nu(\mathcal{F})\leq s$ and $n\geq(2s+1)k-s$, then for every real $p\geq1$, $co_p(\mathcal{F})$ is uniquely maximized, up to isomorphism, by all $k$-sets meeting a fixed $s$-set. This removes the integrality restriction on $p$ and replaces previous cubic thresholds or nonexplicit sufficiently-large assumptions with an explicit linear range valid for arbitrary uniformity.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The $(t,p)$-Norm in Classical Extremal Problems

    math.CO 2026-08 accept novelty 6.0 of 10

    For large vertex sets, the paper determines the exact maximum of the (t,p)-norm and its unique extremal hypergraph in three classical settings: bounded matching number, k-intersecting families, and hypergraphs avoidin...

Reference graph

Works this paper leans on

23 extracted references · 4 linked inside Pith · cited by 1 Pith paper

  1. [21]

    Wu and H

    B. Wu and H. Zhang,The Erd˝ os–Ko–Rado theorem in ℓ2-norm, European J. Combin.135 (2026), 104369

    2026

  2. [1]

    Ahlswede and L

    R. Ahlswede and L. H. Khachatrian,The complete intersection theorem for systems of finite sets, European J. Combin.18(1997), 125–136

    1997

  3. [2]

    Balogh, F

    J. Balogh, F. C. Clemen, and B. Lidick´ y,Hypergraph Tur´ an problems inℓ2-norm, inSurveys in Combinatorics 2022, London Math. Soc. Lecture Note Ser., vol. 481, Cambridge University Press, Cambridge, 2022, pp. 21–63

    2022

  4. [3]

    Balogh, F

    J. Balogh, F. C. Clemen, and B. Lidick´ y,Solving Tur´ an ’s tetrahedron problem for theℓ2-norm, J. Lond. Math. Soc. (2)106(2022), 60–84

    2022

  5. [4]

    Bey,An upper bound on the sum of squares of degrees in a hypergraph, Discrete Math.269 (2003), 259–263

    C. Bey,An upper bound on the sum of squares of degrees in a hypergraph, Discrete Math.269 (2003), 259–263

    2003

  6. [5]

    Brooks and W

    G. Brooks and W. Linz,Some exact and asymptotic results for hypergraph Tur´ an problems in ℓ2-norm, European J. Combin.136(2026), 104391

    2026

  7. [6]

    W. Chen, D. Iˇlkoviˇ c, J. Le´ on, X. Liu, and O. Pikhurko,Nondegenerate Tur´ an problems under (t, p)-norms, arXiv:2406.15934, 2024. 27

    arXiv 2024

  8. [7]

    de Boor,Divided differences, Surveys Approx

    C. de Boor,Divided differences, Surveys Approx. Theory1(2005), 46–69

    2005

Show all 23 references
  1. [8]

    Erd˝ os, C

    P. Erd˝ os, C. Ko, and R. Rado,Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2)12(1961), 313–320

    1961

  2. [9]

    Filmus,The weighted complete intersection theorem, J

    Y. Filmus,The weighted complete intersection theorem, J. Combin. Theory Ser. A151(2017), 84–101

    2017

  3. [10]

    Frankl,Improved bounds for Erd˝ os’ matching conjecture, J

    P. Frankl,Improved bounds for Erd˝ os’ matching conjecture, J. Combin. Theory Ser. A120 (2013), 1068–1072

    2013

  4. [11]

    Frankl and N

    P. Frankl and N. Tokushige,Invitation to intersection problems for finite sets, J. Combin. Theory Ser. A144(2016), 157–211

    2016

  5. [12]

    Frankl and N

    P. Frankl and N. Tokushige,Extremal Problems for Finite Sets, Student Mathematical Library, vol. 86, American Mathematical Society, Providence, RI, 2018

    2018

  6. [13]

    J. Gao, X. Liu, J. Ma, and O. Pikhurko,Phase transition of degenerate Tur´ an problems in p-norms, SIAM J. Discrete Math.39(2025), 1712–1736

    2025

  7. [14]

    Godsil and K

    C. Godsil and K. Meagher,Erd˝ os–Ko–Rado Theorems: Algebraic Approaches, Cambridge Studies in Advanced Mathematics, vol. 149, Cambridge University Press, Cambridge, 2015

    2015

  8. [15]

    Huang,The maximum sum of the size of all intersections within intersecting families and crossing-intersecting families, arXiv:2402.16730, 2024

    S. Huang,The maximum sum of the size of all intersections within intersecting families and crossing-intersecting families, arXiv:2402.16730, 2024

    2024 arXiv

  9. [16]

    G. O. H. Katona,A simple proof of the Erd˝ os–Ko–Rado theorem, J. Combin. Theory Ser. B13 (1972), 183–184

    1972

  10. [17]

    Karlin and W

    S. Karlin and W. J. Studden,Tchebycheff Systems: With Applications in Analysis and Statistics, Pure and Applied Mathematics, vol. 15, Interscience Publishers, New York, 1966

    1966

  11. [18]

    Shaked and J

    M. Shaked and J. G. Shanthikumar,Stochastic Orders, Springer Series in Statistics, Springer, New York, 2007

    2007

  12. [19]

    Wang and Y

    W. Wang and Y. Peng,Counting the maximum number of sunflowers in hypergraphs with given matching number, European J. Combin.136(2026), 104379

    2026

  13. [20]

    R. M. Wilson,The exact bound in the Erd˝ os–Ko–Rado theorem, Combinatorica4(1984), 247–257

    1984

  14. [22]

    Zhang, M

    H. Zhang, M. Cao, and M. Lu,Counting sunflowers with restricted matching number, arXiv:2604.21855, 2026

    2026 arXiv

  15. [23]

    Zhou and X

    J. Zhou and X. Yuan,Counting sunflowers in hypergraphs with bounded matching number and Erd˝ os Matching Conjecture in the(t, k)-norm, arXiv:2604.19183, 2026. 28

    2026 arXiv

Pith tools

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