Related papers: Codes on Linear Sections of Grassmannians
In this paper, we initiate the study of constant dimension subspace codes restricted to Schubert varieties, which we call Schubert subspace codes. These codes have a very natural geometric description, as objects that we call intersecting…
In this paper, we construct a combinatorial algebra of partial isomorphisms that gives rise to a "projective limit" of the centers of the group algebras C[GL(n,Fq)]. It allows us to prove a GL(n,Fq)-analogue of an old theorem of Farahat and…
Consider a Grassmannian $\mathrm{Gr}(2, V)$ for an even-dimensional vector space $V$. Its derived category of coherent sheaves has a Lefschetz exceptional collection with respect to the Pl\"ucker embedding. We consider a variety $X_1$ of…
We answer some questions related to multiplicity formulas by Rosenthal and Zelevinsky and by Lakshmibai and Weyman for points on Schubert varieties in Grassmannians. In particular, we give combinatorial interpretations in terms of…
Given a finite Lie incidence geometry which is either a polar space of rank at least $3$ or a strong parapolar space of symplectic rank at least $4$ and diameter at most $4$, or the parapolar space arising from the line Grassmannian of a…
In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…
Springer fibers are subvarieties of the flag variety parametrized by partitions; they are central objects of study in geometric representation theory. Schubert varieties are subvarieties of the flag variety that induce a well-known basis…
We build generalizations of the Grassmann algebras from a few simple assumptions which are that they are graded, maximally symmetric and contain an ordinary Grassmann algebra as a subalgebra. These algebras are graded by Z_{n}^{3} and…
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…
We present a bound on the size of linear codes. This bound is independent of other known bounds, e.g. the Griesmer bound.
We introduce combinatorial objects which are parameterized by the positive part of the tropical Grassmannian $Gr(k,n)$. Our method is to relate the Grassmannian to configuration spaces of flags. By work of the first author, and of Goncharov…
Spine spaces can be considered as fragments of a projective Grassmann space. We prove that the structure of lines together with binary coplanarity relation, as well as with binary relation of being in one pencil of lines, is a sufficient…
We investigate special points on the Grassmannian which correspond to friezes with coefficients in the case of rank two. Using representations of arithmetic matroids we obtain a theorem on subpolygons of specializations of the coordinate…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
We define the class of admissible linear embeddings of flag varieties. The definition is given in the general language of algebraic geometry. We then prove that an admissible linear embedding of flag varieties has a certain explicit form in…
The classical $q$-analogue of the integers was recently generalized by Morier-Genoud and Ovsienko to give $q$-analogues of rational numbers. Some combinatorial interpretations are already known, namely as the rank generating functions for…
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case of MDS codes we use our new approach to…
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…
This work is motivated by the relation between the KP and BKP integrable hierarchies, whose $\tau$-functions may be viewed as sections of dual determinantal and Pfaffian line bundles over infinite dimensional Grassmannians. In finite…
We consider the loci of invertible linear maps $f : \mathbb{C}^n \to {(\mathbb{C}^n)}^*$ together with pairs of flags $(E_\bullet, F_\bullet)$ in $\mathbb{C}^n$ such that the various restrictions $f : F_j \to E_i^*$ have specified ranks.…