Related papers: Restricted lonesum matrices
The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical…
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…
We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the leading asymptotics for the number of matrices with $n$ ones…
We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…
This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…
We review some aspects of recent work concerning double scaling limits of singularly perturbed hermitian random matrix models and their connection to Painlev\'{e} equations. We present new results showing how a Painlev\'{e} III hierarchy…
A permutative matrix is a square matrix such that every row is a permutation of the first row. A constructive version of a result attributed to Suleimanova is given via permutative matrices. In addition, we strengthen a well-known result by…
We develop a purely combinatorial theory of limit linear series on metric graphs. This will be based on the formalisms of hypercube rank functions and slope structures. We provide a full classification of combinatorial limit linear series…
We develop recursive formulas for the horizontal and vertical monodromies of a quasi-ordinary surface. These are monodromies associated to the Milnor fiber of a slice transverse to a component of the singular locus. In the course of working…
Let $Z\subset{\bf P}^{n-1}$ be a hypersurface such that the associated reduced hypersurface $Z_{\rm red}$ has only weighted homogeneous isolated singularities. In the case $Z$ is a reduced curve or $Z_{\rm red}$ has only homogeneous…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
Finite dimensional matrices having more columns than rows have no left inverses while those having more rows than columns have no right inverses. We give generalizations of these simple facts to bi--infinite matrices and use those to obtain…
The uniqueness of the Perron vector of a nonnegative block matrix associated to a multiplex network is discussed. The conclusions come from the relationships between the irreducibility of some nonnegative block matrix associated to a…
A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. The adjacency matrix of a graph is…
We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…
New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…
This paper considers compressed sensing matrices and neighborliness of a centrally symmetric convex polytope generated by vectors $\pm X_1,...,\pm X_N\in\R^n$, ($N\ge n$). We introduce a class of random sampling matrices and show that they…
We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…
In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…