Related papers: Representing finite convex geometries by relativel…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
An open set in C^n is pseudoconvex if and only if its intersection with every affine subspace of complex dimension two as seen as an open set in C^2 is pseudoconvex.
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
Vogt's theorem, concerning boundary angles of a convex arc with monotonic curvature (spiral arc), is taken as a starting point to establish basic properties of spirals. The theorem is expanded by removing requirements of convexity and…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
We use the intrinsic area to define a distance on the space of homothety classes of convex bodies in the $n$-dimensional Euclidean space, which makes it isometric to a convex subset of the infinite dimensional hyperbolic space. The ambient…
This article introduces innovative classes of open sets in \(\mathbb{R}^{N}\), where \(N=2, 3\), characterized by a geometric property associated with the inward normal. The focus lies on proving compactness results for the Hausdorff…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
A real projective orbifold is an $n$-dimensional orbifold modeled on $\mathbb{RP}^n$ with the group $PGL(n+1, \mathbb{R})$. We concentrate on an orbifold that contains a compact codimension $0$ submanifold whose complement is a union of…
A representation of a finitely generated group into the projective general linear group is called convex co-compact if it has finite kernel and its image acts convex co-compactly on a properly convex domain in real projective space. We…
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…
The main result of this paper is a convexity theorem for momentum mappings of certain hamiltonian actions of noncompact semisimple Lie groups. The image is required to fall within a certain open subset D of the (dual of the) Lie algebra,…
We describe classes of coordinate systems in Carnot-Carath\'eodory spaces of low smoothness which allow for homogeneous approximations of quasimetrics and basis vector fields. We establish the minimal smoothness required for these classes…
In this paper we study a class of convex sets which are called closed pseudo-cones and study a new duality of this class. It turns out that the duality characterizes closed pseudo-cones and is essentially the only possible abstract duality…
We interpret the property of having an infinitesimal symmetry as a variational property in certain geometric structures. This is achieved by establishing a one-to-one correspondence between a class of cone structures with an infinitesimal…
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 spherical, Euclidean and…
We investigate choice principles in the Weihrauch lattice for finite sets on the one hand, and convex sets on the other hand. Increasing cardinality and increasing dimension both correspond to increasing Weihrauch degrees. Moreover, we…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…