Indistinguishable pairs in F_2^m: results on the quantity L*(m,k) and a reduction to an independence conjecture

Preprint (v1). For G = F_2^m and B ⊆ G\{0}, we study the maximum number L*(m,k) of opposite-coloured pairs that no shift in B distinguishes. We prove a bound n²/16 for |B| ≥ n/2, give a candidate proof of L* = n²/16 in the range 5n/16 < k ≤ n/2, an exact descent when B contains the complement of a hyperplane, and additive bounds for independent indicators. The remaining cases of the conjectured formula reduce to an Independence Conjecture (CI), verified exactly for all B with m = 4 and for 22 sets with m = 5. Each statement carries a status label (proved / candidate proof / computational / open / refuted). Includes Portuguese and English versions, reproduction code and supporting documentation. Prepared with substantial AI assistance (declared in the text); not yet peer reviewed.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24267609
Citations
2
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Indistinguishable pairs in F_2^m: results on the quantity L*(m,k) and a reduction to an independence conjecture

Jordan Portella
2 citations
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Indistinguishable pairs in F_2^m: results on the quantity L*(m,k) and a reduction to an independence conjecture

Jordan Portella
preprint en
2 citations

Abstract

Preprint (v1). For G = F_2^m and B ⊆ G\{0}, we study the maximum number L*(m,k) of opposite-coloured pairs that no shift in B distinguishes. We prove a bound n²/16 for |B| ≥ n/2, give a candidate proof of L* = n²/16 in the range 5n/16 < k ≤ n/2, an exact descent when B contains the complement of a hyperplane, and additive bounds for independent indicators. The remaining cases of the conjectured formula reduce to an Independence Conjecture (CI), verified exactly for all B with m = 4 and for 22 sets with m = 5. Each statement carries a status label (proved / candidate proof / computational / open / refuted). Includes Portuguese and English versions, reproduction code and supporting documentation. Prepared with substantial AI assistance (declared in the text); not yet peer reviewed.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon