English
Related papers

Related papers: On subspaces defining linear sets of maximum rank

200 papers

To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…

Algebraic Geometry · Mathematics 2024-06-14 Andreas Blatter

Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more…

Computational Complexity · Computer Science 2017-04-21 Venkatesan Guruswami , Chaoping Xing , Chen Yuan

Let $K$ be a field and let $V$ be a vector space of dimension $n$ over $K$. Let $M$ be a subspace of bilinear forms defined on $V\times V$. Let $r$ be the number of different non-zero ranks that occur among the elements of $M$. Our aim is…

Rings and Algebras · Mathematics 2018-01-24 Rod Gow

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

We determine the number of ${\mathbb{F}}_q$-rational points of hyperplane sections of classical determinantal varieties defined by the vanishing of minors of a fixed size of a generic matrix, and identify sections giving the maximum number…

Combinatorics · Mathematics 2018-09-14 Peter Beelen , Sudhir R. Ghorpade

We show that there exists $k \in \bbn$ and $0 < \e \in\bbr$ such that for every field $F$ of characteristic zero and for every $n \in \bbn$, there exists explicitly given linear transformations $T_1,..., T_k: F^n \to F^n$ satisfying the…

Group Theory · Mathematics 2008-04-15 A. Lubotzky , E. Zelmanov

Let $W$ denote a linear space over a fixed field ${\mathbb F}$. We define the notions of weak $ISP$-system and weak $(u,v)$-system $\cal S=\{(U_i,V_i):~ 1\leq i\leq m\}$ of subspaces of $W$. We give upper bounds for the size of weak…

Combinatorics · Mathematics 2016-10-11 Gábor Hegedüs

In [2] and [19] are presented the first two families of maximum scattered $\mathbb{F}_q$-linear sets of the projective line $\mathrm{PG}(1,q^n)$. More recently in [23] and in [5], new examples of maximum scattered $\mathbb{F}_q$-subspaces…

Combinatorics · Mathematics 2017-09-05 Bence Csajbók , Giuseppe Marino , Ferdinando Zullo

Let G be a connected unipotent group over a finite field F_q with q elements. In this article we propose a definition of L-packets of complex irreducible representations of the finite group G(F_q) and give an explicit description of…

Representation Theory · Mathematics 2010-11-24 Mitya Boyarchenko

Let $n\ge2$ and $d_1,\ldots,d_n\ge2$ be integers, and $\mathcal{F}$ be a field. A vector $u\in\mathcal{F}^{d_1}\otimes\cdots\otimes\mathcal{F}^{d_n}$ is called a product vector if $u=u^{[1]}\otimes\cdots\otimes u^{[n]}$ for some…

Combinatorics · Mathematics 2021-03-11 Yuuya Yoshida

Let $F$ be a field, and $\mathcal{M}$ be a linear subspace of $n$-by-$n$ matrices with entries in $F$ that have at most two eigenvalues in $F$ (respectively, at most one non-zero eigenvalue in $F$). In a previous article, we have determined…

Rings and Algebras · Mathematics 2026-05-08 Clément de Seguins Pazzis

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…

Combinatorics · Mathematics 2025-12-01 Paige Bright , Ben Lund , Thang Pham

The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…

Information Theory · Computer Science 2011-09-09 Natalia Silberstein

The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…

Rings and Algebras · Mathematics 2023-08-07 Matjaž Omladič , Heydar Radjavi , Klemen Šivic

A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…

Combinatorics · Mathematics 2014-06-02 Florian Caullery , Kai-Uwe Schmidt

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 denote by $\mathcal{P}_q$ the vector space of functions from a finite field $\mathbb{F}_q$ to itself, which can be represented as the space $\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x)$ of polynomial functions. We denote by $\mathcal{O}_n…

Information Theory · Computer Science 2018-09-25 Jeffery Sun , Steven Damelin , Daniel Kaiser

We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…

Combinatorics · Mathematics 2026-05-01 Jozefien D'haeseleer , Sascha Kurz

We consider principal subspace W({\Lambda}) of integrable highest weight module L({\Lambda}) for quantum affine algebra $U_q(\hat{\mathfrak{sl}}_{n+1})$. We introduce quantum analogues of the quasi-particles associated with the principal…

Quantum Algebra · Mathematics 2014-05-27 Slaven Kozic

An emerging theory of "linear-algebraic pseudorandomness" aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In this work, we study…

Computational Complexity · Computer Science 2014-12-01 Michael A. Forbes , Venkatesan Guruswami