相关论文: Planar pseudo-triangulations, spherical pseudo-til…

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

In this paper, we study the embedded topology of smooth plane quartics and its bitangent lines via two-graphs and apply it to construct interesting examples for Zariski $m$-ple.

The classical theory of elliptic curves with complex multiplication is a fundamental tool for studying the arithmetic of abelian extensions of imaginary quadratic fields. While no direct analogue is available for real quadratic fields, a…

This paper introduces path triangulation of points in a bounded, simply connected surface region, replacing ordinary triangles in a Delaunay triangulation with path triangles from homotopy theory. A {\bf path triangle} has a border that is…

Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…

We investigate a question of Cooper adjacent to the Virtual Haken Conjecture. Assuming certain conjectures in number theory, we show that there exist hyperbolic rational homology 3-spheres with arbitrarily large injectivity radius. These…

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

Learning graph representations via low-dimensional embeddings that preserve relevant network properties is an important class of problems in machine learning. We here present a novel method to embed directed acyclic graphs. Following prior…

The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…

A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of higher-dimensional topology in a way which makes clear…

For $p,q\ge2$ the $\{p,q\}$-tiling graph is the (finite or infinite) planar graph $T_{p,q}$ where all faces are cycles of length $p$ and all vertices have degree $q$. We give algorithms for the problem of recognizing (induced) subgraphs of…

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…

We introduce a new tiling algorithm for hyperbolic 3-manifolds. We use it to compute the maximal cusp area matrix; this completely characterizes the space of all embedded and disjoint cusp neighborhoods. As another application of our work,…

We prove that every cusped hyperbolic 3-manifold has a finite cover admitting infinitely many geometric ideal triangulations. Furthermore, every long Dehn filling of one cusp in this cover admits infinitely many geometric ideal…

The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Primal-Dual Circle Packing Theorem for 3-connected planar…

Knotted trivalent graphs (KTGs) form a rich algebra with a few simple operations: connected sum, unzip, and bubbling. With these operations, KTGs are generated by the unknotted tetrahedron and Moebius strips. Many previously known…

Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…

We provide a new formulation and proof of the triangle altitudes theorem in hyperbolic plane geometry, together with an easily computed discriminant to distinguish between different basic configurations of the altitudes of such a triangle.

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…