English
Related papers

Related papers: Filling with separating curves

200 papers

The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…

Combinatorics · Mathematics 2025-04-08 Himanshu Chandrakar , Anurag Singh

Let $f: X \to Y$ be a regular covering of a surface $Y$ of finite type with nonempty boundary, with finitely-generated (possibly infinite) deck group $G$. We give necessary and sufficient conditions for an integral homology class on $X$ to…

Geometric Topology · Mathematics 2021-09-29 Nick Salter

A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…

Commutative Algebra · Mathematics 2016-02-01 Emilie Dufresne

We define the dual of a set of generators of the fundamental group of an oriented two-surface $S_{g,n}$ of genus $g$ with $n$ punctures and the associated surface $S_{g,n}\setminus D$ with a disc $D$ removed. This dual is another set of…

High Energy Physics - Theory · Physics 2009-11-11 C. Meusburger

The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…

Geometric Topology · Mathematics 2016-07-20 Jenya Sapir

In this paper, we obtain the minimal length of a filling (multi-)geodesic on a genus $g$ hyperbolic surface in the moduli space of hyperbolic surfaces and show that it is realized by the geodesic whose complement is a right-angled regular…

Geometric Topology · Mathematics 2025-06-17 Yue Gao , Jiajun Wang , Zhongzi Wang

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a…

Combinatorics · Mathematics 2019-09-09 Selim Bahadır

We prove the existence of complete minimal surfaces of genus g>1 which minimize the total curvature for their genus. Our method is first to identify this (Weierstrass high dimensional period) problem with the problem of finding a particular…

Differential Geometry · Mathematics 2007-05-23 Matthias Weber , Michael Wolf

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

Commutative Algebra · Mathematics 2012-07-11 Rashid Zaare-Nahandi

We give a canonical procedure associating to an algebraic number a first a hyperelliptic curve C_a, and then a triangle curve (D_a, G_a) obtained through the normal closure of an associated Belyi function. In this way we show that the…

Algebraic Geometry · Mathematics 2013-03-12 Ingrid Bauer , Fabrizio Catanese , Fritz Grunewald

The systoles of a hyperbolic surface {\Sigma} are the shortest closed geodesics. We say that the systoles fill the surface if the set Syst({\Sigma}) of all systoles cuts {\Sigma} into polygons. We refine an idea of Schmutz [15] to construct…

Geometric Topology · Mathematics 2023-10-25 Ingrid Irmer , Olivier Mathieu

A couple of complex projective plane curves are said to make a Zariski pair if they have the same degree and the same type of singularities, but their embeddings in the projective plane are topologically different. In this paper, we present…

alg-geom · Mathematics 2008-02-03 Ichiro Shimada

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

Data Structures and Algorithms · Computer Science 2015-11-18 Isolde Adler , Stavros G. Kolliopoulos , Dimitrios M. Thilikos

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

The paper is a contribution to the conjecture of Kobayashi that the complement of a generic curve in the projective plane is hyperbolic, provided the degree is at least five. Previously the authors treated the cases of two quadrics and a…

alg-geom · Mathematics 2014-12-01 Gerd Dethloff , Georg Schumacher , Pit-Mann Wong

We show that, for a sheet or a Lusztig stratum S containing spherical conjugacy classes in a connected reductive algebraic group G over an algebraically closed field in good characteristic, the orbit space S/G is isomorphic to the quotient…

Representation Theory · Mathematics 2015-01-20 Giovanna Carnovale , Francesco Esposito

This paper studies the space $X_g\subset \mathcal{M}_g$ consisting of surfaces with filling systoles and its subset, critical points of the systole function. In the first part, we obtain a surface with Teichm\"uller distance…

Geometric Topology · Mathematics 2024-07-24 Yue Gao

We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…

Differential Geometry · Mathematics 2008-04-29 Wayne Rossman

We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…

Computational Geometry · Computer Science 2013-03-13 Rainer Penninger , Ivo Vigan

A subset $S$ of the unit sphere $\mathbb{S}^2$ is called orthogonal-pair-free if and only if there do not exist two distinct points $u, v \in S$ at distance $\frac{\pi}{2}$ from each other. Witsenhausen \cite{witsenhausen} asked the…

Computational Geometry · Computer Science 2024-03-28 Apurva Mudgal