相关论文: Constructing convex planes in the pants complex
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
Motivated by a demand for explicit genus 1 Belyi maps from theoretical physics, we give an efficient method of explicitly computing genus one Belyi maps by (1) composing covering maps from elliptic curves to the Riemann sphere with simpler…
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
The construction of the Farey tessellation in the hyperbolic plane starts with a finitely generated group of symmetries of an ideal triangle, i.e. a triangle with all vertices on the boundary. It induces a remarkable fractal structure on…
A notion of an $i$-banner simplicial complex is introduced. For various values of $i$, these complexes interpolate between the class of flag complexes and the class of all simplicial complexes. Examples of simplicial spheres of an arbitrary…
We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented…
Many authors have constructed different, but related, linear group cocycles that are usually referred to as ``Eisenstein cocycles.'' The main goal of this work is to describe a topological construction that is a common source for all these…
We show that every complete $n$-vertex simple topological graph contains a topological subgraph on at least $(\log n)^{1/4 - o(1)}$ vertices that is weakly isomorphic to the complete convex geometric graph or the complete twisted graph.…
The category of super convex spaces, a proper subcategory of convex spaces, possesses the property that it has a codense subcategory. This codense subcategory allows for an elementary proof that the Giry monad factorizes through the…
We introduce a new class of zero-dimensional weighted complete intersections, by abstracting the essential features of rational cohomology algebras of equal rank homogeneous spaces of compact connected Lie groups. We prove that, on a…
It is proved that every series-parallel digraph whose maximum vertex-degree is $\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\Delta$ distinct slopes. This is shown to be…
For every spatial embedding of each graph in the Petersen family, it is known that the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2. In this paper, we give an integral lift of this…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…
We prove that the space of convex real projective structures on a surface of genus $g\ge 2$ admits a mapping class group invariant K\"ahler metric where Teichm\"uller space with Weil-Petersson metric is a totally geodesic complex…
In the paper, we investigate properties of the nine-dimensional variety of the inflection points of the plane cubic curves. The description of local monodromy groups of the set of inflection points near singular cubic curves is given. Also,…
Here is one of the results obtained in this paper: Let $X, Y$ be two convex sets each in a real vector space, let $J:X\times Y\to {\bf R}$ be convex and without global minima in $X$ and concave in $Y$, and let $\Phi:X\to {\bf R}$ be…
The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool…
A linear system on a smooth complex algebraic surface gives rise to a family of smooth curves in the surface. Such a family has a topological monodromy representation valued in the mapping class group of a fiber. Extending arguments of…