Counting Cholesky factorizations of the zero matrix over $\mathbb{F}_2$
Joshua Cooper, Hays Whitlatch

TL;DR
This paper studies the number of Cholesky factorizations of the zero matrix over the finite field with two elements, revealing equinumerosity with upper-triangular square roots and providing asymptotic counts.
Contribution
It proves the equinumerosity of Cholesky roots and upper-triangular square roots of the zero matrix over , and derives asymptotic formulas for their counts.
Findings
Number of Cholesky roots equals the number of upper-triangular square roots for each fixed rank.
Asymptotic formulas for the count of such factorizations.
Established equinumerosity over for zero matrix factorizations.
Abstract
A square, upper-triangular matrix is a Cholesky root of a matrix provided , where represents the conjugate transpose when working over the complex field and over the reals and finite fields. In this paper, we investigate the number of such factorizations over the finite field with two elements, , and prove the equinumerosity, for each fixed rank, of the Cholesky roots of and the upper-triangular square roots of the zero matrix. We then provide asymptotics for this count and finish with a few directions for future inquiry.
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
TopicsMatrix Theory and Algorithms · Polynomial and algebraic computation · Tensor decomposition and applications
