Search arXivSearch

arXiv · 2508.04657

Cholesky decomposition for symmetric matrices over finite fields

Abstract

Inspired by the seminal work of André-Louis Cholesky -- whose contributions remain crucial in broader sciences even after more than a century -- Cooper, Hanna and Whitlatch (2024) developed a theory of positive matrices over finite fields, and Khare and Vishwakarma (2025) described a general Cholesky factorization for a dense sub-family of the cone of Hermitian matrices over real/complex fields, whose leading principal minors (LPM) are nonzero. Building on this, we develop a parallel theory within the finite field setting. Specifically $(i)$ we extend the general Cholesky factorization to the LPM cone over finite fields which has asymptotic density $1$. We show that $(ii)$ this factorization is compatible with the entrywise Frobenius map, recently studied in the context of positivity preservers by Guillot, Gupta, Vishwakarma, and Yip [J. Algebra, 2025]. We also $(iii)$ leverage the Cholesky-structures to define meaningful group operations on the matrix cone, and as an application $(iv)$ enumerate sub-cones of LPM matrices using our general Cholesky factorizations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Prateek Kumar Vishwakarma. 2025-08-07. Cholesky decomposition for symmetric matrices over finite fields. https://arxiv.org/abs/2508.04657

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO