Paperlane

no. 14 · Friday 13 November 2026

Zero-divisor algebras of graph functions: quantum caging, entangling routing and stochastic first-passage exclusion

Fülöp Bazsó

math.MP · v3 · 29 pp

Abstract

We show how algebraic constraints on weighted graphs yield exact localization and controlled transport in quantum and stochastic systems. Antisymmetrizing a noncommutative, nonassociative product of vertex functions defines a Lie bracket. For a specified Lie cobracket over commutative rings without nonzero $2$-torsion, compatibility holds if and only if products of distinct incident edge weights vanish. When the coefficient ring is a finite product of integral domains, the edges with nonzero weights in each component of the ring form a matching. These matchings are determined by the edge weights and need not coincide across the components. These matchings yield exact two-vertex caging in fixed quantum channels; separately specified channel-selective controls enable coherent routing and path–internal-state entanglement. For matching-supported stochastic jump rates, they enforce first-passage exclusion, while prescribed internal-state switching opens inaccessible paths and yields a singular weak-switching escape limit. The bracket–cobracket factorization identifies a common edge operator underlying quantum kinetic Hamiltonians and Markov generators, subject to distinct sign and positivity conditions. The algebra fixes the channel structure; controlled motion requires additional dynamical operations.

comments
29 pages
fields
Mathematical Physics, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2311.11978 ↗