相关论文: Constructing convex planes in the pants complex
For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…
It is proved, that if M is a connected, complete submanifold of a complex space form N and each geodesic of M lies in an 1-dimensional totally geodesic complex submanifold of N, then M is totally geodesic in N and is a real space form or a…
The paper studies the complex 1-dimensional polynomial vector fields with real coefficients under topological orbital equivalence preserving the separatrices of the pole at infinity. The number of generic strata is determined, and a…
Given a family of complex affine planes, we show that it is trivial over a Zariski open subset of the base. The proof relies upon a relative version of the contraction theorem.
The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…
We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…
The usual notion of set-convexity, valid in the classical Euclidean context, metamorphoses into several distinct convexity types in the more general Riemannian setting. By studying this phenomenon in reverse, we characterize complete…
This paper is the second part of a two-part paper investigating the structure and properties of dyadic polygons. A dyadic polygon is the intersection of the dyadic subplane $D^2$ of the real plane $R^2$ and a real convex polygon with…
Let $M$ be a convex cocompact acylindrical hyperbolic 3-manifold of infinite volume, and let $M^*$ denote the interior of the convex core of $M$. In this paper we show that any geodesic plane in $M^*$ is either closed or dense. We also show…
This paper proves a generalization of the Butterfly Theorem, a classical Euclidean result, which is valid in the complex projective plane.
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
Families of translates and homothets of strictly convex curves are proven to possess Helly-type properties generalizing those of a circle. Weaker results are shown for arbitrary convex curves.
Let $G$ be an undirected graph of order $n$ and let $C_i$ be an $i$-cycle graph. $G$ is called pancyclic if $G$ contains a $C_i$ for any $i\in \{3,4,\ldots,n\}$. We show that the pancyclicity of specific Cayley graphs and the Cartesian…
A squaregraph is a plane graph in which each internal face is a $4$-cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semi-strong product of an outerplanar…
It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex…
The non-trivial complete totally geodesic submanifolds of the complex hyperbolic plane $\mathbb H_{\mathbb C}^2$ are the complex geodesics and the real planes. We present two new proofs for this fact. One is a short proof based on an…
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…
We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…
The purpose of this paper is to establish an upper bound on the distance between two pants decompositions in the pants complex for a closed surface of genus g >= 2. This is done by use of graph theory. First distance is found in the pants…
We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.