English
Related papers

Related papers: Random sets and Choquet-type representations

200 papers

In this paper, we investigate the $L^2$-Dolbeault cohomology of the symmetric power of cotangent bundles of ball quotients with finite volume, as well as their toroidal compactification. Through the application of Hodge theory for complete…

Complex Variables · Mathematics 2026-01-14 Seungjae Lee , Aeryeong Seo

Let S be an operator system -- a self-adjoint linear subspace of a unital C*-algebra A such that contains 1 and A=C*(S) is generated by S. A boundary representation for S is an irreducible representation \pi of C*(S) on a Hilbert space with…

Operator Algebras · Mathematics 2015-06-26 William Arveson

The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…

Metric Geometry · Mathematics 2024-09-04 Zakhar Kabluchko , Alexander Marynych , Ilya Molchanov

The $K$-hull of a compact set $A\subset\mathbb{R}^d$, where $K\subset \mathbb{R}^d$ is a fixed compact convex body, is the intersection of all translates of $K$ that contain $A$. A set is called $K$-strongly convex if it coincides with its…

Metric Geometry · Mathematics 2021-10-06 Alexander Marynych , Ilya Molchanov

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…

General Mathematics · Mathematics 2008-05-05 Jean Gallier

We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each…

Computational Geometry · Computer Science 2020-12-07 Xiao Mao

Recently, motivated by the rapid increase of the data size in various applications, Monemizadeh [APPROX'23] and Driemel, Monemizadeh, Oh, Staals, and Woodruff [SoCG'25] studied geometric problems in the setting where the only access to the…

Computational Geometry · Computer Science 2026-03-24 T. Schibler , J. Xue , J. Zhu

We study several classes of indecomposable representations of quivers on infinite-dimensional Hilbert spaces and their relation. Many examples are constructed using strongly irreducible operators. Some problems in operator theory are…

Operator Algebras · Mathematics 2013-03-12 Masatoshi Enomoto , Yasuo Watatani

It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…

Metric Geometry · Mathematics 2007-05-23 Michael Joswig

Examples by Poletsky and the author and by Zwonek show the existence nowhere extendable holomorphic functions with the property that the pluripolar hull of their graphs is much larger than the graph of the respective functions and contains…

Complex Variables · Mathematics 2022-10-05 Jan Wiegerinck

We prove that the closure of the numerical range of a $(n+1)$-periodic and $(2m+1)$-banded Toeplitz operator can be expressed as the closure of the convex hull of the uncountable union of numerical ranges of certain symbol matrices. In…

Functional Analysis · Mathematics 2026-01-14 Benjamín A. Itzá-Ortiz , Rubén A. Martínez-Avendaño , Hiroshi Nakazato

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

Combinatorics · Mathematics 2010-12-13 Roland Bacher , Frédéric Mouton

We extend to infinite dimensional separable Hilbert spaces the Schur convexity property of eigenvalues of a symmetric matrix with real entries. Our framework includes both the case of linear, selfadjoint, compact operators, and that of…

Analysis of PDEs · Mathematics 2007-05-23 Claude Vallee , Vicentiu Radulescu

Two models of random cones in high dimensions are considered, together with their duals. The Donoho-Tanner random cone $D_{n,d}$ can be defined as the positive hull of $n$ independent $d$-dimensional Gaussian random vectors. The Cover-Efron…

Probability · Mathematics 2022-06-30 Thomas Godland , Zakhar Kabluchko , Christoph Thaele

We study the way in which the Euclidean subspaces of a Banach space fit together, somewhat in the spirit of the Ka\v{s}in decomposition. The main tool that we introduce is an estimate regarding the convex hull of a convex body in John's…

Functional Analysis · Mathematics 2015-05-06 Daniel J. Fresen

This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…

Computational Geometry · Computer Science 2025-11-11 Qianwei Zhuang

We propose a decomposition framework for the parallel optimization of the sum of a differentiable (possibly nonconvex) function and a (block) separable nonsmooth, convex one. The latter term is usually employed to enforce structure in the…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-18 Francisco Facchinei , Gesualdo Scutari , Simone Sagratella

We construct examples of Delone sets of the plane (that is, discrete subsets that are uniformly separated and coarsely dense) that are repetitive (each patch of the set appears in every large-enough ball) though non-rectifiable (i.e. non…

Metric Geometry · Mathematics 2016-09-21 María Isabel Cortez , Andrés Navas

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…

Functional Analysis · Mathematics 2008-03-11 B. F. Svaiter

Many iterative optimization algorithms involve compositions of special cases of Lipschitz continuous operators, namely firmly nonexpansive, averaged and nonexpansive operators. The structure and properties of the compositions are of…

Optimization and Control · Mathematics 2020-01-01 Pontus Giselsson , Walaa M. Moursi