Related papers: On the linear structure of cones

This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear…

In past few decades, tensor algebra also known as multi-linear algebra has been developed and customized as a tool to be used for various engineering applications. In particular, with the help of a special form of tensor contracted product,…

In this paper a class of optimization problems with uncertain linear constraints is discussed. It is assumed that the constraint coefficients are random vectors whose probability distributions are only partially known. Possibility theory is…

In this paper we define a Poincar\'e-Reidemeister scalar product on the determinant line of the cohomology of any flat vector bundle over a closed orientable odd-dimensional manifold. It is a combinatorial "torsion-type" invariant which…

This is the first of a pair of papers where we construct and investigate a closed monoidal structure on the category of generalized algebraic theories (in the sense of Cartmell). In the present text, as a starting point, we define the…

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

In this semi-expository paper, we first explain key notions from current quantum information theory and criteria for them in a coherent way. These include separability/entanglement, Schmidt numbers of bi-partite states and block-positivity,…

We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…

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…

Tangent and normal cones play an important role in constrained optimization to describe admissible search directions and, in particular, to formulate optimality conditions. They notably appear in various recent algorithms for both smooth…

In a categorification of tensor products of fundamental representations of quantum sl(k) via highest weight categories, the indecomposable tilting modules descend to the canonical basis. Since projective functors map tilting modules to…

We prove very general formulae for the generating series of (Hodge) genera of symmetric products with coefficients, which hold for complex quasi-projective varieties with any kind of singularities, and which include many of the classical…

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…

The simple product formulae for derivatives of scalar functions raised to different powers are generalized for functions which take values in the set of symmetric positive definite matrices. These formulae are fundamental in derivation of…

We study right exact tensor products on the category of finitely presented functors. As our main technical tool, we use a multilinear version of the universal property of so-called Freyd categories. Furthermore, we compare our constructions…

We extend the preorder on k-tuples of dominant weights of a simple complex Lie algebra g of classical type adding up to a fixed weight $\lambda$ defined by V. Chari, D. Sagaki and the author. We show that the induced extended partial order…

In semantics and in programming practice, algebraic concepts such as monads or, essentially equivalently, (large) Lawvere theories are a well-established tool for modelling generic side-effects. An important issue in this context are…

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

We show that positive elements of a Pedersen ideal of a tensor product can be approximated in a particularly strong sense by sums of tensor products of positive elements. This has a range of applications to the structure of tracial cones…