SearcharxivSearch

arXiv subjects

Daniel Andreas Moj

Publications and source records attributed to Daniel Andreas Moj.

2 recordsLinked to original sources

Biorthogonal eigenvectors of the Holte carry matrix and cascade-free enumeration

For $k$-summand base-$N$ addition, the carry process is a Markov chain on $\{0,\ldots,k-1\}$ whose transition matrix--the Holte matrix $T$--has eigenvalues $\{N^{-j}\}_{j=0}^{k-1}$, all simple and independent of $N$. We give the complete biorthogonal eigenvector system. The left eigenvectors factor as $\sum_i u_j[i] x^i = c_{k,j} (x-1)^j A_{k-j}(x)$, where $c_{k,j} = |s(k,k-j)|/k!$ involves unsigned Stirling numbers and $A_n(x)$ is the Eulerian polynomial. The right eigenvectors satisfy $\sum_i \binom{k-1}{i} v_j[i] x^i = (1+x)^{k-1-j} Q_j(x)$, where the quotient polynomials $Q_j$ have palindrome symmetry $x^j Q_j(1/x) = (-1)^j Q_j(x)$ and converge to $(1-x)^j$ as $k \to \infty$; for $j \le 3$, we give explicit closed forms in terms of $k$. The cascade-free avoidance count satisfies $a(L) = (\sqrt{d})^L U_L(x)$ (Chebyshev polynomial of the second kind) whenever the restricted transfer matrix has dimension $d \le 2$; we prove this is sharp: for $k$-summand addition, Chebyshev form holds for $k = 3$ and fails for $k \ge 4$. The proof uses oscillatory matrix theory to establish non-vanishing of all spectral residues. The characteristic polynomial of the restricted transfer matrix is determined in closed form by a Stirling-weighted Lagrange interpolation at the Holte eigenvalues. Two systems with binary carry state spaces are shadow-equivalent if and only if they share the pair $(N, d)$. The general classification for $k$-state systems reduces to the characteristic polynomial of $T$.

math.CO

Cascade-free sequences, dispersion index, and state avoidance for stateful digit-wise operations

We show that cascade-free counting from carry theory is a special case of a general transfer matrix construction. For any binary stateful digit-wise operation with GEN/PROP/KILL decomposition, the number of cascade-free sequences of length $L$ depends on only two parameters: the alphabet size $N$ and the product $d = |\text{GEN}| \cdot |\text{PROP}|$. The resulting sequence satisfies $a(L) = N a(L-1) - d a(L-2)$ and equals a scaled Chebyshev polynomial of the second kind with coupling parameter $x = N/(2\sqrt{d}) \geq 1$. We instantiate this for digit-wise addition and doubling in base $p$. For odd primes the exact relation $a_{\text{carry}}(L) = p^L a_{\text{dbl}}(L)$ holds. For $p = 3$ the cascade-free doubling count equals the Fibonacci bisection $F(2L+2)$ via $U_L(3/2) = F(2L+2)$ (OEIS A001906); we are not aware of this interpretation in the existing literature. We analyse the dispersion index $D = \text{Var}(ν)/E[ν]$ of the state count for uniformly distributed inputs. For symmetric chains ($g = k$) the Poisson transition $D_\infty = 1$ occurs at $μ= 1/3$, corresponding to base 3 where the Fibonacci bisection appears. The finite Poisson transition point $μ^*(L)$ decreases strictly to $1/3$ with rate $1/(6L) + O(1/L^2)$. We generalise to state spaces $|S| > 2$ via state avoidance. The restricted transfer matrix has dimension $s-1$; the Chebyshev representation persists for $|S| = 3$.

math.CO