Related papers: Subspace arrangements defined by products of linea…
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Let $K$ be an infinite field and $R=K[x_1,...,x_n]$ be the polynomial ring. Let $V=V_1, ..., V_m$ be a collection of vector spaces of linear forms. Denote by $A(V)$ the $K$-subalgebra of $R$ generated by the elements of the product $V_1...…
The purpose of this note is twofold. We present first a vanishing theorem for families of linear series with base ideal being a fat points ideal. We apply then this result in order to give a partial proof of a conjecture raised by Bocci,…
This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…
(Bi)modules, morphisms and reduction of star-products are studied in a framework of multidifferential operators along maps: morphisms deform Poisson maps and representations on functions spaces deform coisotropic maps. If a star-product is…
We present here a product between vectors and scalars that mixes them within their own space, using imaginaries to describe geometric products between vectors as complex vectors, rather than introducing higher order/dimensional vector…
Given a category of objects, it is both useful and important to know if all the objects in the category may be realised as sub-objects -- via morphisms in the given category -- of a single object in that category enjoying some nice…
Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…
This manuscript describes the notions of blocker and interdiction applied to well-known optimization problems. The main interest of these two concepts is the capability to analyze the existence of a combinatorial structure after some…
We study the vacuum matrix elements of products of parafields using graphical and combinatorial methods.
We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…
A constructive procedure is given to determine all ideals of a solvable Lie algebra. This is used in determining algorithmically all conjugacy classes of subalgebras of a given solvable Lie algebra.
Recent researches on designs for computer experiments with both qualitative and quantitative factors have advocated the use of marginally coupled designs. This paper proposes a general method of constructing such designs for which the…
We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…
In this note we consider two simplicial arrangements of lines and ideals $I$ of intersection points of these lines. There are $127$ intersection points in both cases and the numbers $t_i$ of points lying on exactly $i$ configuration lines…
A lattice diagram is a finite set $L=\{(p_1,q_1),... ,(p_n,q_n)\}$ of lattice cells in the positive quadrant. The corresponding lattice diagram determinant is $\Delta_L(\X;\Y)=\det \| x_i^{p_j}y_i^{q_j} \|$. The space $M_L$ is the space…
We provide a systematic way to design computable bilinear forms which, on the class of subspaces $W^* \subseteq \mathcal{V}'$ that can be obtained by duality from a given finite dimensional subspace $W$ of an Hilbert space $\mathcal{V}$,…