相关论文: Rank of matrices with entries from a multiplicativ…

We initiate the study of the binary and Boolean rank of $0,1$ matrices that have a small rank over the reals. The relationship between these three rank functions is an important open question, and here we prove that when the real rank $d$…

For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…

Let $n_1,\ldots,n_k $ be integers larger than or equal to 2. We characterize linear maps $\phi: M_{n_1\cdots n_k}\rightarrow M_{n_1\cdots n_k}$ such that $${\mathrm rank}\,(\phi(A_1\otimes \cdots \otimes…

For an $N \times N$ matrix $A$, its rank-$r$ rigidity, denoted $\mathcal{R}_A(r)$, is the minimum number of entries of $A$ that one must change to make its rank become at most $r$. Determining the rigidity of interesting explicit families…

In a recent paper, Bruhn, Diestel, Kriesell and Wollan (arXiv:1003.3919) present four systems of axioms for infinite matroids, in terms of independent sets, bases, closure and circuits. No system of rank axioms is given. We give an easy…

Low-rank tensor approximations have shown great potential for uncertainty quantification in high dimensions, for example, to build surrogate models that can be used to speed up large-scale inference problems (Eigel et al., Inverse Problems…

In [HLS], N. Hindman, I. Leader and D. Strauss proved the abundance for a matrix with rational entries. In this paper we proved it for the ring of Gaussian integers. We showed the result when the matrix is taken with entries from…

In this paper, in the first we give definitions of some classes of division rings which strictly contain the class of centrally finite division rings. One of our main purpose is to construct non-trivial examples of rings of new defined…

We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…

Let $\mathcal{G}$ be a finite group scheme over an algebraically closed field $k$ of characteristic ${\rm char}(k)=p\geq 3$. In generalization of the familiar notion from the modular representation theory of finite groups, we define the…

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

Our focus is on the set of lower-triangular, infinite matrices that have natural operations like addition, multiplication by a number, and matrix multiplication. With respect to addition this set forms and abelian group while with respect…

We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.

We show that finding rank-$R$ decompositions of a 3D tensor, for $R\le 4$, over a fixed finite field can be done in polynomial time. However, if some cells in the tensor are allowed to have arbitrary values, then rank-2 is NP-hard over the…

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…

We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.

We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available…

Let $G$ be a finite group with derived subgroup of rank $r$. We prove that $\gzz\leq |G'|^{2r}$. Motivated by the results of I. M. Isaacs in \cite{isa} we show that if $G$ is capable then $\gz\leq |G'|^{4r}$. This answers a question of L.…

We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(\lambda)$ into products of three, $P(\lambda) = L(\lambda) E(\lambda) R(\lambda)$, or two, $P(\lambda) = L(\lambda) R(\lambda)$, polynomial matrices. Among…

Matrices with low-rank structure are ubiquitous in scientific computing. Choosing an appropriate rank is a key step in many computational algorithms that exploit low-rank structure. However, estimating the rank has been done largely in an…