Related papers: On the singularity of random combinatorial matrice…

In this paper we show that any Bohr-zero non-periodic set $B$ of traceless integer valued matrices, denoted by $\Lambda$, intersects non-trivially the conjugacy class of any matrix from $\Lambda$. As a corollary, we obtain that the family…

The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…

In this paper, we study the condition number of a random Toeplitz matrix. Since a Toeplitz matrix is a diagonal constant matrix, its rows or columns cannot be stochastically independent. This situation does not permit us to use the classic…

Let M be a matroid on E, representable over a field of characteristic zero. We show that h-vectors of the following simplicial complexes are log-concave: 1. The matroid complex of independent subsets of E. 2. The broken circuit complex of…

Let $n \in \mathbb{Z}_{\geq 3}.$ Given any Borel subset $A$ of $\mathbb{R}^n$ with finite and nonzero measure, we prove that the probability that the set of primitive points of a random full-rank unimodular lattice in $\mathbb{R}^n$ does…

The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…

Lonesum matrices are matrices that are uniquely reconstructible from their row and column sum vectors. These matrices are enumerated by the poly-Bernoulli numbers that are related to the multiple zeta values and have a rich literature in…

We study the set of no-signalling empirical models on a measurement scenario, and show that the combinatorial structure of the no-signalling polytope is completely determined by the possibilistic information given by the support of the…

Using the random matrix theory we demonstrate explicitly the insensitivity of the transverse force on a moving vortex to non-intrinsic and non-magnetic impurities in a superconductor.

It is well known that a random vector with given marginal distributions is comonotonic if and only if it has the largest sum with respect to the convex order [ Kaas, Dhaene, Vyncke, Goovaerts, Denuit (2002), A simple geometric proof that…

We study a class of square matrices with non-negative elements which have cyclically monotone rows in the sense that each row of a matrix from the class consists of a cyclically non-increasing sequence of numbers starting from a maximal…

A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease along rows and columns when moving toward the diagonal. A…

A set of binary random variables indexed by a lattice torus is considered. Under a mixing hypothesis, the probability of any proposition belonging to the first order logic of colored graphs tends to 0 or 1, as the size of the lattice tends…

Let $d\geq 3$ be a fixed integer, and a prime number $p$ such that $\gcd(p,d)=1$. Let $A$ be the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. We show that as a random matrix in ${\mathbb F}_p$, \begin{equation}…

Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…

The asymptotic freeness of independent unitarily invariant $N\times N$ random matrices holds in expectation up to $O(N^{-2})$. An already known consequence is the infinitesimal freeness in expectation. We put in evidence another consequence…

Let M and N be two r x r matrices over a discrete valuation ring of characteristic zero. The orders (with respect to a uniformizing parameter) of the invariant factors of M form a partition of non-negative integers, called the invariant…

Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices…

We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…

Given $X$ a random vector in ${\mathbb{R}}^n$, set $X_1,...,X_N$ to be independent copies of $X$ and let $\Gamma=\frac{1}{\sqrt{N}}\sum_{i=1}^N <X_i,\cdot>e_i$ be the matrix whose rows are $\frac{X_1}{\sqrt{N}},\dots, \frac{X_N}{\sqrt{N}}$.…