Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.00788

Positive Bidiagonal Factorizations for Banded Markov Processes

Manuel Mañas
View original source ↗Read source document ↗Export metadata ↓

Abstract

An ordered positive bidiagonal factorization (PBF) is used to develop a spectral and probabilistic theory for Markov transition matrices of arbitrary finite bandwidth. The factors determine two families of mixed-type multiple orthogonal polynomials, an entrywise positive $q\times p$ matrix of measures, and a sequence of elementary death-or-stay and birth-or-stay transitions. This yields Karlin-McGregor formulas for transition probabilities, Green kernels, resolvents, potentials, and first-passage transforms without reversibility or block symmetrizability. Rational stochastic PBFs are characterized by ordered finite-urn experiments. Cyclic reorderings give Darboux intertwinings, while a factor-resolved continued fraction gives the first-return law. Grouping states produces a finite-phase quasi-birth-and-death process and a matrix continued fraction for return time and phase. For bounded continuous-time generators, uniformization preserves the spectral data. For unbounded rates, a conservative generator whose shifted leading truncations all admit scalar PBFs must be tridiagonal; nevertheless, $Q=V(T-I)$ preserves arbitrary fixed bandwidth and separates the embedded chain from the holding rates. The theory is explicit for mixed Pi\~neiro and Jacobi-like systems. For Pi\~neiro, the exact PBF region and larger structural-band positivity regions are obtained. Jacobi-like beta-convolution weights admit Gamma-factor cancellations, complete cancellation recovering Pi\~neiro. For $q\in\{2,3,4\}$, the strict ordering conditions give the only open PBF region, with further lower-dimensional cancellation strata. Rational $(3,2)$ examples provide all factors and the resulting Markov models.

Explore related subjects

math.CAmath-phmath.MPmath.PRmath.SP

Keep this discovery

BibTeXRIS

Manuel Mañas. 2026-08-01. Positive Bidiagonal Factorizations for Banded Markov Processes. https://arxiv.org/abs/2608.00788

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

KEEP EXPLORING

Related papers

arXiv2026

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA↗
arXiv2026

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA↗
arXiv2026

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA↗