Skip to content
DraconiticResearch
Search Sources API
226,742 studies31 sourcesUpdated 34 min ago
Peer-reviewedCC BYForum of Mathematics Sigma

Linear dependencies, polynomial factors in the Duke–Erdős forbidden sunflower problem

  1. 1Moscow Institute of Physics and Technology
  2. 2Moscow Institute of Physics and Technology and HSE University

Abstract

We call a family of s s s sets { F 1 , … , F s } {F1, … , Fs} StartSet upper F 1 comma ellipsis comma upper F Subscript s Baseline EndSet a sunflower with s s s petals if, for any distinct i , j ∈ [ s ] i, j ∈ [s] i comma j element of left bracket s right bracket , one has F i ∩ F j = ∩ u = 1 s F u Fi ∩ Fj = ∩ u = 1s Fu upper F Subscript i Baseline intersection upper F Subscript j Baseline equals intersection Underscript u equals 1 Overscript s Endscripts upper F Subscript u . The set C = ∩ u = 1 s F u C = ∩ u = 1s Fu upper C equals intersection Underscript u equals 1 Overscript s Endscripts upper F Subscript u is called the core of the sunflower. It is a classical result of Erdős and Rado that there is a function ϕ ( s

Related

  1. Linear dependencies, polynomial factors in the Duke–Erdős forbidden sunflower problem – CORRIGENDUM
    Andrey Kupavskii, Fedor Noskov
    Forum of Mathematics, SigmaPeer-reviewedCC BY 4.0General mathematicsCrossref
  2. Polynomial-in-r bounds for forbidden traces of uniform hypergraphs
    Pei Wu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Polynomial Compressibility and Forbidden Oriented Forests
    Zhenhua Lyu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Forbidden subset sums in a linear range: an inverse theorem and the Erdős-Graham irregularity problem
    Mateo Matijasevick
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. A Polynomial-Time Algorithm for the Minimal Input/Output Node Cardinality Disturbance Decoupling Problem via Output Feedback
    Luca Claude Gino Lebon, Jorke de Vlas, Johannes K. Fichte +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
BibTeX
@article{kupavskii2026linear,
  title = {{Linear dependencies, polynomial factors in the Duke–Erdős forbidden sunflower problem}},
  author = {Andrey Borisovich Kupavskii and Fedor Noskov},
  journal = {Forum of Mathematics Sigma},
  year = {2026},
  month = sep,
  doi = {10.1017/fms.2026.10264},
  url = {https://doi.org/10.1017/fms.2026.10264},
  note = {CC BY},
}
RIS
TY  - JOUR
TI  - Linear dependencies, polynomial factors in the Duke–Erdős forbidden sunflower problem
AU  - Andrey Borisovich Kupavskii
AU  - Fedor Noskov
PY  - 2026
DA  - 2026/09/14
JO  - Forum of Mathematics Sigma
DO  - 10.1017/fms.2026.10264
UR  - https://doi.org/10.1017/fms.2026.10264
AB  - We call a family of s s s sets { F 1 , … , F s } {F_1, … , F_s} StartSet upper F 1 comma ellipsis comma upper F Subscript s Baseline EndSet a sunflower with s s s petals if, for any distinct i , j ∈ [ s ] i, j ∈ [s] i comma j element of left bracket s right bracket , one has F i ∩ F j = ∩ u = 1 s F u F_i ∩ F_j = ∩ _u = 1^s F_u upper F Subscript i Baseline intersection upper F Subscript j Baseline equals intersection Underscript u equals 1 Overscript s Endscripts upper F Subscript u . The set C = ∩ u = 1 s F u C = ∩ _u = 1^s F_u upper C equals intersection Underscript u equals 1 Overscript s Endscripts upper F Subscript u is called the core of the sunflower. It is a classical result of Erdős and Rado that there is a function ϕ ( s
SN  - 2050-5094
ER  -