English
Related papers

Related papers: The pinning ideal of a multiloop

200 papers

We prove that, given a compact Riemann surface $\Sigma$ and disjoint finite sets $\varnothing\neq E\subset\Sigma$ and $\Lambda\subset\Sigma$, every map $\Lambda \to \mathbb{R}^3$ extends to a complete conformal minimal immersion…

Differential Geometry · Mathematics 2018-12-11 Antonio Alarcon , Ildefonso Castro-Infantes , Francisco J. Lopez

We consider embedded ring-type surfaces (that is, compact, connected, orientable surfaces with two boundary components and Euler-Poincar\'{e} characteristic zero) in ${\bold R}^3$ of constant mean curvature which meet planes $\Pi_1$ and…

Differential Geometry · Mathematics 2016-09-06 John McCuan

Accurate and robust localization and mapping are essential components for most autonomous robots. In this paper, we propose a SLAM system for building globally consistent maps, called PIN-SLAM, that is based on an elastic and compact…

Robotics · Computer Science 2024-07-03 Yue Pan , Xingguang Zhong , Louis Wiesmann , Thorbjörn Posewsky , Jens Behley , Cyrill Stachniss

The multiway-cut problem is, given a weighted graph and k >= 2 terminal nodes, to find a minimum-weight set of edges whose removal separates all the terminals. The problem is NP-hard, and even NP-hard to approximate within 1+delta for some…

Data Structures and Algorithms · Computer Science 2015-06-02 David Karger , Phil Klein , Cliff Stein , Mikkel Thorup , Neal E. Young

Entropy is a natural geometric quantity measuring the complexity of a surface embedded in $\mathbb{R}^3$. For dynamical reasons relating to mean curvature flow, Colding-Ilmanen-Minicozzi-White conjectured that the entropy of any closed…

Differential Geometry · Mathematics 2015-09-22 Daniel Ketover , Xin Zhou

We give three algorithms to determine the crosscap number of a knot in the 3-sphere using $0$-efficient triangulations and normal surface theory. Our algorithms are shown to be correct for a larger class of complements of knots in closed…

Geometric Topology · Mathematics 2024-12-25 William Jaco , J. Hyam Rubinstein , Jonathan Spreer , Stephan Tillmann

On an orientable surface $S$, consider a collection $\Gamma$ of closed curves. The (geometric) intersection number $i_S(\Gamma)$ is the minimum number of self-intersections that a collection $\Gamma'$ can have, where $\Gamma'$ results from…

Computational Geometry · Computer Science 2024-02-08 Loïc Dubois

The pooled data problem asks to identify the unknown labels of a set of items from condensed measurements. More precisely, given $n$ items, assume that each item has a label in $\cbc{0,1,\ldots, d}$, encoded via the ground-truth $\SIGMA$.…

Probability · Mathematics 2023-12-25 Max Hahn-Klimroth , Remco van der Hofstad , Noela Müller , Connor Riddlesden

We consider the homotopical dynamics on compact orientable surfaces of positive genus g. We establish a sufficient and necessary algebraic criterion for homotopy classes with infinitely many periodic points of maps on such surfaces in terms…

Dynamical Systems · Mathematics 2010-06-15 Joerg Kampen

Suppose we are given a finite set of points $P$ in $\R^3$ and a collection of polytopes $\mathcal{T}$ that are all translates of the same polytope $T$. We consider two problems in this paper. The first is the set cover problem where we want…

Computational Geometry · Computer Science 2008-02-21 Sören Laue

A filling curve $\gamma$ on a based surface $S$ determines a pseudo-Anosov homeomorphism $P(\gamma)$ of $S$ via the process of "point-pushing along $\gamma$." We consider the relationship between the self-intersection number $i(\gamma)$ of…

Geometric Topology · Mathematics 2011-12-06 Spencer Dowdall

The pluripolar hull of a pluripolar set E in $\mathbb{P}^n$ is the intersection of all complete pluripolar sets in $\mathbb{P}^n$ that contain $E$. We prove that the pluripolar hull of each compact pluripolar set in $\mathbb{P}^n$ is…

Complex Variables · Mathematics 2018-03-30 Juan Chen , Daowei Ma

A matching is said to be disconnected if the saturated vertices induce a disconnected subgraph and induced if the saturated vertices induce a 1-regular graph. The disconnected and induced matching numbers are defined as the maximum…

We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…

Computational Geometry · Computer Science 2016-12-20 Sándor P. Fekete , Kan Huang , Joseph S. B. Mitchell , Ojas Parekh , Cynthia A. Phillips

Given a point set $\mathcal{P}$ and a plane perfect matching $\mathcal{M}$ on $\mathcal{P}$, a flip is an operation that replaces two edges of $\mathcal{M}$ such that another plane perfect matching on $\mathcal{P}$ is obtained. Given two…

Computational Geometry · Computer Science 2025-03-05 Carla Binucci , Fabrizio Montecchiani , Daniel Perz , Alessandra Tappini

The problem of multiple surface clustering is a challenging task, particularly when the surfaces intersect. Available methods such as Isomap fail to capture the true shape of the surface nearby the intersection and result in incorrect…

Machine Learning · Statistics 2018-12-07 Amir Babaeian

Over a number field $K$, a celebrated result of Silverman states that if $\varphi(z)\in K(z)$ is a rational function whose second iterate is not a polynomial, the set of $S$-integral points in the orbit…

Number Theory · Mathematics 2017-10-11 Wade Hindes

Given a plane curve $\gamma: S^1\to \mathbb R^2$, we consider the problem of determining the minimal number $I(\gamma)$ of inflections which curves $\mbox{diff}(\gamma)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms…

Differential Geometry · Mathematics 2014-02-25 Gleb Nenashev

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…

Combinatorics · Mathematics 2007-05-23 Ronald Ortner

The computation of Feynman integrals is often the bottleneck of multi-loop calculations. We propose and implement a new method to efficiently evaluate such integrals in the physical region through the numerical integration of a suitable set…

High Energy Physics - Phenomenology · Physics 2019-05-01 Manoj K. Mandal , Xiaoran Zhao