Related papers: Subspace arrangements defined by products of linea…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
The main aim of this paper is to generalize the concept of vector space by the hyperstructure. We generalize some definitions such as hypersubspaces, linear combination, Hamel basis, linearly dependence and linearly independence. A few…
We study a relation between brick $n$-tuples of subspaces of a finite dimensional linear space, and irreducible $n$-tuples of subspaces of a finite dimensional Hilbert (unitary) space such that a linear combination, with positive…
We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. Then, we use these results in order to write optimality conditions for a special…
In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…
We prove when a Banach ideal of linear operators defined, or characterized, by the transformation of vector-valued sequences is maximal. Known results are recovered as particular cases and new information is obtained. To accomplish this…
Ideals generated by adjacent 2-minors are studied. First, the problem when such an ideal is a prime ideal as well as the problem when such an ideal possesses a quadratic Gr\"obner basis is solved. Second, we describe explicitly a primary…
Linear systems often involve, as a basic building block, solutions of equations of the form \begin{align*} A_Sx_S&+A_Px_P =0\\ A'_Sx_S & =0, \end{align*} where our primary interest might be in the vector variable $x_P.$ Usually, neither…
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…
In computational design and fabrication, neural networks are becoming important surrogates for bulky forward simulations. A long-standing, intertwined question is that of inverse design: how to compute a design that satisfies a desired…
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…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
Given an abelian category with arbitrary products, arbitrary coproducts, and a generator, we show that the closed subspaces (in the sense of A. L. Rosenberg) are parameterized by a suitably defined poset of ideals in the generator. In…
We show that, for an arrangement of subspaces in a complex vector space with geometric intersection lattice, the complement of the arrangement is formal. We prove that the Morgan rational model for such an arrangement complement is formal…
Let $ V $ a vector space of dimension $n$. A $V$ family $ \{H_1, \ldots, H_p \} $ of vectorial hyperplanes being distinct two by two defines an arrangement $ {\cal A}_p = {\cal A} ( H_1, \ldots ,H_p ) $ of $ V $. For $ i \in \{ 1, \ldots, p…
In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…
Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model…
Two successive generalizations of the usual tensor products are given. One can be constructed for arbitrary binary operations, and not only for semigroups, groups or vector spaces. The second one, still more general, is constructed for…
We put forward a simple construction of genuinely entangled subspaces -- subspaces supporting only genuinely multipartite entangled states -- of any permissible dimensionality for any number of parties and local dimensions. The method uses…
We present the basic concepts of tensor products of vector spaces, emphasizing linear algebraic and combinatorial techniques as needed for applied areas of research. The topics include (1) Introduction; (2) Basic multilinear algebra; (3)…