SearcharxivSearch

arXiv · 2608.04294

Two absolutely bounded determinantal ratios

Abstract

Bounded ratios of products of minors of positive definite matrices have a long history, starting with Hadamard's inequality in 1893. It states that for every positive semidefinite matrix $A$ $$ \det A \le A_{11} \cdots A_{nn}. $$ This inequality was subsequently generalized by Fisher and then further by Koteljanskii. The latter states that for every positive semidefinite matrix $A$ and any index sets $\alpha_1, \alpha_2 \subseteq \{1,\ldots, n\}$ one has $$ \det A[\alpha_1 \cup \alpha_2] \det A[\alpha_1 \cap \alpha_2] \le \det A[\alpha_1] \det A[\alpha_2], $$ where $A[\alpha]$ denotes the principal submatrix determined by the indexes in $\alpha$. In a manuscript published only on the arXiv in 2008, Hall and Johnson made three conjectures about ratios of products of principal minors of $4\times4$ positive definite matrices, denoted by $R_i$, $i=1,2,3$, see (2) and (3). They hypothesized that the supremum of $R_1$ was $27/16$, while the supremum of the other two ratios was $1$. Such ratios are called absolutely bounded. The conjecture for $R_1$ was affirmed in [17] and it is the only known bounded determinantal ratio with supremum bigger than one. The goal of this paper is to affirm the conjecture for $R_2$ and $R_3$. It is known that the upper bound for the ratios $R_i$, $i=1,2,3$, does not follow from repeated applications of Koteljanskii's inequality. In addition, Hall and Johnson showed that $R_i$ is bounded above by $4$, for $i=1,2,3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Hristo Sendov, Mengxu Yuan. 2026-08-05. Two absolutely bounded determinantal ratios. https://arxiv.org/abs/2608.04294

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