English
Related papers

Related papers: ACI-matrices of constant rank over arbitrary field…

200 papers

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

Let ${\rm Mat}_n(\mathbb{F})$ denote the set of square $n\times n$ matrices over a field $\mathbb{F}$ of characteristic different from two. The permanental rank ${\rm prk}\,(A)$ of a matrix $A \in{\rm Mat}_{n}(\mathbb{F})$ is the size of…

Combinatorics · Mathematics 2023-10-30 Alexander Guterman , Igor Spiridonov

Let $n,p,r$ be positive integers with $n \geq p\geq r$. A rank-$\overline{r}$ subset of $n$ by $p$ matrices (with entries in a field) is a subset in which every matrix has rank less than or equal to $r$. A classical theorem of Flanders…

Rings and Algebras · Mathematics 2016-04-21 Clément de Seguins Pazzis

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

Discrete Mathematics · Computer Science 2025-06-17 Jamolidin K. Abdurakhmanov

Let $R$ be a commutative additively idempotent semiring. In this paper, some properties and characterizations for permanents of matrices over $R$ are established, and several inequalities for permanents are given. Also, the adjiont matrices…

Rings and Algebras · Mathematics 2019-08-19 Yan Huang , Haifeng Lian

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

Functional Analysis · Mathematics 2022-01-14 Adrian Fan , Jack Montemurro , Pavlos Motakis , Naina Praveen , Alyssa Rusonik , Paul Skoufranis , Noam Tobin

The generalization of the geometric mean of positive scalars to positive definite matrices has attracted considerable attention since the seminal work of Ando. The paper generalizes this framework of matrix means by proposing the definition…

Optimization and Control · Mathematics 2013-04-12 Silvere Bonnabel , Anne Collard , Rodolphe Sepulchre

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

Information Theory · Computer Science 2026-01-01 Augustin Cosse

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Combinatorics · Mathematics 2021-04-22 Eugene Kogan

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

Number Theory · Mathematics 2025-10-14 Nihar Gargava , Vlad Serban , Maryna Viazovska , Ilaria Viglino

We prove that if an $n\times n$ matrix defined over ${\mathbb Q}_p$ (or more generally an arbitrary complete, discretely-valued, non-Archimedean field) satisfies a certain congruence property, then it has a strictly maximal eigenvalue in…

Number Theory · Mathematics 2016-04-08 Robert Costa , Patrick Dynes , Clayton Petsche

Let $A$ be a real matrix. The term rank of $A$ is the smallest number $t$ of lines (that is, rows or columns) needed to cover all the nonzero entries of $A$. We prove a conjecture of Li et al. stating that, if the rank of $A$ exceeds $t-3$,…

Combinatorics · Mathematics 2013-12-20 Yaroslav Shitov

In Linear Algebra over finite fields, a characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold…

Information Theory · Computer Science 2019-05-28 Victor Peña , Humberto Sarria

Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume…

Machine Learning · Computer Science 2017-05-02 Natali Ruchansky , Mark Crovella , Evimaria Terzi

The goal of this paper is to study when uniform Roe algebras have certain $C^*$-algebraic properties in terms of the underlying space: in particular, we study properties like having stable rank one or real rank zero that are thought of as…

Operator Algebras · Mathematics 2018-01-31 Kang Li , Rufus Willett

The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegative matrix for it to be completely positive with equal…

Combinatorics · Mathematics 2013-09-11 Wasin So , Changqing Xu

For fields with more than $2$ elements, the classification of the vector spaces of matrices with rank at most $2$ is already known. In this work, we complete that classification for the field $\mathbb{F}_2$. We apply the results to obtain…

Rings and Algebras · Mathematics 2015-09-01 Clément de Seguins Pazzis

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

Group Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Brad Rodgers

Robust Principal Component Analysis (PCA) (Candes et al., 2011) and low-rank matrix completion (Recht et al., 2010) are extensions of PCA to allow for outliers and missing entries respectively. It is well-known that solving these problems…

Numerical Analysis · Mathematics 2019-07-12 Jared Tanner , Andrew Thompson , Simon Vary

A partial matrix over a field $\mathbb{F}$ is a matrix whose entries are either an element of $\mathbb{F}$ or an indeterminate and with each indeterminate only appearing once. A completion is an assignment of values in $\mathbb{F}$ to all…

Combinatorics · Mathematics 2018-05-29 Alberto Borobia , Roberto Canogar
‹ Prev 1 3 4 5 6 7 10 Next ›