SearcharxivSearch

arXiv · 2609.00533

Singular Cholesky Fibers over Finite Fields

Abstract

For a finite field $\F_q$, consider the triangular Cholesky map $\Gamma_{n,q}(U)=U^TU$ from upper triangular matrices to symmetric matrices. Generalized Cholesky theory describes the regular locus on which all leading principal minors are nonzero, but it does not determine the multiplicities or root ranks in a fiber over a singular target. We develop a fixed-target fiber theory for this singular boundary and answer three questions posed by Cooper and Whitlatch. Our principal results concern the zero fiber. Over $\F_2$ we construct an explicit, invertible, rank-preserving recursive bijection between square-zero upper triangular matrices and upper triangular matrices satisfying $U^TU=0$. Over every finite field we determine the entire rank distribution of this zero fiber: in even characteristic the square-zero recurrence, and hence the rank-refined equinumerosity, persists over every $\F_{2^e}$, whereas in odd characteristic its failure is measured by an explicit quadratic-character correction. We place these results in a uniform framework by proving an exact first-pivot recursion for the fiber cardinality over an arbitrary symmetric target. Its regular specialization gives the constant fiber sizes on leading-principal-minor cones, while its zero-pivot branch explains the new singular behavior. For binary diagonal targets we further compress the rank-refined count to $O(n^2)$ integer-arithmetic transitions and show that it depends on the order, not merely the number, of the diagonal entries. Executable implementations and exhaustive low-order checks are collected in an appendix.

Explore related subjects

Keep this discovery

BibTeXRIS

Hongfeng Wu, Kai Zhou. 2026-09-01. Singular Cholesky Fibers over Finite Fields. https://arxiv.org/abs/2609.00533

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA