Related papers: Decomposable Subspaces, Linear Sections of Grassma…
We reformulate entanglement wedge reconstruction in the language of operator-algebra quantum error correction with infinite-dimensional physical and code Hilbert spaces. Von Neumann algebras are used to characterize observables in a…
A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…
We construct a non-commutative version of the Grassmann variety $G(2,4)$ as a non-commutative moduli space of linear subspaces in a projective space.
We discuss irreducible highest weight representations of the sl(2) loop algebra and reducible indecomposable ones in association with the sl(2) loop algebra symmetry of the six-vertex model at roots of unity. We formulate an elementary…
We investigate the structure of maximal commutative subalgebras of the finite dimensional Grassmann algebra over a field of characteristic different from two.
Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…
The utility of the notion of generalized disclinations in materials science is discussed within the physical context of modeling interfacial and bulk line defects like defected grain and phase boundaries, dislocations and disclinations. The…
We solve the following problem: Can an undirected weighted graph G be parti- tioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible…
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
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…
The goal of this presentation is to build an efficient non-parametric Bayes classifier in the presence of large numbers of predictors. When analyzing such data, parametric models are often too inflexible while non-parametric procedures tend…
We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…
Hessenberg decomposition is the basic tool used in computational linear algebra to approximate the eigenvalues of a matrix. In this article, we generalize Hessenberg decomposition to continuous matrix fields over topological spaces. This…
A numerical algorithm to decompose an exact low-rank skew-symmetric tensor into a sum of elementary (rank-$1$) skew-symmetric tensors is introduced. The algorithm uncovers this Grassmann decomposition based on linear relations that are…
The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…
Let $\mathcal{R}$ be the Grothendieck ring of complex smooth finite-length representations of the sequence of p-adic groups $\{GL_n(F)\}_{n=0}^\infty$, with multiplication defined through parabolic induction. We study the problem of the…
We determine the irreducible representations of alternating and symmetric groups and their universal central extensions that contain a non-scalar element with all but one eigenvalues of multiplicity 1. The ground field is algebraically…
For a general dyadic grid, we give a Calder\'{o}n-Zygmund type decomposition, which is the principle fact about the multilinear maximal function $\mathfrak{M}$ on the upper half-spaces. Using the decomposition, we study the boundedness of…