Related papers: On Maximum, Typical and Generic Ranks
Many statistical experiments involve comparing multiple population groups. For example, a public opinion poll may ask which of several political candidates commands the most support; a social scientific survey may report the most common of…
We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal…
Previous research established that the maximal rank of the abstract regular polytopes whose automorphism group is a transitive proper subgroup of $\mbox{S}_n$ is $n/2 + 1$. Up to isomorphism and duality, when $n\geq 12$, there are only two…
For families of all theories of arbitrary given languages we describe ranks and degrees. In particular, we characterize (non-)totally transcendental families. We apply these characterizations for the families of all theories of given…
Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…
There is both theoretical and numerical evidence that the set of irreducible representations of a reductive group over local or finite fields is naturally partitioned into families according to analytic properties of representations.…
Rank-2 and rank-3 tensors are almost all identifiable with only few exceptions. We classify them all together with the dimensions and the structures of all the sets evincing the rank.
In this paper, we show that there are infinitely many semisimple tensor (or monoidal) categories of rank two over an algebraically closed field $\mathbb F$.
The warping matrix has been defined for knot projections and knot diagrams by using warping degrees. In particular, the warping matrix of a knot diagram represents the knot diagram uniquely. In this paper we show that the rank of the…
A rank estimator in robust regression is a minimizer of a function which depends (in addition to other factors) on the ordering of residuals but not on their values. Here we focus on the optimization aspects of rank estimators. We…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
Let $A$ be a non-zero abelian variety over a field $F$ that is not algebraic over a finite field. We prove that the rational rank of the abelian group $A(F)$ is infinite when $F$ is large in the sense of Pop (also called ample). The main…
We show that the slice rank of the direct sum of two tensors is equal to the sum of their slice ranks. The upper bound is trivial, but the lower bound needs more than a one-line proof, for reasons we explain. This result generalizes the…
In this paper we study the $X$-rank of points with respect to smooth linearly normal curves $X\subset \PP n$ of genus $g$ and degree $n+g$. We prove that, for such a curve $X$, under certain circumstances, the $X$-rank of a general point of…
We study the relationship between the commutative and the non-commutative rank of a linear matrix. We give examples that show that the ratio of the two ranks comes arbitrarily close to 2. Such examples can be used for giving lower bounds…
Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite fields and we establish new asymptotical and not asymptotical upper bounds about it.
We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…
We theoretically and experimentally investigate tensor-based regression and classification. Our focus is regularization with various tensor norms, including the overlapped trace norm, the latent trace norm, and the scaled latent trace norm.…
In this paper we introduce the open Waring rank of a form of degree d in n variables and prove the that this rank in bounded from above by \binom{n+d-2}{d-1} - \binom{n+d-6}{d-3} whenever n, d >= 3. This proves the same upper bound for the…