On the Number of Cholesky Roots of the Zero Matrix over F2
Hays Whitlatch

TL;DR
This paper investigates the number of Cholesky roots of the zero matrix over the finite field F2, establishing a bijection with upper-triangular square roots and contributing to understanding matrix factorizations in finite fields.
Contribution
It proves a rank-preserving bijection between Cholesky roots and upper-triangular roots of the zero matrix over F2, revealing new structural insights.
Findings
Number of Cholesky roots of zero matrix over F2 characterized
Existence of a rank-preserving bijection established
Structural relationship between different matrix factorizations over F2
Abstract
A square, upper-triangular matrix U is a Cholesky root of a matrix M provided U*U=M, where * represents the conjugate transpose. Over finite fields, as well as over the reals, it suffices for U^TU=M. In this paper, we investigate the number of such factorizations over the finite field with two elements, F2, and prove the existence of a rank-preserving bijection between the number of Cholesky roots of the zero matrix and the upper-triangular square roots the zero matrix.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Genome Rearrangement Algorithms · DNA and Biological Computing
