\section{Reversal and non-palindromic minimum words}\label{sec:nonpalindromic} We distinguish a normalized algebraic value from a digit word realizing it. Reversal acts on both, but its fixed points need not correspond: a fixed value can have non-palindromic digit realizations. \subsection{Boolean coordinates for the minimum values} Suppose $p\ge11$ is prime and $B\equiv1\pmod4$, $B\ge13$. Let $\lambda=\lambda_p$ be as in Theorem~\ref{thm:6p-multiplicity}, and put \[ \gamma_j=\begin{cases} \eta_3\eta_p^{2+3j}(1+\eta_p+\eta_p^2),&p\equiv5\pmod6,\\ -\eta_p^{3+3j}(1+\eta_p+\eta_p^2),&p\equiv1\pmod6, \end{cases}\qquad 0\le j<\lambda . \] The normalized values at the first threshold are exactly \begin{equation}\label{eq:6p-cube} \mathcal V_p=\left\{\sum_{j=0}^{\lambda-1}\epsilon_j\gamma_j: \epsilon_j\in\{0,1\},\quad \epsilon\ne0\right\}. \end{equation} Indeed this is the support classification, using $\sum_{j=0}^{p-1}\eta_p^j=0$ on the complement branch. The $\gamma_j$ are linearly independent over $\Q$: after removing the common nonzero factor, a relation would be a polynomial supported on disjoint triples, of degree less than $p-1$, vanishing at $\eta_p$. Its coefficients must vanish. They are consequently independent over $\R$ in $A\otimes_{\Z}\R$. Thus \eqref{eq:6p-cube} is a Boolean parallelotope with the zero vertex removed. This assertion concerns the real scalar extension of the lattice, not one complex embedding. The enumerator by selected support size on the first branch, or omitted support size on the second, is $(1+z^3)^\lambda-1$. \begin{theorem}[Reversal of minimum values]\label{thm:6p-reversal} At length $K_{6p}(B)$ in the preceding domain, reversal acts on \eqref{eq:6p-cube} by \[ (\epsilon_0,\ldots,\epsilon_{\lambda-1}) \longmapsto(\epsilon_{\lambda-1},\ldots,\epsilon_0). \] The numbers of fixed normalized values and reversal orbits of values are \[ F_p=2^{\ceil{\lambda/2}}-1,\qquad O_p=\frac{2^\lambda+2^{\ceil{\lambda/2}}-2}{2}. \] For $p=5,7$ the unique normalized value is fixed, with one orbit. \end{theorem} \begin{proof} For $P^*(X)=X^{K-1}P(X^{-1})$, reality of $\mathcal H_B$ gives \[ J(\beta):=\mathcal H_B^{-1}P^*(\xi) =\xi^{K-1}\overline\beta . \] Here $K-1\equiv5p-5\pmod{6p}$, an even exponent. On the active row, conjugation and this root factor preserve that row and send column $j$ to $-5-j\pmod p$. In either residue class the triple numbered $j$ is therefore sent to the triple numbered $\lambda-1-j$. The common minus sign on the complement branch is unchanged. Independence of the generators gives the asserted coordinate action. A reversal-fixed binary vector has $\ceil{\lambda/2}$ free bits; exclude the zero vector. Every other value has an orbit of size two, so the total is $(|\mathcal V_p|+F_p)/2$. At $p=5,7$ reversal preserves the singleton of minimum values. \end{proof} Here $\lambda$ is odd. The enumerator of the fixed choices, by number of chosen triples, is $(1+z)(1+z^2)^{(\lambda-1)/2}-1$. These are value counts, not counts of palindromic words. \subsection{A transfer within a residue class} Call $\beta\in\Z[\xi]$ \emph{primitive} if $\beta\notin n\Z[\xi]$ for every integer $n>1$. Let $K_t^{\mathrm{np}}(B)$ denote the first false-positive length restricted to non-palindromic words, with the same full modulus $\Phi_t(B)$ and digit alphabet as $K_t(B)$. \begin{lemma}[Period transfer]\label{lem:period-transfer} Let $t\ge3$, $B\ge3$, $\Phi_t(1)=1$, and $K=K_t(B)\ge2t$. Put $A=\Z[\xi]$ and $\mathcal H_B=(B-\xi)(B-\xi^{-1})$. If a word at length $K$ realizes $P(\xi)=\mathcal H_B\beta$ with $\beta\in A$ primitive, then the same value has a non-palindromic realization at length $K$. \end{lemma} \begin{proof} Write $N=B-1\ge2$. From $\Phi_t(X)=1+(X-1)R(X)$ we obtain $(1-\xi)R(\xi)=1$. Both $1-\xi$ and $1-\xi^{-1}$ are units in $A$. Modulo $NA$, the element $\mathcal H_B$ is their product, hence a unit. If every digit of $P$ were $0$ or $N$, then $\mathcal H_B\beta=P(\xi)\in NA$ would imply $\beta\in NA$, contrary to primitivity. Thus some digit $d_a$ satisfies $02(3p)$ and $K_{6p}(B)\ge18p+1>2(6p)$ in the respective domains. Lemma~\ref{lem:period-transfer} supplies a non-palindromic word at the unrestricted first threshold. The opposite inequality follows by restriction of the set of words. \end{proof} For bases $10,14,18$ in the $6p$ family this uses the constructed short value only. It does not extend the uniqueness domain of Corollary~\ref{cor:6p-unique}. \begin{corollary}[Words above primitive values]\label{cor:nonpal-count} Under the hypotheses of Lemma~\ref{lem:period-transfer}, each primitive normalized value at length $K$ has at least two distinct non-palindromic realizations. An ensemble of $V$ distinct such values therefore supplies at least $2V$ non-palindromic words and at least $V$ reversal orbits of words. In particular, for $B\equiv1\pmod4$, $B\ge13$, $p\ge11$ prime, there are at least $2(2^{\lambda_p}-1)$ non-palindromic words at $K_{6p}(B)$, and at least $2^{\lambda_p}-1$ word orbits. \end{corollary} \begin{proof} Reversal induces $J(\beta)=\xi^{K-1}\overline\beta$. If $J(\beta)\ne\beta$, every word in the fibre is non-palindromic, and the nonzero period transfer supplies a second distinct word in that fibre. If $J(\beta)=\beta$, take a non-palindromic word from the lemma; its reverse is a second distinct word in the same fibre. Different values have disjoint fibres. Every non-palindromic reversal orbit has two words, which proves the lower bound on the number of word orbits. Apply Theorem~\ref{thm:6p-multiplicity} for the last assertion. \end{proof} For $p=5,7$, and on each other constructed branch of $3p$ or $6p$, a single primitive value already supplies two non-palindromic words. For example, $p=17,B=13$ gives $K=387$ and $\lambda=3$: there are exactly seven normalized values, three fixed values and five value orbits, while there are at least fourteen non-palindromic words and seven word orbits. No exact count of all minimum words is asserted.