English
Related papers

Related papers: Maximum Absolute Determinants of Upper Hessenberg …

200 papers

We propose a new pivotal method for estimating high-dimensional matrices. Assume that we observe a small set of entries or linear combinations of entries of an unknown matrix $A\_0$ corrupted by noise. We propose a new method for estimating…

Statistics Theory · Mathematics 2015-02-03 Olga Klopp , Stéphane Gaiffas

We establish a moderate deviations principle (MDP) for the log-determinant $\log | \det (M_n) |$ of a Wigner matrix $M_n$ matching four moments with either the GUE or GOE ensemble. Further we establish Cram\'er--type moderate deviations and…

Probability · Mathematics 2013-01-16 Hanna Döring , Peter Eichelsbacher

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Given a nonnegative integer $h$, the $h$-fold sumset $hA$ is the set of all sums of $h$ elements of $A$, and the restricted $h$-fold sumset $h^\wedge A$ is the set of all…

Number Theory · Mathematics 2025-08-19 Vivekanand Goswami , Raj Kumar Mistri

The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…

Rings and Algebras · Mathematics 2023-08-07 Matjaž Omladič , Heydar Radjavi , Klemen Šivic

An integer-valued matrix $\mathbf{A}$ is $\Delta$-modular if each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix has determinant at most $\Delta$ in absolute value. The column number problem is to determine the maximum…

Combinatorics · Mathematics 2025-09-18 Joseph Paat , Zach Walsh , Luze Xu

An $n \times n$ matrix with $\pm 1$ entries which acts on $\mathbb{R}^n$ as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices…

Probability · Mathematics 2023-03-10 Xiaoyu Dong , Mark Rudelson

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

Symbolic Computation · Computer Science 2015-04-14 Xiaolin Qin , Zhi Sun , Tuo Leng , Yong Feng

An integer Heffter array $H(m,n;s;k)$ is an $m\times n$ partially filled array whose entries are the elements of a subset $\Omega\subset \mathbb{Z}$ such that $\{\Omega,-\Omega\}$ is a partition of the set $\{1,2,\ldots,2nk\}$ and such that…

Combinatorics · Mathematics 2025-10-10 Fiorenza Morini , Marco Antonio Pellegrini

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $\Lambda_n$ is obtained from $\Gamma_n$ by removing vertices that start and end with 1. We…

Combinatorics · Mathematics 2012-01-09 Michel Mollard

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

Probability · Mathematics 2022-05-23 Patryk Pagacz , Michał Wojtylak

Consider the $2n$-by-$2n$ matrix $M=(m_{i,j})_{i,j=1}^{2n}$ with $m_{i,j} = 1$ for $i,j$ satisfying $|2i-2n-1|+|2j-2n-1| \leq 2n$ and $m_{i,j} = 0$ for all other $i,j$, consisting of a central diamond of 1's surrounded by 0's. When $n \geq…

Combinatorics · Mathematics 2007-05-23 James Propp

An algebraic integer is said large if all its real or complex embeddings have absolute value larger than $1$. An integral ideal is said \emph{large} if it admits a large generator. We investigate the notion of largeness, relating it to some…

Number Theory · Mathematics 2022-07-01 Denis Simon , Lea Terracini

Let F be an N x N complex matrix whose jth column is the vector f_j in C^N. Let |f_j|^2 denote the sum of the absolute squares of the entries of f_j. Hadamard's inequality for determinants states that |\det(F)| <= \prod_{j=1}^N|f_j|. Here…

Classical Analysis and ODEs · Mathematics 2007-05-23 Eric Carlen , Elliott H. Lieb , Michael Loss

An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We…

Discrete Mathematics · Computer Science 2015-12-29 Yuan Sun , Shiwei Ye , Yi Sun , Tsunehiko Kameda

A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum…

Rings and Algebras · Mathematics 2013-09-03 Elena Rubei

Let $\mathbf{A}\in \mathbb{R}^{n\times n}$ be a matrix with diagonal $\text{diag}(\mathbf{A})$ and let $\bar{\mathbf{A}}$ be $\mathbf{A}$ with its diagonal set to all zeros. We show that Hutchinson's estimator run for $m$ iterations returns…

Data Structures and Algorithms · Computer Science 2022-11-08 Prathamesh Dharangutte , Christopher Musco

We evaluate Hankel determinants of matrices in which the entries are generating functions for paths consisting of up-steps, down-steps and level steps with a fixed starting point but variable end point. By specialisation, these determinant…

Combinatorics · Mathematics 2018-08-31 Christian Krattenthaler , Daniel Yaqubi

We study the poset of Hamiltonian tori for polygon spaces. We determine some maximal elements and give examples where maximal Hamiltonian tori are not all of the same dimension.

Symplectic Geometry · Mathematics 2007-05-23 Jean-Claude Hausmann , Susan Tolman

Herzog, Huneke, and Srinivasan have conjectured that for any homogeneous $k$-algebra, the multiplicity is bounded above by a function of the maximal degrees of the syzygies and below by a function of the minimal degrees of the syzygies. The…

Commutative Algebra · Mathematics 2007-05-23 Rosa M. Miro-Roig

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…

Representation Theory · Mathematics 2011-10-19 Douglas Farenick , Vyacheslav Futorny , Tatiana G. Gerasimova , Vladimir V. Sergeichuk , Nadya Shvai