Related papers: Approximation Hierarchies for Copositive Tensor Co…
Tensors are multidimensional analogs of matrices. In this paper, based on degree-theoretic ideas, we study homogeneous nonlinear complementarity problems induced by tensors. By specializing this to $Z$-tensors (which are tensors with…
Perfect tensors are the tensors corresponding to the absolutely maximally entangled states, a special type of quantum states of interest in quantum information theory. We establish a method to compute parameterized families of perfect…
We systematically study how properties of abstract operator systems help classifying linear matrix inequality definitions of sets. Our main focus is on polyhedral cones, the 3-dimensional Lorentz cone, where we can completely describe all…
We characterize Poisson and Jacobi structures by means of complete lifts of the corresponding tensors: the lifts have to be related to canonical structures by morphisms of corresponding vector bundles. Similar results hold for generalized…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
We consider sets of fixed CP, multilinear, and TT rank tensors, and derive conditions for when (the smooth parts of) these sets are smooth homogeneous manifolds. For CP and TT ranks, the conditions are essentially that the rank is…
In a previous work we obtained a set of necessary conditions for the linear approximation in cosmology. Here we discuss the relations of this approach with the so called covariant perturbations. It is often argued in the literature that one…
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…
Our aim is to give a fairly complete account on the construction of compatible model structures on exact categories and symmetric monoidal exact categories, in some cases generalizing previously known results. We describe the close…
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…
Lattice discretizations of continuous manifolds are common tools used in a variety of physical contexts. Conventional discrete approximations, however, cannot capture all aspects of the original manifold, notably its topology. In this paper…
The development of compositional distributional models of semantics reconciling the empirical aspects of distributional semantics with the compositional aspects of formal semantics is a popular topic in the contemporary literature. This…
We study copositive matrices which admit a decomposition into a sum of a positive semidefinite matrix and a matrix with nonnegative entries. Our main result shows that if the off-diagonal entries of a copositive matrix are nondecreasing in…
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…
In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to…
Comon's conjecture on the equality of the rank and the symmetric rank of a symmetric tensor, and Strassen's conjecture on the additivity of the rank of tensors are two of the most challenging and guiding problems in the area of tensor…
We consider generalizations of pairing relations for Kovalevskaya exponents in quasihomogeneous systems with quasihomogeneous tensor invariants. The case of presence of a Poisson structure in the system is investigated in more detail. We…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
We characterize perfectoid towers in terms of conormal cones rather than torsion parts. This result is deduced from a refined study of the relationship between torsion with respect to a principal ideal and the associated conormal cone,…
Two approximation algorithms are proposed for $\ell_1$-regularized sparse rank-1 approximation to higher-order tensors. The algorithms are based on multilinear relaxation and sparsification, which are easily implemented and well scalable.…