Skip to content
DraconiticResearch
Search Sources API
184,937 studies31 sourcesUpdated 45 min ago
PreprintCC BY 4.0arXiv

Improved Bounds on the Ingleton Score of Four Random Variables

  • Jiang Chang
Open at sourcePDFDOICite

Abstract

For four finite discrete random variables, we prove that the negative of the Ingleton expression, divided by the joint entropy, is at most 19/124 ≈ 0.15323, improving the previously reported upper bound 3/19 by 11/2356. The proof uses a copy program with four copy steps and six auxiliary variables, certified by exact rational linear-programming certificates. We also show that two published information inequalities, due to Dougherty-Freiling-Zeger and Csirmaz, imply the bound 5/32 by an explicit nonnegative combination with Shannon inequalities, and that 5/32 is the exact optimum both of the union of the three published inequality catalogues considered here and of the full copy-lemma extensions of all 213 distinct copy programs occurring in them. The new program is not among these programs, and the bound 19/124 remains optimal when all of them and all catalogue inequalities are added. Ancillary files provide the parsed catalogues, exact primal and dual certificates, exact extension certificates, and verifiers that use only the Python standard library.

Related

  1. Improved bounds in Birch's theorem for forms in many variables
    Yijie Diao, Lena Wurzinger
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. Sums of two dependent uniform random variables: a characterization by joint tail bounds
    Prashant Chaudhary, Kapil Khandelwal
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  3. Sharp High-Entropy Bounds for Sums of Independent Discrete Random Variables
    Haoran Wang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. A Khintchine type inequality for non-independent random variables
    Jingyu Huang, Wenxuan Tao
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. A weak invariance principle for triangular arrays of independent random variables in some Besov spaces
    Davide Giraudo, Sadillo Sharipov
    HALPreprintPublisher termsFull textProbabilityStatisticsHALarXiv

Cite

BibTeXRIS
BibTeX
@misc{chang2026improved,
  title = {{Improved Bounds on the Ingleton Score of Four Random Variables}},
  author = {Jiang Chang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.05168},
  eprint = {2610.05168},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.05168},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Improved Bounds on the Ingleton Score of Four Random Variables
AU  - Jiang Chang
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2610.05168
UR  - https://arxiv.org/abs/2610.05168
AB  - For four finite discrete random variables, we prove that the negative of the Ingleton expression, divided by the joint entropy, is at most 19/124 ≈ 0.15323, improving the previously reported upper bound 3/19 by 11/2356. The proof uses a copy program with four copy steps and six auxiliary variables, certified by exact rational linear-programming certificates. We also show that two published information inequalities, due to Dougherty-Freiling-Zeger and Csirmaz, imply the bound 5/32 by an explicit nonnegative combination with Shannon inequalities, and that 5/32 is the exact optimum both of the union of the three published inequality catalogues considered here and of the full copy-lemma extensions of all 213 distinct copy programs occurring in them. The new program is not among these programs, and the bound 19/124 remains optimal when all of them and all catalogue inequalities are added. Ancillary files provide the parsed catalogues, exact primal and dual certificates, exact extension certificates, and verifiers that use only the Python standard library.
ER  -