English
Related papers

Related papers: Duality, extreme points and hulls for noncommutati…

200 papers

Let $\Gamma$ be a torsion-free arithmetic group acting on its associated global symmetric space $X$. Assume that $X$ is of non-compact type and let $\Gamma$ act on the geodesic boundary $\partial X$ of $X$. Via general constructions in…

K-Theory and Homology · Mathematics 2017-09-19 Bram Mesland , Mehmet Haluk Sengun

This paper is devoted to the relationships and properties of the endograph metric and the $\Gamma$-convergence. The main contents can be divided into three closely related parts. Firstly, on the class of upper semi-continuous fuzzy sets…

General Mathematics · Mathematics 2018-02-01 Huan Huang

Let X be a finite set of complex numbers and let A be a normal operator with spectrum X that acts on a separable Hilbert space H. Relative to a fixed orthonormal basis e_1,e_2, ... for H, A gives rise to a matrix whose diagonal is a…

Operator Algebras · Mathematics 2009-11-11 William Arveson

The paper deals with the optimal control problem described by second order evolution differential inclusions; to this end first we use an auxiliary problem with second order discrete and discrete-approximate inclusions. Then applying…

Optimization and Control · Mathematics 2019-06-18 Elimhan N. Mahmudov

We establish rigidity theorems for graph product von Neumann algebras $M_\Gamma=*_{v,\Gamma}M_v$ associated to finite simple graphs $\Gamma$ and families of tracial von Neumann algebras $(M_v)_{v\in\Gamma}$. We consider the following three…

Operator Algebras · Mathematics 2025-09-09 Camille Horbez , Adrian Ioana

We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…

Optimization and Control · Mathematics 2026-04-16 Thomas Lew , Riccardo Bonalli , Marco Pavone

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…

Optimization and Control · Mathematics 2024-06-17 Martin Plávala , Laurens T. Ligthart , David Gross

Two notions for linear maps (operational convex combinations and operational exetreme points) are introduced. The set S of ucp maps on the n times n matrix algebra is the operational convex combinations of the identity map. An operational…

Operator Algebras · Mathematics 2016-02-12 Marie Choda

Let $K$ be a global function field of characteristic $p$, and let $\Gamma$ be a finite-index subgroup of an arithmetic group defined with respect to $K$ and such that any torsion element of $\Gamma$ is a $p$-torsion element. We define…

Group Theory · Mathematics 2018-03-28 Daniel Studenmund , Kevin Wortman

Gross, Mansour and Tucker introduced the partial-twuality polynomial of a ribbon graph. Chumutov and Vignes-Tourneret posed a problem: it would be interesting to know whether the partial duality polynomial and the related conjectures would…

Combinatorics · Mathematics 2024-03-14 Qi Yan , Xian'an Jin

We present new results on optimization problems where the involved functions are evenly convex. By means of a generalized conjugation scheme and the perturbation theory introduced by Rockafellar, we propose an alternative dual problem for a…

Optimization and Control · Mathematics 2020-08-31 Maria Dolores Fajardo , Sorin-Mihai Grad , Jose Vidal

We study minimum cost constraint satisfaction problems (MinCostCSP) through the algebraic lens. We show that for any constraint language $\Gamma$ which has the dual discriminator operation as a polymorphism, there exists a…

Data Structures and Algorithms · Computer Science 2025-07-14 Ian DeHaan , Neng Huang , Euiwoong Lee

For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose vertices are labelled by elements of $\Gamma$. We prove that a certain collection of edge sets of a $\Gamma$-labelled graph forms a delta-matroid, which we call a…

Combinatorics · Mathematics 2023-10-20 Donggyu Kim , Duksang Lee , Sang-il Oum

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

Symbolic Computation · Computer Science 2012-02-02 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

Representation Theory · Mathematics 2024-02-22 Valdemar V. Tsanov

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

Combinatorics · Mathematics 2026-03-17 Anthony Meunier , Lhouari Nourine , Simon Vilmin

A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…

Optimization and Control · Mathematics 2025-04-22 Ningji Wei

Consider a fixed connected, finite graph $\Gamma$ and equip its vertices with weights $p_i$ which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically…

Complex Variables · Mathematics 2009-09-15 Patrick Popescu-Pampu , Jose Seade

We extend to $p$-uniformly convex spaces tools from the analysis of fixed point iterations in linear spaces. This study is restricted to an appropriate generalization of single-valued, pointwise $\alpha$-averaged mappings. Our main…

Functional Analysis · Mathematics 2021-04-26 Arian Bërdëllima , Florian Lauster , D. Russell Luke

The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…

Metric Geometry · Mathematics 2017-06-08 Josef Cibulka , Miroslav Korbelář , Jan Kynčl , Viola Mészáros , Rudolf Stolař , Pavel Valtr
‹ Prev 1 4 5 6 7 8 10 Next ›