Related papers: The rank of the endomorphism monoid of uniformly n…

The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposition measures the sensitivity of the rank-1 summands with…

In this paper we prove a stability theorem for block diffeomorphisms of 2d-dimensional manifolds that are connected sums of S^d x S^d. Combining this with a recent theorem of S. Galatius and O. Randal-Williams and Morlet's lemma of…

We give a formula for the stable rank of inclusions of unital Banach algebras in the sense of finite Watatani index. As an application we show that the stable rank of $\ell^1$-algebras of Disk algebras by any action of finite groups is 2.

In this paper we prove that any strongly embedded subgroup of a K*-group G of finite Morley rank and odd type that does not interpret any bad field is solvable if its Pruefer 2-rank is at least 2. If the normal 2-rank of G is at least 3…

Estimating the linear dimensionality of a data set in the presence of noise is a common problem. However, data may also be corrupted by monotone nonlinear distortion that preserves the ordering of matrix entries but causes linear methods…

We prove the conjecture of Falikman--Friedland--Loewy on the parity of the degrees of projective varieties of $n\times n$ complex symmetric matrices of rank at most $k$. We also characterize the parity of the degrees of projective varieties…

In the previous work, Lim and the author determined the rank variety of the simple $\mathbb{F}\mathfrak{S}_{kp}$-module $D(p-1)=D^{(kp-p+1,1^{p-1})}$ with respect to some maximal elementary abelian $p$-subgroup $E_k$ and the complexity when…

We prove that general unions of singularity schemes of multiplicity two in the projective plane have maximal rank.

We show that if the monodromy of a 3-manifold M that fibers over the circle has large translation distance in the curve complex, then the rank of the fundamental group of M is 2g+1, where g is the genus of the fiber.

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

We give a lower bound for the degree of a finite apolar subscheme of a symmetric form F, in terms of the degrees of the generators of the annihilator ideal of F. In the special case, when F is a monomial x_0^d_0 x_2^d_2... x_n^d_n with…

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…

It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this paper, we consider a family of submodular set functions,…

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

The rank of a $d$-dimensional polytope $P$ is defined by $F-(d+1)$, where $F$ denotes the number of facets of $P$. In this paper, We focus on the toric rings of $(0,1)$-polytopes with small rank. We study their normality, the…

In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most $1$.

Recent investigations on the catenary degrees of numerical monoids have demonstrated that this invariant is a powerful tool in understanding the factorization theory of this class of monoids. Although useful, the catenary degree is largely…