Related papers: A survey of the different types of vector space pa…

In this note, we give a new necessary condition for the existence of non-trivial partitions of a finite vector space. Precisely, we prove that, if V is a finite vector space over a field of order q, then the number of the subspaces of…

A vector space partition $\mathcal{P}$ in $\mathbb{F}_q^v$ is a set of subspaces such that every $1$-dimensional subspace of $\mathbb{F}_q^v$ is contained in exactly one element of $\mathcal{P}$. Replacing "every point" by "every…

A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…

A vector space partition $\mathcal{P}$ of the projective space $\operatorname{PG}(v-1,q)$ is a set of subspaces in $\operatorname{PG}(v-1,q)$ which partitions the set of points. We say that a vector space partition $\mathcal{P}$ has type…

Some new necessary conditions for the existence of vector space partitions are derived. They are applied to the problem of finding the maximum number of spaces of dimension t in a vector space partition of V(2t,q) that contains m_d spaces…

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

Constant-dimension codes with the maximum possible minimum distance have been studied under the name of partial spreads in Finite Geometry for several decades. Not surprisingly, for this subclass typically the sharpest bounds on the maximal…

Let $V=V(n,q)$ denote the vector space of dimension $n$ over the finite field with $q$ elements. A subspace partition ${\mathcal P}$ of $V$ is a collection of nontrivial subspaces of $V$ such that each nonzero vector of $V$ is in exactly…

We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…

The subspace structure of Beidleman near-vector spaces is investigated. We characterise finite dimensional Beidleman near-vector spaces and we classify the R-subgroups of finite dimensional Beidleman near-vector spaces. We provide an…

The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…

We construct the space of vector fields on quantum groups . Its elements are products of the known left invariant vector fields with the elements of the quantum group itself. We also study the duality between vector fields and 1-forms. The…

We study the structure of two-sided vector spaces over a perfect field $K$. In particular, we give a complete characterization of isomorphism classes of simple two-sided vector spaces which are left finite-dimensional. Using this…

A subspace partition $\Pi$ of $V=V(n,q)$ is a collection of subspaces of $V$ such that each 1-dimensional subspace of $V$ is in exactly one subspace of $\Pi$. The size of $\Pi$ is the number of its subspaces. Let $\sigma_q(n,t)$ denote the…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

A vector space is commonly defined as a set that satisfies several conditions related to addition and scalar multiplication. However, for beginners, it may be hard to immediately grasp the essence of these conditions. There are probably a…

A vector partition function is the number of ways to write a vector as a non-negative integer-coefficient sum of the elements of a finite set of vectors $\Delta$. We present a new algorithm for computing closed-form formulas for vector…