Related papers: Decomposable Subspaces, Linear Sections of Grassma…
Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
We study random composite structures considered up to symmetry that are sampled according to weights on the inner and outer structures. This model may be viewed as an unlabelled version of Gibbs partitions and encompasses multisets of…
We consider $L^2$-approximation on weighted reproducing kernel Hilbert spaces of functions depending on infinitely many variables. We focus on unrestricted linear information, admitting evaluations of arbitrary continuous linear…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding…
A projective variety $X\subset\mathbb{P}^N$ is $h$-identifiable if the generic element in its $h$-secant variety uniquely determines $h$ points on $X$. In this paper we propose an entirely new approach to study identifiability, connecting…
We study the gauge symmetry factorizability by boundary conditions on intervals of any dimensions. With Dirichlet-Neumann BCs, the Kaluza-Klein decomposition in five-dimension for arbitrary gauge group can always be factorized into that for…
In this article, we consider certain irreducible subvarieties of the moduli space of compact Riemann surfaces determined by the specification of actions of finite groups. We address the general problem of determining which among them are…
Geometrical objects describing the material geometry of continuously defective graphene sheets are introduced and their compatibility conditions are formulated. Effective edge dislocations embedded in the Riemann-Cartan material space and…
Let $P$ be a Poisson algebra, $E$ a vector space and $\pi : E \to P$ an epimorphism of vector spaces with $V = {\rm Ker} (\pi)$. The global extension problem asks for the classification of all Poisson algebra structures that can be defined…
In a symmetric space of noncompact type X = G/K oriented geodesic segments correspond to points in the Euclidean Weyl chamber. We can hence assign vector-valued side-lengths to segments. Our main result is a system of homogeneous linear…
We study grassmannians associated with a linear space with a nondegenerate hermitian form. The geometry of these grassmannians allows us to explain the relation between a (pseudo-)riemannian projective geometry and the conformal structure…
Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. Criteria are given which characterize existence of a fine or coarse moduli space classifying, up to isomorphism, the representations of $\Lambda$ with fixed…
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial…
We derive an explicit expression for an associative star product on non-commutative versions of complex Grassmannian spaces, in particular for the case of complex 2-planes. Our expression is in terms of a finite sum of derivatives. This…
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…
In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…
We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight…