English
Related papers

Related papers: Resilience of ranks of higher inclusion matrices

200 papers

Let K be an arbitrary (commutative) field with at least three elements, and let n, p and r be positive integers with r<=min(n,p). In a recent work, we have proved that an affine subspace of M_{n,p}(K) containing only matrices of rank…

Rings and Algebras · Mathematics 2012-05-10 Clément de Seguins Pazzis

Let $r > 0$ be an integer, let $\mathbb{F}_q$ be a finite field of $q$ elements, and let $\mathcal{A}$ be a nonempty proper subset of $\mathbb{F}_q$. Moreover, let $\mathbf{M}$ be a random $m \times n$ rank-$r$ matrix over $\mathbb{F}_q$…

Combinatorics · Mathematics 2023-07-27 Carlo Sanna

For every $m,n \in \mathbb{N}$ and every field $K$, let $M(m \times n, K)$ be the vector space of the $(m \times n)$-matrices over $K$ and let $S(n,K)$ be the vector space of the symmetric $(n \times n)$-matrices over $K$. We say that an…

Rings and Algebras · Mathematics 2024-12-03 Elena Rubei

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

Combinatorics · Mathematics 2023-05-09 Joshua E. Ducey , Colby J. Sherwood

For every $n \in \mathbb{N}$ and every field $K$, let $A(n,K)$ be the vector space of the antisymmetric $(n \times n)$-matrices over $K$. We say that an affine subspace $S$ of $A(n,K)$ has constant rank $r$ if every matrix of $S$ has rank…

Rings and Algebras · Mathematics 2024-12-03 Elena Rubei

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

Let $\mathbf{A}_{n,m;k}$ be a random $n \times m$ matrix with entries from some field $\mathbb{F}$ where there are exactly $k$ non-zero entries in each column, whose locations are chosen independently and uniformly at random from the set of…

Combinatorics · Mathematics 2020-02-20 Colin Cooper , Alan Frieze , Wesley Pegden

The problem of finding the maximal dimension of linear or affine subspaces of matrices whose rank is constant, or bounded below, or bounded above, has attracted many mathematicians from the sixties to the present day. The problem has caught…

Rings and Algebras · Mathematics 2024-12-02 Elena Rubei

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

Algebraic Geometry · Mathematics 2020-07-20 David Kazhdan , Tamar Ziegler

A sparsity pattern in $\mathbb{R}^{n \times m}$, for $m\geq n$, is a vector subspace of matrices admitting a basis consisting of canonical basis vectors in $\mathbb{R}^{n \times m}$. We represent a sparsity pattern by a matrix with…

Optimization and Control · Mathematics 2021-09-20 Mohamed Ali Belabbas , Xudong Chen , Daniel Zelazo

Let $K$ be an algebraically closed field of characteristic zero and ${P_n=K[x_1,\ldots,x_n]}$ the polynomial ring. Any $K$-derivation $D$ on $P_n$ is of the form ${ D=\sum_{i=1}^n f_i(x_1,\ldots,x_n)\frac{\partial}{\partial x_i} },$ where…

Rings and Algebras · Mathematics 2026-02-24 Y. Chapovskyi , A. Petravchuk

K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive…

Rings and Algebras · Mathematics 2015-01-13 Rod Gow

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

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. We determine the maximal dimension for an affine subspace of $n$ by $n$ symmetric (or alternating) matrices with entries in $\mathbb{K}$ and with…

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

Let $\mathbb{F}$ be a field, and $n \geq r>0$ be integers, with $r$ even. Denote by $\mathrm{A}_n(\mathbb{F})$ the space of all $n$-by-$n$ alternating matrices with entries in $\mathbb{F}$. We consider the problem of determining the…

Rings and Algebras · Mathematics 2023-07-21 Clément de Seguins Pazzis

Let $\mathbb{F}$ be a field, and $n \geq p \geq r>0$ be integers. In a recent article, Rubei has determined, when $\mathbb{F}$ is the field of real numbers, the greatest possible dimension for an affine subspace of $n$--by--$p$ matrices…

Rings and Algebras · Mathematics 2024-05-07 Clément de Seguins Pazzis

In structured system theory, a pattern matrix is a matrix with entries either fixed to zero or free to take arbitrary numbers. The (generic) rank of a pattern matrix is the rank of almost all its realizations. The resilience of various…

Information Theory · Computer Science 2024-11-19 Yuan Zhang , Yuanqing Xia , Gang Wang

Let $S=K[x_1,...,x_n]$ or $S=K[[x_1,...,x_n]]$ be either a polynomial or a formal power series ring in a finite number of variables over a field $K$ of characteristic $p > 0$ with $[K:K^p] < \infty$. Let $R$ be the hypersurface $S/fS$ where…

Commutative Algebra · Mathematics 2018-04-23 Khaled Alhazmy

Let $M$ be an $n \times m$ matrix of independent Rademacher ($\pm 1$) random variables. It is well known that if $n \leq m$, then $M$ is of full rank with high probability. We show that this property is resilient to adversarial changes to…

Combinatorics · Mathematics 2021-07-01 Asaf Ferber , Kyle Luh , Gweneth McKinley

Given a $k\times l$ $(0,1)$-matrix $F$, we denote by $\mathrm{fs}(m,F)$ the largest number for which there is an $m \times \mathrm{fs}(m,F)$ $(0,1)$-matrix with no repeated columns and no induced submatrix equal to $F$. A conjecture of…

Combinatorics · Mathematics 2014-01-10 Arès Méroueh
‹ Prev 1 2 3 10 Next ›