Related papers: Representing finite convex geometries by relativel…
The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…
The Wong-Rosay theorem characterizes the strongly pseudoconvex domains of $\mathbb{C}^n$ by their automorphism groups. It has a lot of generalizations to other kinds of domains (for example, the weakly pseudoconvex domains). However, most…
In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…
In our previous paper [SIMAX 31 n.3 1491-1506(2010)], we studied the condition metric in the space of maximal rank matrices. Here, we show that this condition metric induces a Lipschitz-Riemann structure on that space. After investigating…
Given a compact Lie group $G$ and an orthogonal $G$-representation $V$, we give a purely metric criterion for a closed subset of the orbit space $V/G$ to have convex pre-image in $V$. In fact, this also holds with the natural quotient map…
We introduce and study a new class of $\eps$-convex bodies (extending the class of convex bodies) in metric and normed linear spaces. We analyze relations between characteristic properties of convex bodies, demonstrate how $\eps$-convex…
Constrained Hamiltonian systems fall into the realm of presymplectic geometry. We show, however, that also Poisson geometry is of use in this context. For the case that the constraints form a closed algebra, there are two natural Poisson…
While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…
Let $H$ be a Hilbert space. For a closed convex body $A$ denote by $r(A)$ the supremum of radiuses of balls, contained in $A$. We prove, that $\sum_{n=1}^\infty r(A_n) \ge r(A)$ for every covering of a convex closed body $A \subset H$ by a…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
The present work concerns generalized convex sets in the real multi-dimensional Euclidean space, known as weakly $1$-convex and weakly $1$-semiconvex sets. An open set is called weakly $1$-convex (weakly $1$-semiconvex) if, through every…
We define a subset of the closure of the upper half plane associated with an endomorphism on a real inner product space, which is called the leaf. When the dimension of the space is at least 3, the leaf is a convex with respect to the…
It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.
We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…
On R^n endowed with a riemannian metric of bounded nonpositive curvature, the weakly convex closed subsets are topologically trivial. The stability of such subsets under intersection characterizes the euclidean spaces.
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
In this work, we present a new efficient method for convex shape representation, which is regardless of the dimension of the concerned objects, using level-set approaches. Convexity prior is very useful for object completion in computer…
Two of the authors have defined the class $ WDC(M)$ as the class of all subsets of a smooth manifold $M$ that may be expressed in local coordinates as certain sublevel sets of DC (differences of convex) functions. If $M$ is Riemanian and…