Related papers: Conditionally Evenly Convex Sets and Evenly Quasi-…
We study relations between maps between relatively hyperbolic groups/spaces and quasisymmetric embeddings between their boundaries. More specifically, we establish a correspondence between (not necessarily coarsely surjective)…
We study the connection between cyclic quasi-monotonicity and quasi-convexity, focusing on whether every cyclically quasi-monotone (possibly multivalued) map is included in the normal cone operator of a quasi-convex function, in analogy…
In this article we prove a global result in the spirit of Basener's theorem regarding the relation between q-pseudoconvexity and q-holomorphic convexity: we prove that any smoothly bounded strictly q-pseudoconvex open subset of the complex…
We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…
We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…
It is shown that the middle quasi-homomorphisms of Fujiwara and Kapovich are precisely constant perturbations of quasi-homomorphisms. Quasi-polynomial maps are defined and their constructibility is explored. In particular, it is shown that…
A vertex-transitive map $X$ is a map on a closed surface on which the automorphism group ${\rm Aut}(X)$ acts transitively on the set of vertices. If the face-cycles at all the vertices in a map are of same type then the map is said to be a…
Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…
We give a method of constructing maps between tubular groups inductively according to a set of strategies. This map will be a quasi-isometry exactly when the set of strategies is consistent. Conversely, if there exists a quasi-isometry…
An interesting question about quasiconvexity in a hyperbolic group concerns finding classes of quasiconvex subsets that are closed under finite intersections. A known example is the class of all quasiconvex subgroups. However, not much is…
In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
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…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
In this paper we consider the complex vector spaces of holomorphic cross-sections of homogeneous holomorphic vector bundles over elliptic adjoint orbits, and provide a sufficient condition for the vector spaces to be finite dimensional in…
Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…
Semi-simplicial and semi-cubical sets are commonly defined as presheaves over respectively, the semi-simplex or semi-cube category. Homotopy Type Theory then popularized an alternative definition, where the set of n-simplices or n-cubes are…
In this paper, we define vector bundles within the framework of almost mathematics (referred to as almost vector bundles) and establish the $v$-descent theorem together with a structure theorem for these bundles over perfectoid spaces. The…
For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…