Related papers: Semitopological Barycentric Algebras
We show that every continuous valuation on a locally convex, locally convex-compact, sober topological cone $\mathfrak{C}$ has a barycenter. This barycenter is unique, and the barycenter map $\beta$ is continuous, hence is the structure map…
We investigate the Eilenberg-Moore algebras of the extended probabilistic powerdomain monad $\mathcal V_w$ over the category $\mathbf{TOP}_0$ of $T_0$ topological spaces and continuous maps. We prove that every $\mathcal V_w$-algebra in our…
Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…
The space of weak expectations for a given representation of a (unital) separable C*-algebra is a compact convex set of (unital) completely positive maps in the BW topology, when it is non-empty. An application of the classical Choquet…
A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines…
This is the abstract of a series of lectures given during the XIIIth School on Geometry and Physics, Bialystok (Poland), in July 2024. In this minicourse, we first examine the algebraic aspects of barycentric algebras. Then, we focus on…
Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…
The Choquet - Bishop - de Leeuw theorem states that each element of a compact convex subset of a locally convex topological Hausdorff space is a barycenter of a probability measure supported by the set of extreme points of that set. By the…
Given a space X, we study the homotopy type of ${\mathcal B}_n(X)$ the space obtained as "the union of all (n-1)-simplexes spanned by points in X". This is a space encountered in non-linear analysis under the name of "space of barycenters"…
Barycentric averaging is a principled way of summarizing populations of measures. Existing algorithms for estimating barycenters typically parametrize them as weighted sums of Diracs and optimize their weights and/or locations. However,…
A commutative Rota-Baxter algebra can be regarded as a commutative algebra that carries an abstraction of the integral operator. With the motivation of generalizing the study of algebraic geometry to Rota-Baxter algebra, we extend the…
This paper provides a self-contained exploration of subdivisions of simplicial complexes, with emphasis on barycentric subdivision. We present formal definitions of subdivisions, show how the realization of a complex is preserved under…
Letting $P$ be a convex polytope in $\mathbb{R}^d$ with $n>d$ vertices, we study geometric and analytical properties of the set of generalized barycentric coordinates relative to any point $p\in P$. We prove that such sets are polytopes in…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
Convex algebras, also called (semi)convex sets, are at the heart of modelling probabilistic systems including probabilistic automata. Abstractly, they are the Eilenberg-Moore algebras of the finitely supported distribution monad.…
This study focuses on defining normal and strictly convex structures within Menger cone PM-space. It also presents a shared fixed point theorem for the existence of two self-mappings constructed on a strictly convex probabilistic cone…
Tutte's celebrated barycentric embedding theorem describes a natural way to build straight-line embeddings (crossing-free drawings) of a (3-connected) planar graph: map the vertices of the outer face to the vertices of a convex polygon, and…
The optimal transportation problem defines a geometry of probability measures which leads to a definition for weighted averages (barycenters) of measures, finding application in the machine learning and computer vision communities as a…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
We develop a general theory to address a consensus-based combination of estimations in a parallelized or distributed estimation setting. Taking into account the possibility of very discrepant estimations, instead of a full consensus we…