Related papers: Schubert Subspace Codes

We recall the definition of an r-maximal set in a metric space as a maximal subset of diameter r. In the special case when the metric space is Euclidean such a set is exactly a solid of constant diameter r. In the process of reviewing the…

Let $B$ be a Borel subgroup of $\mathrm{GL}_n(\mathbb{C})$ and $\mathbb{T}$ a maximal torus contained in $B$. Then $\mathbb{T}$ acts on $\mathrm{GL}_{n}(\mathbb{C})/B$ and every Schubert variety is $\mathbb{T}$-invariant. We say that a…

We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…

We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…

An ultrametric defined on a subset S of a metric space X can be extended to X while roughly preserving distances between pairs in S x X.

A new method of metric space investigation, based on classification of its finite subspaces, is suggested. It admits to derive information on metric space properties which is encoded in metric. The method describes geometry in terms of only…

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…

Additive codes may have better parameters than linear codes. However, still very few cases are known and the explicit construction of such codes is a challenging problem. Here we show that a Griesmer type bound for the length of additive…

Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…

We define and study proper permutations. Properness is a geometrically natural necessary criterion for a Schubert variety to be Levi-spherical. We prove the probability that a random permutation is proper goes to zero in the limit.

This paper is concerned with the study of spaces of naturally defined cycles associated to SL(n,R)-flag domains. These are compact complex submanifolds in open orbits of real semisimple Lie groups in flag domains of their complexification.…

We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…

Strong blocking sets and their counterparts, minimal codes, attracted lots of attention in the last years. Combining the concatenating construction of codes with a geometric insight into the minimality condition, we explicitly provide…

In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…

A finite set of unlabelled points in Euclidean space is the simplest representation of many real objects from mineral rocks to sculptures. Since most solid objects are rigid, their natural equivalence is rigid motion or isometry maintaining…

A regular nilpotent Hessenberg Schubert cell is the intersection of a regular nilpotent Hessenberg variety with a Schubert cell. In this paper, we describe a set of minimal generators of the defining ideal of a regular nilpotent Hessenberg…

Let $G/P$ be a complex cominuscule flag manifold. We prove a type independent formula for the torus equivariant Mather class of a Schubert variety in $G/P$, and for a Schubert variety pulled back via the natural projection $G/Q \to G/P$. We…

Points in the intersection of Schubert varieties are counted by various combinatorial objects, for example standard tableaux. This paper consider the problem of producing a natural labelling of intersection points by these combinatorial…

In a previuos paper the author asked if there exists a one-dimensional space $X$ that is not almost zero-dimensional, such that the dimension of the hyperspace of compact subsets of $X$ is one-dimensional. In this short note we give…

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…