Related papers: On subspaces defining linear sets of maximum rank

Let $n \geq 2$ be an integer such that an equiangular set of vectors $w_1, \ldots, w_d$ of the maximal possible cardinality (in relation to the the general Gerzon upper bound) exists in $\mathbb{K}^n$, where $\mathbb{K}=\mathbb{R}$ or…

This paper systematically studies finite rank dimension groups, as well as finite dimensional ordered real vector spaces with Riesz interpolation. We provide an explicit description and classification of finite rank dimension groups, in the…

We introduce the weighted greatest common divisor of a tuple of integers and explore some of it basic properties. Furthermore, for a set of heights $\mathfrak w=(q_0, \ldots , q_n)$, we use the concept of the weighted greatest common…

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

A basic problem in the study of algebraic morphisms is to determine which sets can be realised as the image of an endomorphism of affine space. This paper extends the results previously obtained by the first author on the question of…

The elaboration of new quantization methods has recently developed the interest in the study of subalgebras of the Lie algebra of polynomial vector fields over a Euclidean space. In this framework, these subalgebras define maximal…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Two matrix vector spaces $V,W\subset \mathbb C^{n\times n}$ are said to be equivalent if $SVR=W$ for some nonsingular $S$ and $R$. These spaces are congruent if $R=S^T$. We prove that if all matrices in $V$ and $W$ are symmetric, or all…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Problem of Subspace Coding} is to determine the maximum size…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$ and let $W_{2}(\mathbb{F}_{q})$ be the ring of Witt vectors of length two over $\mathbb{F}_{q}$. We prove that for any integer $n$ such that $p$ divides $n$, the groups…

A set $\mathcal{F}_q$ of $3$-dimensional subspaces of $\mathbb{F}_q^7$, the $7$-dimensional vector space over the finite field $\mathbb{F}_q$, is said to form a $q$-analogue of the Fano plane if every $2$-dimensional subspace of…

Let $U$ be a point set in the $n$-dimensional affine space ${\rm AG}(n,q)$ over the finite field of $q$ elements and $0\leq k\leq n-2$. In this paper we extend the definition of directions determined by $U$: a $k$-dimensional subspace $S_k$…

We consider point sets in the $m$-dimensional affine space $\mathbb{F}_q^m$ where each squared Euclidean distance of two points is a square in $\mathbb{F}_q$. It turns out that the situation in $\mathbb{F}_q^m$ is rather similar to the one…

This paper aims to study linear sets of minimum size in the projective line, that is $\mathbb{F}_q$-linear sets of rank $k$ in $\mathrm{PG}(1,q^n)$ admitting one point of weight one and having size $q^{k-1}+1$. Examples of these linear sets…

We generalise the notions of supersymmetry and superspace by allowing generators and coordinates transforming according to more general Lorentz representations than the spinorial and vectorial ones of standard lore. This yields novel…

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…

We overview classifications of simple infinite-dimensional complex $\mathbb{Z}$-graded Lie (super)algebras of polynomial growth, and their deformations. A subset of such Lie (super)algebras consist of vectorial Lie (super)algebras whose…

A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies…

Let $U_n(q)$ denote the upper triangular group of degree $n$ over the finite field $\F_q$ with $q$ elements. It is known that irreducible constituents of supercharacters partition the set of all irreducible characters $\Irr(U_n(q)).$ In…

Let $W$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$ of any characteristic and $mW$ denote the direct sum of $m$ copies of $W$. Let $\mathbb{F}_q[mW]^{{\rm GL}(W)}$ and $\mathbb{F}_q(mW)^{{\rm GL}(W)}$ denote the…