Related papers: Representing convex geometries by almost-circles

We study properties of the convex hull of a set $S$ described by quadratic inequalities. A simple way of generating inequalities valid on $S$ is to take a nonnegative linear combinations of the defining inequalities of $S$. We call such…

This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated…

We review some basic concepts related to convex real projective structures from the differential geometry point of view. We start by recalling a Riemannian metric which originates in the study of affine spheres using the Blaschke connection…

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…

We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

We consider 3-dimensional hyperbolic cone-manifolds, singular along infinite lines, which are ``convex co-compact'' in a natural sense. We prove an infinitesimal rigidity statement when the angle around the singular lines is less than…

In this survey, we study representations of finitely generated groups into Lie groups, focusing on the deformation spaces of convex real projective structures on closed manifolds and orbifolds, with an excursion on projective structures on…

In the first part of this work we explore the geometry of infinite type surfaces and the relationship between its convex core and space of ends. In particular, we show that a geodesically complete hyperbolic surface is made up of its convex…

In this work, we introduce and develop a theory of convex drawings of the complete graph $K_n$ in the sphere. A drawing $D$ of $K_n$ is convex if, for every 3-cycle $T$ of $K_n$, there is a closed disc $\Delta_T$ bounded by $D[T]$ such…

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to the sphere and the hyperbolic…

We provide a complete characterisation of extreme points of the space of sofic representations. We also show that the restriction map $Sof(G,P^{\omega})$ to $Sof(H,P^{\omega})$, where $H\subset G$ is not always surjective. The first part of…

The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in R^3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron…

In this article, we characterize the distortion elements of the group of smooth diffeomorphisms of the circle and of the group of compactly supported smooth diffeomorphisms of the real line. More precisely, we prove that, in this context,…

Piecewise linear vector optimization problems in a locally convex Hausdorff topological vector spaces setting are considered in this paper. The efficient solution set of these problems are shown to be the unions of finitely many semi-closed…

We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…

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…

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…