Related papers: Subspace Arrangements as Generalized Star Configur…
From the generating matrix of a linear code one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the…
Star configurations are certain unions of linear subspaces of projective space. They have appeared in several different contexts: the study of extremal Hilbert functions for fat point schemes in the plane; the study of secant varieties of…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
Given a collection of $l$ general lines $\ell_1,\ldots,\ell_{l}$ in $\pr^2$, the star configuration $\XX(l)$ is the set of points constructed from all pairwise intersections of these lines. For each non-negative integer $d$, we compute the…
In this paper, we discuss a novel model reduction framework for generalized linear systems. The transfer functions of these systems are assumed to have a special structure, e.g., coming from second-order linear systems and time-delay…
In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how these structured constellations…
Wheeler emphasized the study of Superspace - the space of 3-geometries on a spatial manifold of fixed topology. This is a configuration space for GR; knowledge of configuration spaces is useful as regards dynamics and QM.In this Article I…
Let $F$ be a homogeneous polynomial in $S = \mathbb{C}[x_0,...,x_n]$. Our goal is to understand a particular polynomial decomposition of $F$; geometrically, we wish to determine when the hypersurface defined by $F$ in $\mathbb{P}^n$…
Consider l lines in P^2 such that no three lines meet in a point. Let X(l) denote all points of intersections of these l lines. We describe all pairs (d,l) such that generic degree d curve in P^2 contains a X(l).
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
Given an embedding of a projective variety into projective space, we study the structure of the space of all linear projections that, when composed with the embedding, give a Galois morphism from the variety to a projective space of the…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…
We propose some new method of constructing configurations, which consists in consecutive inscribing copies of one underlying configuration. A uniform characterization of the obtained class and the one introduced in our paper untitled…
In this work we construct an ultracompact star configuration in the framework of Gravitational Decoupling by the Minimal Geometric Deformation approach. We use the complexity factor as a complementary condition to close the system of…
The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…
We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…
This work focuses on the study of the reconfiguration strategies available for uniformly distributed satellite constellations and slotting architectures. Particularly, this manuscript deals with the cases of reducing, maintaining, and also…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…