Related papers: Linearity and Complements in Projective Space
A {\it vector space partition} is here a collection $\mathcal P$ of subspaces of a finite vector space $V(n,q)$, of dimension $n$ over a finite field with $q$ elements, with the property that every non zero vector is contained in a unique…
In this note the following version of Phillips' lemma is proved. The L-projection of an L-embedded space - that is of a Banach space which is complemented in its bidual such that the norm between the two complementary subspaces is additive…
We derive upper bounds on the difference between the orthogonal projections of a smooth function $u$ onto two finite element spaces that are nearby, in the sense that the support of every shape function belonging to one but not both of the…
As supported by abundant experimental evidence, neural networks are state-of-the-art for many approximation tasks in high-dimensional spaces. Still, there is a lack of a rigorous theoretical understanding of what they can approximate, at…
Distance Geometry Problem (DGP) and Nonlinear Mapping (NLM) are two well established questions: Distance Geometry Problem is about finding a Euclidean realization of an incomplete set of distances in a Euclidean space, whereas Nonlinear…
A collection of sets satisfies a $(\delta,\varepsilon)$-proximity gap with respect to some property if for every set in the collection, either (i) all members of the set are $\delta$-close to the property in (relative) Hamming distance, or…
In geometry processing, symmetry is a universal type of high-level structural information of 3D models and benefits many geometry processing tasks including shape segmentation, alignment, matching, and completion. Thus it is an important…
An $m$-$cover$ of lines of a finite projective space ${\rm PG}(r,q)$ (of a finite polar space $\cal P$) is a set of lines $\cal L$ of ${\rm PG}(r,q)$ (of $\cal P$) such that every point of ${\rm PG}(r,q)$ (of $\cal P$) contains $m$ lines of…
Grassmannian codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that vector network codes outperform scalar linear network codes, on multicast networks, with respect to the alphabet…
A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as…
We prove that for all integers $2\leq m\leq d-1$, there exists doubling measures on $\mathbb{R}^d$ with full support that are $m$-rectifiable and purely $(m-1)$-unrectifiable in the sense of Federer (i.e. without assuming…
The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…
A finite metric space is called here distance degree regular if its distance degree sequence is the same for every vertex. A notion of designs in such spaces is introduced that generalizes that of designs in $Q$-polynomial distance-regular…
For every idempotent $Q$ on a Hilbert space $H$, the matched projection $m(Q)$ is a well-established concept. This paper explores several applications of the matched projections. The first application addresses the distances from…
This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…
We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a-priori…
Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…
In this paper, we present a constructive generalization of metric and uniform spaces by introducing a new class of spaces, called cover spaces. These spaces form a topological concrete category with a full reflective subcategory of complete…