Related papers: Lexicographic cones and the ordered projective ten…

This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…

The aim of this note is to point out a convexity property with respect to the root lattice for the support of the highest weights that occur in a tensor product of irreducible rational representations of $SL(n)$ over the complex numbers.…

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

Techniques in which words are represented as vectors have proved useful in many applications in computational linguistics, however there is currently no general semantic formalism for representing meaning in terms of vectors. We present a…

For a finite dimensional vector space G we define the k-th generic syzygy scheme Gensyz_k(G) by explicit equations. We show that the syzygy scheme Syz(f) of any syzygy in the linear strand of a projective variety X which is cut out by…

A "tensor space" is a vector space equipped with a finite collection of multi-linear forms. In previous work, we showed that (for each signature) there exists a universal homogeneous tensor space, which is unique up to isomorphism. Here we…

Vector space word representations are learned from distributional information of words in large corpora. Although such statistics are semantically informative, they disregard the valuable information that is contained in semantic lexicons…

For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…

We construct in ZFC an L topological vector space -- a topological vector space that is an L space -- and an L field -- a topological field that is an L space. This generalizes results in [5] and [8].

Convex neural codes are subsets of the Boolean lattice that record the intersection patterns of convex sets in Euclidean space. Much work in recent years has focused on finding combinatorial criteria on codes that can be used to classify…

In this note, we work out a simple inductive proof showing that every polyhedral cone K is the conic hull of a finite set X of vectors. The base cases of the induction are linear subspaces and linear halfspaces of linear subspaces. The…

As already done for the matrix case for example in [Joe Harris, Algebraic Geometry - A first course, p.256] we give a parametrization of the Bouligand tangent cone of the variety of tensors of bounded TT rank. We discuss how the proof…

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

The Cox ring provides a coordinate system on a toric variety analogous to the homogeneous coordinate ring of projective space. Rational maps between projective spaces are described using polynomials in the coordinate ring, and we generalise…

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

We study relations of some classes of $k$-convex, $k$-visible bodies in Euclidean spaces. We introduce and study \textrm{circular projections} in normed linear spaces and classes of bodies related with families of such maps, in particular,…

Selecting a representative vector for a set of vectors is a very common requirement in many algorithmic tasks. Traditionally, the mean or median vector is selected. Ontology classes are sets of homogeneous instance objects that can be…

Conference matrices are used to define complex structures on real vector spaces. Certain lattices in these spaces become modules for rings of quadratic integers. Multiplication of these lattices by non-principal ideals yields simple…

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

We define the finest order on inductive limits of ordered cones which makes the linear mappings monotone and gives rise to the definition of inductive limit topologies for cones. Using the polars of neighborhoods, we establish embeddings…