Related papers: The rank of a random triangular matrix over $\math…

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…

This paper concerns the enumeration of simultaneous conjugacy classes of $k$-tuples of commuting matrices in the upper triangular group $GT_n(\mathbf F_q)$ and unitriangular group $UT_m(\mathbf F_q)$ over the finite field $\mathbf F_q$ of…

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…

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Motivated by the popularity of stochastic rounding in the context of machine learning and the training of large-scale deep neural network models, we consider stochastic nearness rounding of real matrices $\mathbf{A}$ with many more rows…

In this paper, we study the fluctuation of linear eigenvalue statistics of Random Band Matrices defined by $M_{n}=\frac{1}{\sqrt{b_{n}}}W_{n}$, where $W_{n}$ is a $n\times n$ band Hermitian random matrix of bandwidth $b_{n}$, i.e., the…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

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…

The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…

We study the statistics of the largest eigenvalue lambda_max of N x N random matrices with unit variance, but power-law distributed entries, P(M_{ij})~ |M_{ij}|^{-1-mu}. When mu > 4, lambda_max converges to 2 with Tracy-Widom fluctuations…

A number of random matrix ensembles permitting exact determination of their eigenvalue and eigenvector statistics maintain this property under a rank $1$ perturbation. Considered in this review are the additive rank $1$ perturbation of the…

Fix a finite field $\mathbb F_q$ and let $A\in \mathbb F_q^{n\times n}$ be a uniformly random $n\times n$ matrix over $\mathbb F_q$. The asymptotic distribution of the determinant $\det(A)$ is well-understood, but the asymptotic…

We define matrix groups $FG_n(P)$ for each natural number $n$ and finite set of primes $P$, such that every rational-valued upper triangular matrix group is a (possibly distorted) subgroup. Brofferio and Schapira [Brofferio2011poisson],…

In this paper we characterize all distributional limits of the random quadratic form $T_n =\sum_{1\le u< v\le n} a_{u, v} X_u X_v$, where $((a_{u, v}))_{1\le u,v\le n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal and…

In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…

This paper calculates the fluctuations of eigenvalues of polynomials on large Haar unitaries cut by finite rank deterministic matrices. When the eigenvalues are all simple, we can give a complete algorithm for computing the fluctuations.…