English
Related papers

Related papers: On contractible edges in convex decompositions

200 papers

It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…

Combinatorics · Mathematics 2012-03-14 Olivier Bernardi , Juanjo Rué

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…

Combinatorics · Mathematics 2012-03-16 Jonathan Spreer

We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…

Combinatorics · Mathematics 2025-12-16 Sandra Albrechtsen , Max Pitz , Roman Schaut

Let Y be a surface with only finitely many singularities all of which are cusps. A set of cusps on Y is called three-divisible, if there is a cyclic global triple cover of Y branched precisely over these cusps. The aim of this note is to…

Algebraic Geometry · Mathematics 2012-09-25 Wolf P. Barth , Slawomir Rams

Let $g \colon S \looparrowright N$ be a properly immersed $\pi_1$--injective surface in a non-geometric $3$--manifold $N$. We compute the distortion of $\pi_1(S)$ in $\pi_1(N)$ and show that how it is related to separability of $\pi_1(S)$…

Group Theory · Mathematics 2019-07-03 Hoang Thanh Nguyen

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

Number Theory · Mathematics 2016-08-23 Nikolai Bliznyakov , Stanislav Kondratyev

We consider the derangement graph in which the vertices are permutations of $\{ 1,\ldots, n\}$. Two vertices are joined by an edge if the corresponding permutations differ in every position. The derangement graph is known to be Hamiltonian…

Combinatorics · Mathematics 2022-07-15 Zequn Lv , Mengyu Cao , Mei Lu

We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…

Combinatorics · Mathematics 2025-10-14 Sergei V. Konyagin , Jonathan Passant , Misha Rudnev

Let L be a link in the 3-sphere that is in thin position but not in bridge position and let P be a thin level sphere. We generalize a result of Wu by giving a bound on the number of disjoint irreducible compressing disks that P can have,…

Geometric Topology · Mathematics 2007-05-23 Maggy Tomova

The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…

Algebraic Geometry · Mathematics 2011-01-19 Kristian Ranestad , Bernd Sturmfels

Given a graph $G$, a decomposition of $G$ is a partition of its edges. A graph is $(d, h)$-decomposable if its edge set can be partitioned into a $d$-degenerate graph and a graph with maximum degree at most $h$. For $d \le 4$, we are…

Combinatorics · Mathematics 2020-07-06 Eun-Kyung Cho , Ilkyoo Choi , Ringi Kim , Boram Park , Tingting Shan , Xuding Zhu

A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…

Combinatorics · Mathematics 2024-12-20 Licheng Zhang , Yuanqiu Huang

A pants decomposition of an orientable surface S is a collection of simple cycles that partition S into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P of n points in the plane, we consider the problem of…

Computational Geometry · Computer Science 2009-09-29 Sheung-Hung Poon , Shripad Thite

Along cuspidal edge singularities on a given surface in Euclidean 3-space, which can be parametrized by a regular space curve, a unit normal vector field $\nu$ is well-defined as a smooth vector field of the surface. A cuspidal edge…

Differential Geometry · Mathematics 2014-08-20 Kosuke Naokawa , Masaaki Umehara , Kotaro Yamada

This paper describes a generalization of decomposition in orbifolds. In general terms, decomposition states that two-dimensional orbifolds and gauge theories whose gauge groups have trivially-acting subgroups decompose into disjoint unions…

High Energy Physics - Theory · Physics 2021-10-28 Daniel Robbins , Eric Sharpe , Thomas Vandermeulen

In this note we show that unbounded convex polygons with nonparallel unbounded edges are polynomial images of ${\mathbb R}^2$, whereas their interiors are polynomial images of ${\mathbb R}^3$

Algebraic Geometry · Mathematics 2013-08-01 Carlos Ueno

Let P be a cyclic n-gon with n\ge3, the central angles \th_0,...,\th_{n-1} in (-\pi,\pi], and the winding number w:=(\th_0+...+\th_{n-1})/(2\pi). The vertices of P are assumed to be all distinct from one another. It is then proved that P is…

General Mathematics · Mathematics 2017-01-17 Iosif Pinelis

The moduli space of planar polygons with generic side lengths is a smooth, closed manifold. It is known that these manifolds contain the real points of the moduli space of distinct points on the projective line as an open dense subset.…

Algebraic Topology · Mathematics 2024-02-06 Navnath Daundkar , Priyavrat Deshpande

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Metric Geometry · Mathematics 2020-02-20 Lyle Ramshaw , James B. Saxe