Related papers: Asymptotics for incidence matrix classes

The exact parameter values of mathematical models are often uncertain or even unknown. Nevertheless, we may have access to crude information about the parameters, e.g., that some of them are nonzero. Such information can be captured by…

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…

A new effective method for factorization of a class of nonrational $n\times n$ matrix-functions with \emph{stable partial indices} is proposed. The method is a generalization of the one recently proposed by the authors which was valid for…

We establish nonparametric identification in a class of so-called index models using a novel approach that relies on general topological results. Our proof strategy requires substantially weaker conditions on the functions and distributions…

We study the permutation action of a finite symplectic group of characteristic 2 on the set of subspaces of its standard module which are either totally isotropic or else complementary to totally isotropic subspaces with respect to the…

The problem of classification into symmetry integrable classes is solved for a family of second order nonlinear evolution equations labeled by arbitrary functions. Four nonequivalent symmetry integrable classes are thus obtained and the…

In this short note we make a few remarks on a class of generalized incidence matrices whose matroids do not depend on the orientation of the underlying graph and natural commutative algebras associated to such matrices.

We study {\em sign-restricted matrices} (SRMs), a class of rectangular $(0, \pm 1)$-matrices generalizing the alternating sign matrices (ASMs). In an SRM each partial column sum, starting from row 1, equals 0 or 1, and each partial row sum,…

The paper presents conditions on entry permutations that induce asymptotic freeness when acting on Gaussian random matrices. The class of permutations described includes the matrix transpose, as well as entry permutations relevant in…

We give a characterization for the extreme points of the convex set of correlation matrices with a countable index set. A Hermitian matrix is called a correlation matrix if it is positive semidefinite with unit diagonal entries. Using the…

The minimal excludant statistic, which denotes the smallest positive integer that is not a part of an integer partition, has received great interest in recent years. In this paper, we move on to the smallest positive integer whose frequency…

Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by…

The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…

In this paper we parameterize non-negative matrices of sum one and rank at most two. More precisely, we give a family of parameterizations using the least possible number of parameters. We also show how these parameterizations relate to a…

There is a substantial literature on testing for the equality of the cumulative incidence functions associated with one specific cause in a competing risks setting across several populations against specific or all alternatives. In this…

The objective of this paper is to introduce an approach to the study of the nonasymptotic distribution of prime numbers. The natural numbers are represented by theorem 1 in the matrix form ^2N. The first column of the infinite matrix ^2N…

Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…

We describe all linear operators which maps $n-1$-dimensional simplex of idempotent measures to itself. Such operators divided to two classes: the first class contains all $n\times n$-matrices with non-negative entries which has at least…

We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

This paper exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes. These results fall into the general domain of logic-based approaches to complexity theory and so-called implicit computational…