English
Related papers

Related papers: Boundary representations and pure completely posit…

200 papers

The numerical range in the quaternionic setting is, in general, a non convex subset of the quaternions. The essential numerical range is a refinement of the numerical range that only keeps the elements that have, in a certain sense,…

Functional Analysis · Mathematics 2022-10-12 Luís Carvalho , Cristina Diogo , Sérgio Mendes , Helena Soares

Maximization and minimization problems of the principle eigenvalue for divergence form second order elliptic operators with the Dirichlet boundary condition are considered. The principal eigen map of such elliptic operators is introduced…

Optimization and Control · Mathematics 2019-08-28 Hongwei Lou , Jiongmin Yong

A. Ya. Zaslavskii's results on the existence of a linear (affine) selection for a linear (affine) or superlinear (convex) map $\Phi : K \to 2^Y$ defined on a convex cone (convex set) $K$ having the interpolation property are extended. We…

Functional Analysis · Mathematics 2012-06-18 Dmitry V. Rutsky

It was once conjectured that if $A$ is a uniform algebra on its maximal ideal space $X$, and if each point of $X$ is a peak point for $A$, then $A = C(X)$. This peak-point conjecture was disproved by Brian Cole in 1968. Here we establish a…

Complex Variables · Mathematics 2017-07-05 John T. Anderson , Alexander J. Izzo

The goal of this note is to give a systematic method of constructing zero-free regions for the permanent in the sense of A. Barvinok, i.e. regions in the complex plane such that the permanent of a square matrix of any size with entries from…

Complex Variables · Mathematics 2020-03-13 Pavel Etingof

There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner…

Optimization and Control · Mathematics 2019-05-28 Firdevs Ulus

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

Satisfiability solving has been used to tackle a range of long-standing open math problems in recent years. We add another success by solving a geometry problem that originated a century ago. In the 1930s, Esther Klein's exploration of…

Computational Geometry · Computer Science 2024-03-04 Marijn J. H. Heule , Manfred Scheucher

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

Algebraic Geometry · Mathematics 2017-09-19 Claus Scheiderer

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

Combinatorics · Mathematics 2021-11-29 János Nagy , Péter Pál Pach , István Tomon

Given an oriented surface S with base point * on the boundary, we introduce for all N>0, a canonical quasi-Poisson bracket on the space of N-dimensional linear representations of \pi_1(S,*). Our bracket extends the well-known Poisson…

Geometric Topology · Mathematics 2014-01-03 Gwenael Massuyeau , Vladimir Turaev

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…

Computational Geometry · Computer Science 2024-12-18 Hernán González-Aguilar , David Orden , Pablo Pérez-Lantero , David Rappaport , Carlos Seara , Javier Tejel , Jorge Urrutia

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…

Operator Algebras · Mathematics 2022-11-17 Mark Girard , Seung-Hyeok Kye , Erling Størmer

We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with…

Information Theory · Computer Science 2011-05-17 Sahand Negahban , Martin J. Wainwright

In this work we obtain sufficient conditions for the existence of bounded solutions of a resonant multi-point second-order boundary value problem, with a fully differential equation. The noninvertibility of the linear part is overcome by a…

Classical Analysis and ODEs · Mathematics 2018-11-16 Lucía López-Somoza , Feliz Minhós

The Mermin-Peres magic square is a celebrated example of a system of Boolean linear equations that is not (classically) satisfiable but is satisfiable via linear operators on a Hilbert space of dimension four. A natural question is then,…

Computational Complexity · Computer Science 2025-09-12 Andrei A. Bulatov , Stanislav Živný

We show how the numerical range of a matrix can be used to bound the optimal value of certain optimization problems over real tensor product vectors. Our bound is stronger than the trivial bounds based on eigenvalues, and can be computed…

Optimization and Control · Mathematics 2023-05-24 Nathaniel Johnston , Logan Pipes

Generalizing Pisier's idea, we introduce a Hilbertian matrix cross normed space associated with a pair of symmetric normed ideals. When the two ideals coincide, we show that our construction gives an operator space if and only if the ideal…

Operator Algebras · Mathematics 2007-05-23 Takahiro Ohta

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

Optimization and Control · Mathematics 2014-02-11 C. H. Jeffrey Pang

A unital $C^*$-algebra is called $N$-subhomogeneous if its irreducible representations are finite dimensional with dimension at most $N$. We extend this notion to operator systems, replacing irreducible representations by boundary…

Operator Algebras · Mathematics 2023-02-10 Ran Kiri