相关论文: The rank evolution of block bidiagonal matrices ov…

We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…

In [Frobenius1896] it was shown that many important properties of a finite group could be examined using formulas involving the character ratios of group elements, i.e., the trace of the element acting in a given irreducible representation,…

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…

In this paper we announce a conjecture concerning enumeration of 2n x k n-times persymmetric matrices over F_2 by rank.

Under the action of the general linear group with tensor structure, the ranks of matrices $A$ and $B$ forming an $m \times n$ pencil $A + \lambda B$ can change, but in a restricted manner. Specifically, with every pencil one can associate a…

We consider random lower triangular matrices such that the entries on and below the diagonal are i.i.d. copies of some $\mathbb{Z}$-valued random variable. We prove that the Sylow $p$-subgroups of the cokernels of these matrices have the…

We study a class of Markovian systems of $N$ elements taking values in $[0,1]$ that evolve in discrete time $t$ via randomized replacement rules based on the ranks of the elements. These rank-driven processes are inspired by variants of the…

We consider a notion of probabilistic rank and probabilistic sign-rank of a matrix, which measures the extent to which a matrix can be probabilistically represented by low-rank matrices. We demonstrate several connections with matrix…

This paper is motivated by basic complexity and probability questions about permanents of random matrices over finite fields, and in particular, about properties separating the permanent and the determinant. Fix $q = p^m$ some power of an…

Let $\mathbf{A}_{n,m;k}$ be a random $n \times m$ matrix with entries from some field $\mathbb{F}$ where there are exactly $k$ non-zero entries in each column, whose locations are chosen independently and uniformly at random from the set of…

We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k x l is not excessively unbalanced. This translates into saying that the dimension of the…

We address the detection of a low rank $n\times n$deterministic matrix $\mathbf{X}_{0}$ from the noisy observation ${\bf X}_{0}+{\bf Z}$ when $n\to\infty$, where ${\bf Z}$ is a complex Gaussian random matrix with independent identically…

Let $\mathbf{a} = (a_{i})_{i \geq 1}$ be a sequence in a field $\mathbb{F}$, and $f \colon \mathbb{F} \times \mathbb{F} \to \mathbb{F}$ be a function such that $f(a_{i},a_{i}) \neq 0$ for all $i \geq 1$. For any tournament $T$ over $[n]$,…

Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…

Consider a deterministic self-adjoint matrix X_n with spectral measure converging to a compactly supported probability measure, the largest and smallest eigenvalues converging to the edges of the limiting measure. We perturb this matrix by…

We study the rank of the random $n\times m$ 0/1 matrix ${\bf A}_{n,m;k}$ where each column is chosen independently from the set $\Omega_{n,k}$ of 0/1 vectors with exactly $k$ 1's. Here 0/1 are the elements of the field $GF_2$. We obtain an…

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

We study the distribution of the outliers in the spectrum of finite rank deformations of Wigner random matrice under the assumption that the off-diagonal matrix entries have uniformly bounded fifth moment and the diagonal entries have…

A spectral Favard theorem for bounded banded lower Hessenberg matrices that admit a positive bidiagonal factorization is found. The large knowledge on the spectral and factorization properties of oscillatory matrices leads to this spectral…

The low-rank matrix approximation problems within a threshold are widely applied in information retrieval, image processing, background estimation of the video sequence problems and so on. This paper presents an adaptive randomized…