Search arXivSearch

arXiv · 2503.11114

Maximal determinants of matrices over the roots of unity

Abstract

We study the maximum absolute value of the determinant of matrices with entries in the set of $\ell$-th roots of unity; this is a generalization of $D$-optimal designs and Hadamard's maximal determinant problem, which involves $\pm 1$ matrices. For general values of $\ell$, we give sharpened determinantal upper bounds and constructions of matrices of large determinant. The maximal determinant problem in the cases $\ell = 3$, $\ell = 4$ is similar to the classical Hadamard maximal determinant problem for matrices with entries $\pm 1$, and many techniques can be generalized. For $\ell = 3$ we give an additional construction of matrices with large determinant, and calculate the value of the maximal determinant over $μ_3$ for all orders $n < 14$. Additionally, we survey the case $\ell = 4$ and exhibit an infinite family of maximal determinant matrices over the fourth roots of unity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guillermo Nuñez Ponasso. 2025-03-14. Maximal determinants of matrices over the roots of unity. https://arxiv.org/abs/2503.11114

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO