Related papers: Codes and caps from orthogonal Grassmannians
Codes in the projective space and codes in the Grassmannian over a finite field - referred to as subspace codes and constant-dimension codes (CDCs), respectively - have been proposed for error control in random linear network coding. For…
Using the Plucker map between grassmannians, we study basic aspects of classic grassmannian geometries. For `hyperbolic' grassmannian geometries, we prove some facts (for instance, that the Plucker map is a minimal isometric embedding) that…
In this short note, completing a sequence of studies by Cooperstein, Kasikova and Shult, we consider the k-Grassmannians of a number of polar geometries of finite rank n. We classify those subspaces that are isomorphic to the j-Grassmannian…
By using totally isotropic subspaces in an orthogonal space Omega^{+}(2i,2), several infinite families of packings of 2^k-dimensional subspaces of real 2^i-dimensional space are constructed, some of which are shown to be optimal packings. A…
It is known that the complex Grassmannian of $k$-dimensional subspaces can be identified with the set of projection matrices of rank $k$. It is also classically known that the convex hull of this set is the set of Hermitian matrices with…
The Dressian Dr(k,n) parametrizes all tropical linear spaces, and it carries a natural fan structure as a subfan of the secondaryfan of the hypersimplex \Delta(k,n). We explore the combinatorics of the rays of Dr(k,n), that is, the most…
We consider the recently introduced notion of denominators of Pad\'e--like approximation problems on a Riemann surface. These denominators are related as in the classical case to the notion of orthogonality over a contour. We investigate a…
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…
Grassmann angles improve upon similar concepts of angle between subspaces that measure volume contraction in orthogonal projections, working for real or complex subspaces, and being more efficient when dimensions are different. Their…
We discuss direct $CP$ violation in the standard model by giving a new estimate of $\varepsilon'/\varepsilon$ in kaon decays. Our analysis is based on the evaluation of the hadronic matrix elements of the \mbox{$\Delta S =1$} effective…
Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as…
It is well-known that the coset spaces G(k((z)))/G(k[[z]]), for a reductive group G over a field k, carry the geometric structure of an inductive limit of projective k-schemes. This k-ind-scheme is known as the affine Grassmannian for G.…
A type of iterative orthogonally accumulated projection methods for solving linear system of equations are proposed in this paper. This type of methods are applications of accumulated projection(AP) technique proposed recently by authors.…
Given a smooth polarized Riemann surface (X, L) endowed with a hyperbolic metric $\omega$ with cusp singularities along a divisor D, we show the L^2 projective embedding of (X, D) defined by L^k is asymptotically almost balanced in a…
We determine the cup-length of some oriented Grassmann manifolds by finding a Groebner basis associated with a certain subring of the cohomology of them. As its applications, we provide not only a lower but also an upper bound for the…
Entropic optimal transport problems are regularized versions of optimal transport problems. These models play an increasingly important role in machine learning and generative modelling. For finite spaces, these problems are commonly solved…
Let $V$ and $V'$ be vector spaces of dimension $n$ and $n'$, respectively. Let $k\in\{2,...,n-2\}$ and $k'\in\{2,...,n'-2\}$. We describe all isometric and $l$-rigid isometric embeddings of the Grassmann graph $\Gamma_{k}(V)$ in the…
A superconvergence error estimate for the gradient approximation of the second order elliptic problem in three dimensions is analyzed by using weak Galerkin finite element scheme on the uniform and non-uniform cubic partitions. Due to the…
We present a study of two residual a posteriori error indicators for the Plane Wave Discontinuous Galerkin (PWDG) method for the Helmholtz equation. In particular we study the h-version of PWDG in which the number of plane wave directions…
Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the…