English
Related papers

Related papers: Face-simple minimal quadrangulations of surfaces

200 papers

This paper concerns the facial geometry of the set of $n \times n$ correlation matrices. The main result states that almost every set of $r$ vertices generates a simplicial face, provided that $r \leq \sqrt{\mathrm{c} n}$, where…

Metric Geometry · Mathematics 2018-01-03 Joel A. Tropp

Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…

Computational Geometry · Computer Science 2025-07-18 Éric Colin de Verdière , Vincent Despré , Loïc Dubois

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

Computational Geometry · Computer Science 2024-02-13 Michael N. Vrahatis

Let $\Gamma_g$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We introduce a combinatorial structure of "core surfaces", that represent subgroups of $\Gamma_g$. These structures are (usually)…

Group Theory · Mathematics 2022-06-22 Michael Magee , Doron Puder

We prove that every minimal symplectic filling of the link of a quotient surface singularity can be obtained from its minimal resolution by applying a sequence of rational blow-downs and symplectic antiflips. We present an explicit…

Geometric Topology · Mathematics 2019-12-18 Hakho Choi , Heesang Park , Dongsoo Shin

We present a fixed-parameter tractable (FPT) algorithm to find a shortest curve that encloses a set of k required objects in the plane while paying a penalty for enclosing unwanted objects. The input is a set of interior-disjoint simple…

Computational Geometry · Computer Science 2025-04-07 Therese Biedl , Éric Colin de Verdière , Fabrizio Frati , Anna Lubiw , Günter Rote

We find the minimum number $k=\mu'(\Sigma)$ for any surface $\Sigma$, such that every $\Sigma$-embeddable non-bipartite graph is not $k$-extendable. In particular, we construct the so-called bow-tie graphs $C_6\bowtie P_n$, and show that…

Combinatorics · Mathematics 2015-01-23 Hongliang Lu , David G. L. Wang

Let $(S,0)$ be a rational complex surface singularity with reduced fundamental cycle, also known as a {\em minimal} singularity. Using a fundamental result by M. Spivakovsky, we explain how to get a minimal resolution of the discriminant…

Algebraic Geometry · Mathematics 2007-05-23 Romain Bondil

We study simplices with equiareal faces in the Euclidean 3-space by means of elementary geometry. We present an unexpectedly simple proof of the fact that, if such a simplex is non-degenerate, than every two of its faces are congruent. We…

Metric Geometry · Mathematics 2009-09-11 Victor Alexandrov , Nadezhda Alexandrova , Gunter Weiss

A simple surface amalgam is the union of a finite collection of surfaces with precisely one boundary component each and which have their boundary curves identified. We prove if two fundamental groups of simple surface amalgams act properly…

Geometric Topology · Mathematics 2018-12-05 Emily Stark , Daniel Woodhouse

We construct a new family of simply connected minimal complex surfaces with $p_g=1$, $q=0$, and $K^2=8$ using a $\mathbb{Q}$-Gorenstein smoothing theory.

Algebraic Geometry · Mathematics 2009-10-20 Heesang Park , Jongil Park , Dongsoo Shin

We give an explicit construction of any simply-connected superconformal surface $\phi\colon M^2\to \R^4$ in Euclidean space in terms of a pair of conjugate minimal surfaces $g,h\colon M^2\to\R^4$. That $\phi$ is superconformal means that…

Differential Geometry · Mathematics 2007-10-30 Marcos Dajczer , Ruy Tojeiro

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

Combinatorics · Mathematics 2015-05-20 Sean R. Carrell , Guillaume Chapuy

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The…

Discrete Mathematics · Computer Science 2016-07-12 Arman Zaribafiyan , Dominic J. J. Marchand , Seyed Saeed Changiz Rezaei

In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…

Analysis of PDEs · Mathematics 2023-10-24 Cătălin I. Cârstea , Matti Lassas , Tony Liimatainen , Leo Tzou

For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…

Geometric Topology · Mathematics 2025-10-21 Senja Barthel , Fabio Buccoliero

In this paper, we solve affirmatively B.-Y. Chen's conjecture for hypersurfaces in the Euclidean space, under a generic condition. More precisely, every biharmonic hypersurface of the Euclidean space must be minimal if their principal…

Differential Geometry · Mathematics 2014-08-26 N. Koiso , H. Urakawa

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

Combinatorics · Mathematics 2010-02-04 Qiuli Li , Heping Zhang

In the early 1980s, S. T. Yau conjectured that any compact Riemannian three-manifold admits an infinite number of closed immersed minimal surfaces. We use min-max theory for the area functional to prove this conjecture in the positive Ricci…

Differential Geometry · Mathematics 2016-12-16 Fernando C. Marques , Andr'e Neves

This paper describes a method for fast simplification of surface meshes. Whereas past methods focus on visual appearance, our goal is to solve equations on the surface. Hence, rather than approximate the extrinsic geometry, we construct a…