Uniform calibrated mergers of four Jordan blocks under the Aluthge transform

Four fixed Jordan blocks are joined by three positive links of maximum size μ. For ordinary half-Aluthge iteration, we derive a calibrated positive bidiagonal reference and an estimate C[(m₀+1)^(−ρ)+μ^η], uniform over all integer observation times m ≥ m₀, for every fixed 0 < ρ < 1/2 and some constructible η > 0. The matrix comparison is in a specified moving triangular gauge. Its constants do not involve link ratios, exponent gaps or merger waiting times. Three entrance amplitudes leave two transition parameters after time translation. The entry argument divides higher entries by their first-link paths and orders the resulting coordinates by the cuts they cross; the longest class retains forcing from lower classes. Polynomial fifth-order prefix bounds and non-expansive logarithmic comparison then control the whole future. An exact cut product and cooperative comparison identify calibrated profiles for all six strict merger orders. These include two disjoint early pairs with equal outer clocks. General constants have terminating constructions but have not been evaluated as practical accuracy certificates. The principal results remain provisional candidate claims.

Authors

Publication Details

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

Uniform calibrated mergers of four Jordan blocks under the Aluthge transform

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

Uniform calibrated mergers of four Jordan blocks under the Aluthge transform

Robert Barritz
preprint en

Abstract

Four fixed Jordan blocks are joined by three positive links of maximum size μ. For ordinary half-Aluthge iteration, we derive a calibrated positive bidiagonal reference and an estimate C[(m₀+1)^(−ρ)+μ^η], uniform over all integer observation times m ≥ m₀, for every fixed 0 < ρ < 1/2 and some constructible η > 0. The matrix comparison is in a specified moving triangular gauge. Its constants do not involve link ratios, exponent gaps or merger waiting times. Three entrance amplitudes leave two transition parameters after time translation. The entry argument divides higher entries by their first-link paths and orders the resulting coordinates by the cuts they cross; the longest class retains forcing from lower classes. Polynomial fifth-order prefix bounds and non-expansive logarithmic comparison then control the whole future. An exact cut product and cooperative comparison identify calibrated profiles for all six strict merger orders. These include two disjoint early pairs with equal outer clocks. General constants have terminating constructions but have not been evaluated as practical accuracy certificates. The principal results remain provisional candidate claims.

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