相关论文: Gluing of Surfaces with Polygonal Boundaries
The goal of this note is to provide a very short proof of Harer-Zagier formula for the number of ways of obtaining a genus g Riemann surface by identifying in pairs the sides of a (2d)-gon, using semi-infinite wedge formalism operators.
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…
We start with a disk with $2n$ vertices along its boundary where pairs of vertices are connected with $n$ strips with certain restrictions. This forms a {\it pairing}. To relate two pairings, we define an operator called a cut-and-glue…
We consider GL$_m$-dimers of triangulations of regular convex $n$-gons, which give rise to a dimer model with boundary $Q$ and a dimer algebra $\Lambda_Q$. Let $e_b$ be the sum of the idempotents of all the boundary vertices, and…
We give completely combinatorial proofs of the main results of [3] using polygons. Namely, we prove that the mapping class group of a surface with boundary acts faithfully on a finitely-generated linear category. Along the way we prove some…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…
Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…
There are many approaches to the classification of Morse functions and their gradient fields (Morse Fields) on 2-surfaces. This paper studies the gluings of quadrilaterals and the classification of topological surfaces obtained by gluing…
The purpose of this paper is to give an application of the gluing theorem for special Lagrangian submanifolds of a Calabi-Yau 3-fold. We proved a gluing theorem before to smooth a codimension-two singularity of a particular special…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…
Let $S$ be a minimal surface of general type with irregularity $q(S) = 1$. Well-known inequalities between characteristic numbers imply that $3 p_g(S) \le c_2(S) \le 10 p_g(S)$, where $p_g(S)$ is the geometric genus and $c_2(S)$ the…
Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…
We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
The systole of a hyperbolic surface is bounded by a logarithmic function of its genus. This bound is sharp, in that there exist sequences of surfaces with genera tending to infinity that attain logarithmically large systoles. These are…
A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…
We compute, for each genus $g\geq 0$, the generating function $L_g\equiv L_g(t;p_1,p_2,\dots)$ of (labelled) bipartite maps on the orientable surface of genus $g$, with control on all face degrees. We exhibit an explicit change of variables…
We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential…