English
Related papers

Related papers: Rational and real positive semidefinite rank can b…

200 papers

We introduce the problem of ranking with slot constraints, which can be used to model a wide range of application problems -- from college admission with limited slots for different majors, to composing a stratified cohort of eligible…

Information Retrieval · Computer Science 2023-10-30 Wentao Guo , Andrew Wang , Bradon Thymes , Thorsten Joachims

We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a…

Combinatorics · Mathematics 2018-10-18 Amin Coja-Oghlan , Pu Gao

We prove that the Strong Maximal Rank Conjecture holds for quadrics in $\mathbb{P}^3$ and we prove the existence of a component of the expected dimension in $\mathbb{P}^4$, as well as in a wide range of parameters $(g,d)$ in $\mathbb{P}^r$…

Algebraic Geometry · Mathematics 2026-05-26 Vlad Robu

The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices is said to satisfy the finiteness…

Spectral Theory · Mathematics 2011-09-23 Ian D. Morris

We study ranks of the $r\textrm{th}$ Hadamard powers of doubly nonnegative matrices and show that the matrix $A^{\circ r}$ is positive definite for every $n\times n$ doubly nonnegative matrix $A$ and for every $r>n-2$ if and only if no…

Classical Analysis and ODEs · Mathematics 2020-04-09 Tanvi Jain

Mathematically characterizing the implicit regularization induced by gradient-based optimization is a longstanding pursuit in the theory of deep learning. A widespread hope is that a characterization based on minimization of norms may…

Machine Learning · Computer Science 2020-10-20 Noam Razin , Nadav Cohen

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…

Combinatorics · Mathematics 2025-12-25 Priyanshu Pant , Surabhi Chakrabartty , Ranveer Singh

Using elementary linear algebra, we develop a technique that leads to solutions of two widely known problems on nonnegative matrices. First, we give a short proof of the result by Vavasis stating that the nonnegative rank of a matrix is…

Combinatorics · Mathematics 2018-01-01 Yaroslav Shitov

The set of real matrices of upper-bounded rank is a real algebraic variety called the real generic determinantal variety. An explicit description of the tangent cone to that variety is given in Theorem 3.2 of Schneider and Uschmajew [SIAM…

Optimization and Control · Mathematics 2026-03-20 Guillaume Olikier , Petar Mlinarić , P. -A. Absil , André Uschmajew

It is well-known that a symmetric matrix with its entries $\pm1$ is not positive definite. But this is not ture for symmetric tensors (hyper-matrix). In this paper, we mainly dicuss the positive (semi-)definiteness criterion of a class of…

Optimization and Control · Mathematics 2025-03-06 Li Ye , Yisheng Song

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…

Rings and Algebras · Mathematics 2023-08-28 Nik Stopar

The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…

Algebraic Geometry · Mathematics 2020-04-15 Garritt Johns , Zach Teitler

We give the stratification by the symmetric tensor rank of all degree $d \ge 9$ homogeneous polynomials with border rank $5$ and which depend essentially on at least 5 variables, extending previous works (A. Bernardi, A. Gimigliano, M.…

Algebraic Geometry · Mathematics 2017-02-08 Edoardo Ballico

We prove that semialgebraic sets of rectangular matrices of a fixed rank, of skew-symmetric matrices of a fixed rank and of real symmetric matrices whose eigenvalues have prescribed multiplicities are minimal submanifolds of the space of…

Algebraic Geometry · Mathematics 2020-03-03 Khazhgali Kozhasov

Let $n$ and $s$ be fixed integers such that $n\geq 2$ and $1\leq s\leq \frac{n}{2}$. Let $M_n(\mathbb{K})$ be the ring of all $n\times n$ matrices over a field $\mathbb{K}$. If a map $\delta:M_n(\mathbb{K})\rightarrow M_n(\mathbb{K})$…

Rings and Algebras · Mathematics 2019-03-13 Xiaowei Xu , Baochuan Xie , Yanhua Wang , Zhibing Zhao

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

Algebraic Geometry · Mathematics 2014-11-24 O. G. Styrt

In this work, we characterize matrices of linear forms and constant rank, demonstrating that, under some natural assumptions, they are always associated with a syzygy bundle that fits into a (partially linear) resolution. Furthermore, this…

Algebraic Geometry · Mathematics 2025-09-16 Simone Marchesi , Rosa Maria Miró-Roig

Let K, K' be convex cones residing in finite-dimensional real vector spaces E, E'. An element in the tensor product E \otimes E' is K \otimes K'-separable if it can be represented as finite sum \sum_l x_l \otimes x'_l with x_l \in K and…

Rings and Algebras · Mathematics 2007-05-23 Roland Hildebrand

This paper studies Symmetric Determinantal Representations (SDR) in characteristic 2, that is the representation of a multivariate polynomial P by a symmetric matrix M such that P=det(M), and where each entry of M is either a constant or a…

Computational Complexity · Computer Science 2013-06-06 Bruno Grenet , Thierry Monteil , Stéphan Thomassé
‹ Prev 1 8 9 10 Next ›