Related papers: Resolutions of Convex Geometries
We prove an abstract criterion that a surjective convolution operator in spaces of analytic functions on convex subsets of the complex plane has a continuous linear right inverse. Considered convex sets have a countable neighborhood basis…
The geometries of spaces having as groups the real orthogonal groups and some of their contractions are described from a common point of view. Their central extensions and Casimirs are explicitly given. An approach to the trigonometry of…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
In this note we study in a finite dimensional Lie algebra ${\mathfrak g}$ the set of all those elements x for which the closed convex hull of the adjoint orbit contains no affine lines; this contains in particular elements whose adjoint…
We develop the combinatorics of leveled trees in order to construct explicit resolutions of (co)operads and (co)operadic (co)bimodules. We build explicit cofibrant resolutions of operads and operadic bimodules in spectra analogous to the…
In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
Affine Coxeter groups are fundamental objects in mathematics and in crystallography. If two group elements are conjugate, then they have very similar algebraic and geometric properties. Using recent structural results of Mili\'cevi\'c,…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…
In many applications, solutions of convex optimization problems are updated on-line, as functions of time. In this paper, we consider parametric semidefinite programs, which are linear optimization problems in the semidefinite cone whose…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We study over a number field, the iterates of automorphisms of the affine space. More precisely, we are interested in the periodic and non-periodic points; for the former the questions are similar to the ones about torsion points on abelian…
In the present paper we investigate the mechanics of systems of affinely-rigid bodies, i.e., bodies rigid in the sense of affine geometry. Certain physical applications are possible in modelling of molecular crystals, granular media, and…
We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments,…
We study the question whether the affine semigroup of integer points in a convex cone can be finitely generated up to symmetries of the cone. We establish general properties of finite generation up to symmetry, and then concentrate on the…
For more than hundred years, various concepts were developed to understand the fields of geometric objects and invariant differential operators between them for conformal Riemannian and projective geometries. More recently, several general…
Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…