Uniform power-law bounds for finite Jordan-block chains under the Aluthge transform

A fixed finite chain of Jordan blocks is joined by positive entries of maximum size mu. For ordinary half-Aluthge iteration in a specified moving triangular gauge, a calibrated positive bidiagonal reference gives a bound C[(m0+1)^(-rho)+mu^eta], uniform for all integer times m>=m0, for every rational 0<rho<1/2 and some eta>0. Constants depend on the fixed block sizes, with no lower bound on a joining entry or ratio and no merger waiting-time factor. An all-order consecutive-cut identity gives relative-coordinate entry; finite-order polynomial prefix bounds, exact adjacent-block calibration and logarithmic non-expansion control the whole future. Constants have terminating constructions; practical accuracy certificates and uniformity in growing dimension are not asserted. The principal theorem remains a provisional candidate.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23921074
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Uniform power-law bounds for finite Jordan-block chains under the Aluthge transform

Robert Barritz
Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
preprint

Uniform power-law bounds for finite Jordan-block chains under the Aluthge transform

Robert Barritz
preprint en

Abstract

A fixed finite chain of Jordan blocks is joined by positive entries of maximum size mu. For ordinary half-Aluthge iteration in a specified moving triangular gauge, a calibrated positive bidiagonal reference gives a bound C[(m0+1)^(-rho)+mu^eta], uniform for all integer times m>=m0, for every rational 0<rho<1/2 and some eta>0. Constants depend on the fixed block sizes, with no lower bound on a joining entry or ratio and no merger waiting-time factor. An all-order consecutive-cut identity gives relative-coordinate entry; finite-order polynomial prefix bounds, exact adjacent-block calibration and logarithmic non-expansion control the whole future. Constants have terminating constructions; practical accuracy certificates and uniformity in growing dimension are not asserted. The principal theorem remains a provisional candidate.

Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon