Related papers: Designs and codes in affine geometry
AG codes correspond geometrically to points in the Grassmannian of k-planes in an n-dimensional projective space PG(n, F_q) defined over a finite field F_q of q elements. We prove that invariant subgrassmannians by the action of a triangle…
Affine transformations have been recently used for stereo vision. They can be exploited in various computer vision application, e.g., when estimating surface normals, homographies, fundamental and essential matrices. Even full 3D…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…
The Grassmannian $\mathcal{G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $\mathbb{F}_q^n$. K\"{o}tter and Kschischang showed that codes in Grassmannian space can be used for error-correction in random network…
Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…
In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…
A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks. Such $t$-designs over $\F_q$ are…
In this paper we will first introduce the notion of affine structures on a ringed space and then obtain several properties. Affine structures on a ringed space, arising mainly from complex analytical spaces of algebraic schemes over number…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
We endow the set of complements of a fixed subspace of a projective space with the structure of an affine space, and show that certain lines of such an affine space are affine reguli or cones over affine reguli. Moreover, we apply our…
We give a geometric description of the set of holes in a non-normal affine monoid $Q$. The set of holes turns out to be related to the non-trivial graded components of the local cohomology of $k[Q]$. From this, we see how various properties…
We study the affine quasi-Einstein equation, a second order linear homogeneous equation, which is invariantly defined on any affine manifold. We prove that the space of solutions is finite-dimensional, and its dimension is a strongly…
The coordinate ring $\mathcal{O}_{\mathbf{q}}(\mathbb{K}^n)$ of quantum affine space is the $\mathbb{K}$-algebra presented by generators $x_1,\cdots ,x_n$ and relations $x_ix_j=q_{ij}x_jx_i$ for all $i,j$. We construct simple…
We study the relationship between a q-analogue of matroids and linear codes with the rank metric in the vector space of matrices with entries in a finite field. We prove a Greene type identity for the rank generating function of these…
We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…
The $q$-analogs of basic designs are discussed. It is proved that the existence of any unknown Steiner structures, the $q$-analogs of Steiner systems, implies the existence of unknown Steiner systems. Optimal $q$-analogs covering designs…
In this paper we introduce a $q$-analogue of the single-element extensions of matroids for $q$-matroids, which we call one-dimensional extensions. To enumerate such extensions, we define a $q$-analogue of modular cuts and define a certain…
In this work we explore error-correcting codes derived from the "lifting" of "affine-invariant" codes. Affine-invariant codes are simply linear codes whose coordinates are a vector space over a field and which are invariant under…