Related papers: On some matrix counting problems
Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called…
The Restricted Invertibility problem is the problem of selecting the largest subset of columns of a given matrix $X$, while keeping the smallest singular value of the extracted submatrix above a certain threshold. In this paper, we address…
A few matrix-vector multiplications with random vectors are often sufficient to obtain reasonably good estimates for the norm of a general matrix or the trace of a symmetric positive semi-definite matrix. Several such probabilistic…
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…
We review recent progress on Horn's problem, which asks for a description of the possible eigenspectra of the sum of two matrices with known eigenvalues. After revisiting the classical case, we consider several generalizations in which the…
We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…
In this paper, we generalize the algorithm described by Rump and Graillat, as well as our previous work on certifying breadth-one singular solutions of polynomial systems, to compute verified and narrow error bounds such that a slightly…
We consider nonnegative integer matrices with specified row and column sums and upper bounds on the entries. We show that the logarithm of the number of such matrices is approximated by a concave function of the row and column sums. We give…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…
In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…
The problem of completing a large matrix with lots of missing entries has received widespread attention in the last couple of decades. Two popular approaches to the matrix completion problem are based on singular value thresholding and…
A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…
Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…
In this paper we consider the trace regression model. 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 rank penalized estimator of $A_0$. For…
Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve IPs where the constraint matrix has bounded subdeterminants…
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…