Related papers: Weak log majorization and determinantal inequaliti…

Let $A = \begin{bmatrix} E & F \\ F^T & G \end{bmatrix}$ be a $2n \times 2n$ real positive definite matrix, where $E, F,$ and $G$ are $n \times n$ blocks. It is shown that $\ d(E \oplus G) \prec^w d(A)$. Here $d(A)$ denotes the $n$-vector…

Motivated by Horn's log-majorization (singular value) inequality $s(AB)\underset{log}{\prec} s(A)*s(B)$ and the related weak-majorization inequality $s(AB)\underset{w}{\prec} s(A)*s(B)$ for square complex matrices, we consider their…

We prove a quantitative deterministic equivalence theorem for the logarithmic potentials of deterministic complex $N\times N$ matrices subject to small random perturbations. We show that with probability close to $1$ this log-potential is,…

Given a linear map $T$ on a Euclidean Jordan algebra of rank $n$, we consider the set of all nonnegative vectors $q$ in $R^n$ with decreasing components that satisfy the pointwise weak-majorization inequality…

We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an…

Under reasonable algebraic assumptions and under an infinite second order moment assumption, we show that the logarithm of the norm (log-norm) of a product of random i.i.d. matrices with entries in $\mathbb{R}$ or in any other local field…

Majorization inequalities have a long history, going back to Maclaurin and Newton. They were recently studied for several families of symmetric functions, including by Cuttler--Greene--Skandera (2011), Sra (2016), Khare--Tao (2021),…

In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical…

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…

We establish a consistency result by comparing two independent notions of generalised solutions to a large class of linear hyperbolic first order PDE systems with constant coefficients, showing that they eventually coincide. The first is…

The purpose of this paper is two-fold: we present some matrix inequalities of log-majorization type for eigenvalues indexed by a sequence; we then apply our main theorem to generalize and improve the Hua-Marcus' inequalities. Our results…

The Chow polynomial of a matroid is a fundamental invariant whose coefficients exhibit strong positivity properties, including $\gamma$-positivity. We interpret the normalized Chow coefficients as a probability distribution and establish…

Let $A,B\in\mathbb{H}_n$ and set $H=A+B$. For each integer $k\ge 1$ define $$ Q_k:=\sum_{p=0}^k \binom{k}{p} A^pB^{k-p}, R_k:=\Re\,Q_k=\frac{Q_k+Q_k^*}{2}. $$ Then $H^k=\left.\frac{d^k}{dt^k}e^{Ht}\right|_{t=0}$ and…

Let $A_n$ be an $n$ by $n$ random matrix whose entries are independent real random variables with mean zero, variance one and with subexponential tail. We show that the logarithm of $|\det A_n|$ satisfies a central limit theorem. More…

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

We study the Pascal determinantal arrays $\PD_k$, whose entries $\PD_k(i,j)$ are the $k\times k$ minors of the lower-triangular Pascal matrix $P=( \binom{a}{b} )_{a,b\ge 0}$. We prove an exact factorization of the row-wise log-concavity…

Let $M$ be an $n\times n$ random i.i.d. matrix. This paper studies the deviation inequality of $s_{n-k+1}(M)$, the $k$-th smallest singular value of $M$. In particular, when the entries of $M$ are subgaussian, we show that for any…

We compare weighted sums of i.i.d. positive random variables according to the usual stochastic order. The main inequalities are derived using majorization techniques under certain log-concavity assumptions. Specifically, let $Y_i$ be i.i.d.…

Let $M_n$ be a random $n\times n$ matrix with i.i.d. $\text{Bernoulli}(1/2)$ entries. We show that for fixed $k\ge 1$, \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…