\documentclass[11pt,a4paper]{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{lmodern,microtype} \usepackage[a4paper,margin=27mm]{geometry} \usepackage{amsmath,amssymb,amsthm,mathtools} \usepackage{booktabs,longtable,array,enumitem} \usepackage[unicode,hidelinks]{hyperref} \hypersetup{pdftitle={Cyclotomic Digit-Reversal Thresholds: Explicit Slopes, Effective Periods, and Uniform Families},pdfauthor={Oleksiy Babanskyy}} \setcounter{tocdepth}{1} \hypersetup{bookmarksdepth=2} \setlist{nosep} \setlength{\emergencystretch}{2em} \pagestyle{plain} \newcommand{\Z}{\mathbb Z}\newcommand{\Q}{\mathbb Q} \newcommand{\N}{\mathbb N}\newcommand{\R}{\mathbb R} \newcommand{\A}{\mathcal A_t}\newcommand{\one}{\boldsymbol 1} \newcommand{\ceil}[1]{\left\lceil#1\right\rceil} \newcommand{\EE}{\mathrm E}\newcommand{\RelA}{\mathrm A} \newcommand{\ZZ}{\mathrm Z}\newcommand{\OO}{\mathrm O} \newcommand{\UU}{\mathrm U}\newcommand{\DD}{\mathrm D} \DeclareMathOperator{\osc}{osc}\DeclareMathOperator{\Norm}{N} \DeclareMathOperator{\lcm}{lcm}\DeclareMathOperator{\rank}{rank} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{remark}[theorem]{Remark} \numberwithin{equation}{section} \title{Cyclotomic Digit-Reversal Thresholds:\\ Explicit Slopes, Effective Periods, and Uniform Families} \author{Oleksiy Babanskyy} \date{} \begin{document} \maketitle \begin{abstract} For a base-$B$ digit polynomial $P$, let $K_t(B)$ be the first length at which the represented integer and its reversal are divisible by the full integer $\Phi_t(B)$, although $\Phi_t(X)$ does not divide $P(X)$. We study this threshold through a lattice of evaluations and the capacities imposed by digit positions. For every fixed $t\ge3$, we determine explicit linear slopes and construct an eventual affine description on residue classes, with computable periods, cutoffs and compressed minimum witnesses. No total-unimodularity assumption is needed. For every prime $p\ge5$, exact formulas in stated base ranges give $K_{3p}(10)=17p-1$ and $K_{6p}(10)=18p+1$. Ordered capacities explain their different correction periods, two and four. A deductive scalar classification also describes the minimum algebraic values for $6p$ and the action of reversal on them. Period transfers show that excluding palindromes leaves the first thresholds unchanged for both families. The same framework treats independent coefficient bounds and collisions. Exact results for orders $105,210$ require finite certificates beyond total unimodularity. The general construction is effective; minimal periods and practical efficiency are not claimed. \end{abstract} \noindent\textbf{Keywords:} cyclotomic polynomials; digit reversal; congruence lattices; zonotopes; affine monoids; quasi-polynomials. \begingroup \small \makeatletter \renewcommand*\l@section{\@dottedtocline{1}{0em}{2em}} \makeatother \tableofcontents \endgroup \input{sections/01_introduction} \input{sections/02_lattices} \input{sections/03_boxes} \input{sections/04_slopes} \input{sections/04b_bounded_coefficients} \input{sections/05_effectivity} \input{sections/06_powers_two} \input{sections/07_shell} \input{sections/07b_three_p} \input{sections/07c_six_p} \input{sections/07d_nonpalindromic} \input{sections/08_certified} \input{sections/09_scope} \appendix \input{sections/A_order4} \input{sections/B_order10} \input{sections/C_order12} \input{sections/D_sharpness} \input{sections/E_small_bases} \input{sections/F_six_p_scalar} \input{references} \end{document}