Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.11978

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

Fülöp Bazsó
View original source ↗Read source document ↗Export metadata ↓

Abstract

We construct Lie-bialgebraic differential structures on vertex functions of a finite graph using coefficients in commutative algebras with zero divisors. We derive the exact Jacobi criterion for the graph bracket and classify its solutions. Over an integral domain, each connected component of the nonzero support is a uniformly weighted clique; over $\mathbb C^q$, the general solution is a superposition of such clique layers. A four-vertex diamond built from overlapping triangle layers shows that Jacobi compatibility is strictly broader than the matching geometry generated by proper edge colouring. For the canonical cobracket, we prove a rigidity theorem over commutative $2$-torsion-free rings: Lie-bialgebra compatibility is equivalent to the local annihilation condition $w_{ij}w_{ik}=0$ for distinct incident edges. Hence the canonical bialgebra selects matching layers from the wider Jacobi-compatible class. The same structure makes the weighted graph Laplacian an inner derivation and yields an incidence-type vertex--edge calculus with a positive squared-Laplacian factorization. Representing the idempotent channels by internal-state projectors gives exact quantum caging and channel-controlled transfer that creates path--channel entanglement. The ordered real realization gives an intrinsic graph Fokker--Planck equation, exact first-passage exclusion, and a solvable crossover to escape under weak channel switching. These models are deliberately reducible; their role is to exhibit the quantum and stochastic consequences of the matching geometry selected by canonical bialgebra compatibility.

Explore related subjects

math-phmath.COmath.MPmath.RA

Keep this discovery

BibTeXRIS

Fülöp Bazsó. 2023-11-20. Zero-divisor algebras of graph functions: quantum caging, entangling routing and stochastic first-passage exclusion. https://arxiv.org/abs/2311.11978

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗