Related papers: Subspace Arrangements as Generalized Star Configur…
Based on a closed formula for a star product of Wick type on $\CP^n$, which has been discovered in an earlier article of the authors, we explicitly construct a subalgebra of the formal star-algebra (with coefficients contained in the…
We study enumerative questions on the moduli space $\mathcal{M}(L)$ of hyperplane arrangements with a given intersection lattice $L$. Mn\"ev's universality theorem suggests that these moduli spaces can be arbitrarily complicated; indeed it…
We systematically extend the statement that the configurational entropy provides an alternative approach to studying gravitational stability of compact objects, carried out in the previous work of M. Gleiser and N. Jiang, Phys. Rev. D {\bf…
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
This paper considers binary classification of high-dimensional features under a postulated model with a low-dimensional latent Gaussian mixture structure and non-vanishing noise. A generalized least squares estimator is used to estimate the…
We investigate several topological and combinatorial properties of line arrangements. We associate to a line arrangement a link obtained by intersecting the arrangement with some sphere. Several topics are discussed: (a) some link…
We obtain certain algebraic invariants relevant to study codes on subgroups of weighted projective tori inside an $n$-dimensional weighted projective space. As application, we compute all the main parameters of generalized toric codes on…
This exploratory paper considers the notion of a covering of a configuration and $G$-coverings which are coverings that are quotients under a semi-regular group action. We consider prime configurations, those which cannot $G$-cover other…
A subspace code is a nonempty set of subspaces of a vector space $\mathbb F^n_q$. Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with their duals is trivial. In this paper, we introduce a notion of…
We introduce the notion of a subregular subalgebra, which we believe is useful for classification of subalgebras of Lie algebras. We use it to construct a non-regular invariant generalized complex structure on a Lie group. As an…
One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…
Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…
We present a class of general prolate and oblate spheroidal spacetimes for the description of cosmic structures in the Universe. They are exact geometries which represent, in an appropriated way, the imbedding of spheroidal matter-energy…
A C++ software design is presented that can be used to interpolate data in any number of dimensions. The design is based on a combination of templates of functional collections of elements and so-called type lists. The design allows for…
We introduce the notion of a Tits arrangement on a convex open cone as a special case of (infinite) simplicial arrangements. Such an object carries a simplicial structure similar to the geometric representation of Coxeter groups. The…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
A barred preferential arrangement is a preferential arrangement, onto which in-between the blocks of the preferential arrangement a number of identical bars are inserted. We offer a generalisation of barred preferential arrangements by…
In this paper we extend the concept of generalized Wei weights for poset-weight codes and show that all linear codes C satisfy the chain condition if support of C is a subposet totally ordered.
We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…
In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes. Our…