Related papers: The quasi principal rank characteristic sequence

Let M be a p-by-q matrix with nonnegative entries. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices $A_i, B_j$ of size $k \times k$ such that $M_{ij} =…

The square root rank of a nonnegative matrix $A$ is the minimum rank of a matrix $B$ such that $A=B \circ B$, where $\circ$ denotes entrywise product. We show that the square root rank of the slack matrix of the correlation polytope is…

We produce neccessary and sufficient conditions for pairs of quantum minors in the quantized coordinate algebra $\Bbb{C}_q[Mat_{k \times m}]$ to quasi-commute. In addition we study the combinatorics of maximal (by inclusion) families 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 $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

The theory of quantum symmetric pairs provides a universal K-matrix which is an analogue of the universal R-matrix for quantum groups. The main ingredient in the construction of the universal K-matrix is a quasi K-matrix which has so far…

A characterization is given of those sequences of quasi-orthogonal polynomials which form also $q$-Appell sets.

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…

We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Quasipolynomial (or QP) mappings constitute a wide generalization of the well-known Lotka-Volterra mappings, of importance in different fields such as population dynamics, Physics, Chemistry or Economy. In addition, QP mappings are a…

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…

The positive semidefinite rank of a nonnegative $(m\times n)$-matrix~$S$ is the minimum number~$q$ such that there exist positive semidefinite $(q\times q)$-matrices $A_1,\dots,A_m$, $B_1,\dots,B_n$ such that $S(k,\ell) = \mbox{tr}(A_k^*…

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…

A collection of quantile curves provides a complete picture of conditional distributions. Properly centered and scaled versions of estimated curves at various quantile levels give rise to the so-called quantile regression process (QRP). In…

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…

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…

The definition of principal nest is supplemented with a system of frames that make possible the classification of combinatorial types for every level of the nest. As a consequence, we give necessary and sufficient conditions for the…