English
Related papers

Related papers: Filling of closed Surfaces

200 papers

A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…

Computational Geometry · Computer Science 2025-06-10 Therese Biedl , Philipp Kindermann , Jonathan Klawitter

The present work completes the classification of the compact Riemann surfaces of genus g with an analytic automorphism of order p (prime number) and p > g. More precisely, we construct a parameteriza- tion space for them, we compute their…

Algebraic Geometry · Mathematics 2007-05-23 Giancarlo Urzua

Let $\text{Mod}(S_g)$ be the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$. In this paper, we derive necessary and sufficient conditions for two finite-order mapping classes to have commuting conjugates in…

Geometric Topology · Mathematics 2019-02-01 Neeraj K. Dhanwani , Kashyap Rajeevsarathy

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components, and $\mathcal{C}(N)$ be the complex of curves of $N$. Suppose that $g + n \leq 3$ or $g + n \geq 5$. If $\lambda : \mathcal{C}(N) \rightarrow…

Geometric Topology · Mathematics 2012-03-30 Elmas Irmak

For i = 1,2, let Gamma_i be a lattice in a simply connected, solvable Lie group G_i, and let X_i be a connected Lie subgroup of G_i. The double cosets Gamma_igX_i provide a foliation F_i of the homogeneous space Gamma_i\G_i. Let f be a…

Geometric Topology · Mathematics 2016-09-07 Holly Bernstein , Dave Witte

Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The…

Combinatorics · Mathematics 2017-12-12 Saeid Alikhani , Neda Soltani

This note studies the structure of the divisorial fixed part of the dualizing sheaf of a 1-connected curve D on a smooth surface S. It is shown that if the divisorial fixed part F of the dualizing sheaf is non empty then it has arithmetic…

Algebraic Geometry · Mathematics 2007-10-25 Kazuhiro Konno , Margarida Mendes Lopes

A cover of a finite group $G$ is a family of proper subgroups of $G$ whose union is $G$, and a cover is called minimal if it is a cover of minimal cardinality. A partition of $G$ is a cover such that the intersection of any two of its…

Group Theory · Mathematics 2019-04-10 Martino Garonzi , Michell Lucena Dias

We prove that the number of curves of a fixed genus g over finite fields is a polynomial function of the size of the field if and only if g is at most 8. Furthermore, we determine for each positive genus g the smallest n such that the…

Algebraic Geometry · Mathematics 2026-04-21 Samir Canning , Hannah Larson , Sam Payne , Thomas Willwacher

The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…

Algebraic Geometry · Mathematics 2009-09-25 András Némethi

Let $N$ be a connected nonorientable surface of genus $g$ with $n$ punctures. Suppose that $g$ is odd and $g+n \geqslant 6$. We prove that the automorphism group of the complex of curves of $N$ is isomorphic to the mapping class group…

Geometric Topology · Mathematics 2007-05-23 Ferihe Atalan-Ozan

A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of bricks and braces; as per a theorem of Lov{\'a}sz~\cite{lova87},…

Combinatorics · Mathematics 2019-12-18 Fuliang Lu , Nishad Kothari , Xing Feng , Lianzhu Zhang

Fatgraphs are multigraphs enriched with a cyclic order of the edges incident to a vertex. This paper presents algorithms to: (1) generate the set of all fatgraphs having a given genus and number of boundary cycles; (2) compute automorphisms…

Algebraic Geometry · Mathematics 2012-02-16 Riccardo Murri

In this paper we define a $\mathbf{QP}^1$-valued class function on the mapping class group $\mathcal{M}_{g,2}$ of a surface $\Sigma_{g,2}$ of genus $g$ with two boundary components. Let $E$ be a $\Sigma_{g,2}$ bundle over a pair of pants…

Geometric Topology · Mathematics 2016-01-20 Masatoshi Sato

Let $ G=(V,E) $ be a simple graph of order $ n $ and size $ m $. A connected edge cover set of a graph is a subset $S$ of edges such that every vertex of the graph is incident to at least one edge of $S$ and the subgraph induced by $S$ is…

Combinatorics · Mathematics 2024-12-23 Mahsa Zare , Saeid Alikhani , Mohammad Reza Oboudi

We give a finite presentation of the mapping class group of an oriented (possibly bounded) surface of genus greater or equal than 1, considering Dehn twists on a very simple set of curves.

Geometric Topology · Mathematics 2007-05-23 Sylvain Gervais

In this paper, we study all ways of constructing modular compactifications of the moduli space $\mathcal{M}_{g,n}$ of $n$-pointed smooth algebraic curves of genus $g$ by allowing markings to collide. We find that for any such…

Algebraic Geometry · Mathematics 2022-10-10 Vance Blankers , Sebastian Bozlee

The symplectomorphism group of a 2-dimensional surface is homotopy equivalent to the orbit of a filling system of curves. We give a generalization of this statement to dimension 4. The filling system of curves is replaced by a decomposition…

Symplectic Geometry · Mathematics 2014-11-11 Joseph Coffey

Let $d\geq2$ be an integer. The set $\mathbf{F}(d)$ of foliations of degree $d$ on the complex projective plane can be identified with a Zariski's open set of a projective space of dimension $d^2+4d+2$ on which $\mathrm{Aut}(\mathbb…

Dynamical Systems · Mathematics 2021-09-28 Samir Bedrouni , David Marín

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of…

Geometric Topology · Mathematics 2019-06-25 Elmas Irmak