Related papers: Constructing minimal blocking sets using field red…
One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in $\operatorname{PG}(n,q)$, i.e., the set of subspaces of $\mathbb{F}_q^n$,…
Over the past few years, the codes $\mathcal{C}_{n-1}(n,q)$ arising from the incidence of points and hyperplanes in the projective space $\text{PG}(n,q)$ attracted a lot of attention. In particular, small weight codewords of…
The design space for a self-assembled multicomponent objects ranges from a solution in which every building block is unique to one with the minimum number of distinct building blocks that unambiguously define the target structure. Using a…
This paper studies {\em strong blocking sets} in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the…
Consider the projections of a finite set $A\subset R^n$ onto the coordinate hyperplanes. How small can the sum of the sizes of these projections be, given the size of $A$? In a different form, this problem has been studied earlier in the…
In this paper we show that every area minimizing cone C^{n-1} in R^n can be approximated by entirely smooth area minimizing hypersurfaces. This extensively uses hyperbolic unfoldings of such hypersurfaces and the resulting potential theory…
Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize…
The moduli space of planar polygons with generic side lengths is a smooth, closed manifold. It is known that these manifolds contain the real points of the moduli space of distinct points on the projective line as an open dense subset.…
In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…
A $q$-covering design $\mathbb{C}_q(n, k, r)$, $k \ge r$, is a collection $\mathcal X$ of $(k-1)$-spaces of $\mathrm{PG}(n-1, q)$ such that every $(r-1)$-space of $\mathrm{PG}(n-1, q)$ is contained in at least one element of $\mathcal X$ .…
We use polynomial techniques to derive structural results on R\'edei type blocking sets from information on their bisecants. We apply our results to point sets of $PG(2,q)$ with few odd-secants. In particular, we improve the lower bound of…
We suggest a construction of the minimal polynomial $m_{\beta^k}$ of $\beta^k\in \mathbb F_{q^n}$ over $\mathbb F_q$ from the minimal polynomial $f= m_\beta$ for all positive integers $k$ whose prime factors divide $q-1$. The computations…
We give constructions of some special cases of $[n,k]$ Reed-Solomon codes over finite fields of size at least $n$ and $n+1$ whose generator matrices have constrained support. Furthermore, we consider a generalisation of the GM-MDS…
First we construct minimal hypersurfaces $M\subset\mathbf{R}^{n+1}$ in a neighborhood of the origin, with an isolated singularity but cylindrical tangent cone $C\times \mathbf{R}$, for any strictly minimizing strictly stable cone $C$ in…
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…
We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…
We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…
This paper presents an explicit construction of a class of optimal-access, minimum storage regenerating (MSR) codes, for small values of the number $d$ of helper nodes. The construction is valid for any parameter set $(n,k,d)$ with $d \in…
Within the framework of finite element systems, we show how spaces of differential forms may be constructed, in such a way that they are equipped with commuting interpolators and contain prescribed functions, and are minimal under these…
We introduce generator blocking sets of finite classical polar spaces. These sets are a generalisation of maximal partial spreads. We prove a characterization of these minimal sets of the polar spaces Q(2n,q), Q-(2n+1,q) and H(2n,q^2), in…