Metraipolis › archive › dc_6eb87e2dae8b

Deficit bounds and equality cases in the Tu--Deng problem — arXiv:2608.22451

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22451
License (as archived)
CC0-1.0
Archived
2026-10-18T08:32:17.574Z
SHA-256 of the archived text
d3398c6891fbf324c48e25e110553a6308ac405258062e56087f046286fe972e
Stable URL of this page
https://metraipolis.com/documento/dc_6eb87e2dae8b

How to cite

Deficit bounds and equality cases in the Tu--Deng problem — arXiv:2608.22451 — arXiv (en), https://arxiv.org/abs/2608.22451 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6eb87e2dae8b (Metraipolis archive dc_6eb87e2dae8b, sha256 d3398c6891fbf324c48e25e110553a6308ac405258062e56087f046286fe972e)
BibTeX
@misc{dc6eb87e2dae8b,
  title = {Deficit bounds and equality cases in the Tu--Deng problem — arXiv:2608.22451},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22451},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6eb87e2dae8b; sha256 d3398c6891fbf324c48e25e110553a6308ac405258062e56087f046286fe972e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22451. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $N=2^k-1$, and let $S_{t,k}$ consist of the pairs $0\le a,b<N$ such that $a+b\equiv t\pmod N$ and $\wt(a)+\wt(b)<k$. The Tu--Deng bound $|S_{t,k}|\le 2^{k-1}$ has recently been proved. In this paper, we give a combinatorial proof of the equality criterion. If the $k$-bit cyclic word of $t$ has $Z$ zeros and $g_1,\ldots,g_Z$ are the numbers of ones between successive zeros, then $$|S_{t,k}|=2^{k-1} \quad\Longleftrightarrow\quad g_i\ge Z-1\quad(1\le i\le Z).$$ Moreover, we recover the resulting enumeration of the equality parameters. Beyond equality, if $R\ge Z\ge2$, where $R$ is the number of ones, then every nonequality parameter satisfies $$2^{k-1}-|S_{t,k}|\ge 2^{R-Z+1},$$ and we classify all cases in which this bound is attained. For $R<Z$ we obtain a congruence for $|S_{t,k}|$ and a lower bound for the deficit in terms of the number of cyclic runs of ones.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.22451 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:27:54.410Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).