Related papers: Subspace Arrangements as Generalized Star Configur…
Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more…
An interpolation-based decoding scheme for interleaved subspace codes is presented. The scheme can be used as a (not necessarily polynomial-time) list decoder as well as a probabilistic unique decoder. Both interpretations allow to decode…
For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…
The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an…
We introduce polystar bodies: compact starshaped sets whose gauge or radial functions are expressible by polynomials, enabling tractable computations, such as that of intersection bodies. We prove that polystar bodies are uniformly dense in…
Let $M$ be a subset of vector space or projective space. The authors define the \emph{generalized configuration space} of $M$ which is formed by $n$-tuples of elements of $M$ where any $k$ elements of each $n$-tuple are linearly…
It has long been considered that conformal superspace is the natural configuration space for canonical general relativity. However, this was never definitively demonstrated. We have found that the standard conformal method of solving the…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…
Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309}…
In the present investigation an exact generalized model for anisotropic compact stars of embedding class one is sought for under general relativistic background. The generic solutions are verified by exploring different physical aspects,…
Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider…
We propose a generalization of the classical point-line Cremona-Richmond configuration to a configuration of points and more dimensional subspaces of a projective space, and present them as geometric realizations of some interesting…
We present a survey of some aspects and new results on configurations, i.e. disjoint unions of constellations of infinitely near points, local and global theory, with some applications and results on generalized Enriques diagrams, singular…
Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective…
We introduce constellation ensembles, in which charged particles on a line (or circle) are linked with charged particles on parallel lines (or concentric circles). We present formulas for the partition functions of these ensembles in terms…
We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…
We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a combinatorial construction (blocker duality) which yields…
Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the…