English
Related papers

Related papers: Maximum Absolute Determinants of Upper Hessenberg …

200 papers

We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed according to the Haar measure over the orthogonal or unitary group. Our technique samples directly a factorization of the Hessenberg form of such…

Numerical Analysis · Mathematics 2021-02-25 Massimiliano Fasi , Leonardo Robol

Unitary matrices which are zero below the secondary diagonal (Hessenberg unitary matrices) have many uses in analysis. Given a set of needed conditions on a unitary matrix, this algorithm will give the sparsest unitary matrix. We give an…

Functional Analysis · Mathematics 2011-11-11 Janet C. Tremain

The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…

Combinatorics · Mathematics 2024-09-26 Gabriele Nebe

Determinant maximization provides an elegant generalization of problems in many areas, including convex geometry, statistics, machine learning, fair allocation of goods, and network design. In an instance of the determinant maximization…

Data Structures and Algorithms · Computer Science 2022-11-22 Adam Brown , Aditi Laddha , Madhusudhan Pittu , Mohit Singh

We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive…

Combinatorics · Mathematics 2026-02-26 Brandon Koprowski , Joel Brewster Lewis

Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson…

Cryptography and Security · Computer Science 2025-08-19 Xingxing Xu , Minjia Shi , Patrick Sole

We introduce a definition of the volume for a general rectangular matrix, which for square matrices is equivalent to the absolute value of the determinant. We generalize results for square maximum-volume submatrices to the case of…

Numerical Analysis · Mathematics 2017-11-28 A. Mikhalev , I. V. Oseledets

Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…

Rings and Algebras · Mathematics 2025-09-23 Edgar Martinez-Moro , Neennara Rodnit , Somphong Jitman

A tight Heffter array H(m,n) is an m x n matrix with nonzero entries from Z_{2mn+1} such that i) the sum of the elements in each row and each column is 0, and ii) no element from {x,-x\ appears twice. We prove that H(m,n) exist if and only…

Combinatorics · Mathematics 2015-09-02 Dan S. Archdeacon , Tomas Boothby , Jeffrey H. Dinitz

Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the…

Probability · Mathematics 2021-10-29 Matthew Kwan , Lisa Sauermann

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

Information Theory · Computer Science 2016-08-17 Daniel Salmond , Alex Grant , Ian Grivell , Terence Chan

We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.

Combinatorics · Mathematics 2011-04-27 Peter J. Cameron , Christian Krattenthaler , Thomas W. Müller

The Schur product of two complex m x n matrices is their entry wise product. We show that an extremal element X in the convex set of m x n complex matrices of Schur multiplier norm at most 1 satisfies the inequality rank(X) =< (m +n)^(1/2)…

Functional Analysis · Mathematics 2024-10-29 Erik Christensen

Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\em…

Data Structures and Algorithms · Computer Science 2012-09-21 Konstantin Kutzkov

Positive semidefinite matrices partitioned into a small number of Hermitian blocks have a remarkable property. Such a matrix may be written in a simple way from the sum of its diagonal blocks

Functional Analysis · Mathematics 2012-10-11 Jean-Christophe Bourin , Eun-Young Lee , Minghua Lin

In this paper the geometric mean of partial positive definite matrices with missing entries is considered. The weighted geometric mean of two sets of positive matrices is defined, and we show whether such a geometric mean holds certain…

Functional Analysis · Mathematics 2018-11-05 Hayoung Choi , Sejong Kim , Yuanming Shi

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…

Combinatorics · Mathematics 2021-08-12 Hongyi Jiang , Amitabh Basu

In this paper we construct two types of Hessenberg matrices with the properties that every weighted isobaric polynomial (WIP) appears as a determinant of one of them, and as the permanent of the other. Every integer sequence which is…

Number Theory · Mathematics 2012-09-21 Huilan Li , Trueman MacHenry

We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…

Combinatorics · Mathematics 2022-07-12 Gennadiy Averkov , Matthias Schymura

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

Combinatorics · Mathematics 2010-05-03 Richard P. Brent , Brendan D. McKay