惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
WordPress大学
WordPress大学
T
Tailwind CSS Blog
V
Visual Studio Blog
月光博客
月光博客
Hugging Face - Blog
Hugging Face - Blog
小众软件
小众软件
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - Franky
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Last Week in AI
Last Week in AI
阮一峰的网络日志
阮一峰的网络日志
量子位
有赞技术团队
有赞技术团队
酷 壳 – CoolShell
酷 壳 – CoolShell
Apple Machine Learning Research
Apple Machine Learning Research
博客园_首页
Jina AI
Jina AI
雷峰网
雷峰网
博客园 - 【当耐特】
博客园 - 叶小钗
美团技术团队
宝玉的分享
宝玉的分享
IT之家
IT之家

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Biorthogonal eigenvectors of the Holte carry matrix and c...
Daniel Andreas Moj · 2026-04-06 · via math.CO updates on arXiv.org

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$.