Uniform Bounds and a Threshold for Deletion-Embedding Multiplicity in Periodic Words

Let (Q) be a nonempty primitive word of length (L) over an arbitrary finite alphabet. For (m\geq 1), consider the multiplicity of a length-((mL-r)) subsequence of (Q^m) under exactly (r) deletions. We establish an elementary fixed-support argument proving that the maximum deletion-embedding multiplicity is uniformly bounded in the repetition count (m) if and only if (r<L). In the bounded regime (0<r<L), we obtain the explicit, generally nonsharp estimate [ M_r(Q^m)\leq \binom{r+2(r+1)^2(L-1)}{r}. ] The proof uses the structure of relative offsets between subsequence embeddings, a primitive-period shift lemma, and a bounded support set determined by a reference deletion mask. For (r\geq L), a constructive full-period deletion argument establishes unbounded multiplicity. The accompanying computational appendix reports finite-state results for a specified 12-symbol Fibonacci-derived period, including the universal maxima (1,2,2,4,4,8) for deletion budgets (r=1,\ldots,6). The release includes the mathematical manuscript, LaTeX source, reproducible offline Python code, computational audit documentation, and licensing information. This work is released as a mathematical preprint. The computational results are distinguished from the general mathematical proof. Independent peer review, formal proof-assistant verification, and comprehensive literature-priority certification have not been completed. Version: 1.1 — 18 November 2026. Licensing: The mathematical manuscript and associated documentation are distributed under Creative Commons Attribution 4.0 International (CC BY 4.0). The accompanying Python source code is distributed separately under the MIT License. Reproducibility: The Python verification program is designed for offline execution using the Python standard library, including execution in Pydroid 3 on Android. No additional packages, internet access, or output-file creation are required. Verification scope: The general boundedness theorem is supported by a written combinatorial proof. The finite-state results for the specified 12-symbol period are computationally reported and require independent certificate review before being described as independently verified optimality results. AI assistance: AI-assisted drafting, programming, and mathematical exploration are disclosed in the manuscript. The author retains responsibility for the final content, verification, and publication. Publication status: Preprint; not peer reviewed. No claim of independently established literature priority is made.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24354510
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Uniform Bounds and a Threshold for Deletion-Embedding Multiplicity in Periodic Words

Ivo Vajc
3 links
Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
preprint

Uniform Bounds and a Threshold for Deletion-Embedding Multiplicity in Periodic Words

Ivo Vajc
preprint en

Abstract

Let (Q) be a nonempty primitive word of length (L) over an arbitrary finite alphabet. For (m\geq 1), consider the multiplicity of a length-((mL-r)) subsequence of (Q^m) under exactly (r) deletions. We establish an elementary fixed-support argument proving that the maximum deletion-embedding multiplicity is uniformly bounded in the repetition count (m) if and only if (r<L). In the bounded regime (0<r<L), we obtain the explicit, generally nonsharp estimate [ M_r(Q^m)\leq \binom{r+2(r+1)^2(L-1)}{r}. ] The proof uses the structure of relative offsets between subsequence embeddings, a primitive-period shift lemma, and a bounded support set determined by a reference deletion mask. For (r\geq L), a constructive full-period deletion argument establishes unbounded multiplicity. The accompanying computational appendix reports finite-state results for a specified 12-symbol Fibonacci-derived period, including the universal maxima (1,2,2,4,4,8) for deletion budgets (r=1,\ldots,6). The release includes the mathematical manuscript, LaTeX source, reproducible offline Python code, computational audit documentation, and licensing information. This work is released as a mathematical preprint. The computational results are distinguished from the general mathematical proof. Independent peer review, formal proof-assistant verification, and comprehensive literature-priority certification have not been completed. Version: 1.1 — 18 November 2026. Licensing: The mathematical manuscript and associated documentation are distributed under Creative Commons Attribution 4.0 International (CC BY 4.0). The accompanying Python source code is distributed separately under the MIT License. Reproducibility: The Python verification program is designed for offline execution using the Python standard library, including execution in Pydroid 3 on Android. No additional packages, internet access, or output-file creation are required. Verification scope: The general boundedness theorem is supported by a written combinatorial proof. The finite-state results for the specified 12-symbol period are computationally reported and require independent certificate review before being described as independently verified optimality results. AI assistance: AI-assisted drafting, programming, and mathematical exploration are disclosed in the manuscript. The author retains responsibility for the final content, verification, and publication. Publication status: Preprint; not peer reviewed. No claim of independently established literature priority is made.

Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
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