English
Related papers

Related papers: The complexity of pinning simple multiloops

200 papers

Let $M$ be a 3-manifold. Every knotted (embedded) surface in $M \times \R$ can be moved via an ambient isotopy in such a way that its projection into $M$ is a generic surface. A surface is generic if every point on it is either a regular,…

Geometric Topology · Mathematics 2016-05-30 Doron Ben Hadar

We study the complexity of the decision problem known as Permutation Pattern Matching, or PPM. The input of PPM consists of a pair of permutations $\tau$ (the `text') and $\pi$ (the `pattern'), and the goal is to decide whether $\tau$…

Combinatorics · Mathematics 2021-08-10 Vít Jelínek , Michal Opler , Jakub Pekárek

Given a property (graph class) $\Pi$, a graph $G$, and an integer $k$, the \emph{$\Pi$-completion} problem consists in deciding whether we can turn $G$ into a graph with the property $\Pi$ by adding at most $k$ edges to $G$. The…

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

Geometric Topology · Mathematics 2016-06-03 Dmitry Tonkonog

We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…

Computational Complexity · Computer Science 2016-04-27 Manuel Bodirsky , Victor Dalmau , Barnaby Martin , Antoine Mottet , Michael Pinsker

Let $M$ be a closed (compact with no boundary) spherical $CR$ manifold of dimension $2n+1$. Let $\widetilde{M}$ be the universal covering of $M.$ Let $% \Phi $ denote a $CR$ developing map {equation*} \Phi :\widetilde{M}\rightarrow S^{2n+1}…

Differential Geometry · Mathematics 2013-01-08 Jih-Hsin Cheng , Hung-Lin Chiu , Paul Yang

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

Let $\Sigma$ be a surface with boundary $b(\Sigma)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(\Sigma)$-paths in $\Sigma$, and $P$ be a non-separating $b(\Sigma)$-path in $\Sigma$. We prove that there is a homeomorphism $\phi: \Sigma…

Combinatorics · Mathematics 2016-05-03 Jim Geelen , Tony Huynh , R. Bruce Richter

The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $\Gamma$ is the set of all fixing numbers of finite…

Combinatorics · Mathematics 2024-10-15 Courtney R. Gibbons , Joshua D. Laison

We consider the homotopy category of complexes of projective modules over any gentle algebra. We prove that indecomposable $\Sigma$-pure-injective objects in s must be shifts of string or band complexes. We begin with a survey of purity in…

Representation Theory · Mathematics 2020-04-15 Raphael Bennett-Tennenhaus

A sequence of constant mean curvature surfaces $\Sigma_j$ with mean curvature $H_j \to \infty$ in a three-dimensional manifold $M$ condenses to a compact and connected graph $\Gamma$ consisting of a finite union of curves if $\Sigma_j$ is…

Differential Geometry · Mathematics 2009-10-26 Adrian Butscher

Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We show that the number of vertex-labelled cubic multigraphs embeddable on $\mathbb{S}_g$ with $2n$ vertices is asymptotically $c_g n^{5(g-1)/2-1}\gamma^{2n}(2n)!$, where $\gamma$…

Combinatorics · Mathematics 2016-04-12 Wenjie Fang , Mihyun Kang , Michael Moßhammer , Philipp Sprüssel

Quantum simulation with controllable many-body platforms offers a powerful route to exploring complex phases and dynamics that are difficult to access in natural materials. Among these, topological spin textures such as skyrmions are…

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were…

Computational Geometry · Computer Science 2011-03-24 Nathan M. Dunfield , Anil N. Hirani

Let $M^{n+1}$ be a closed manifold of dimension $3\leq n+1\leq 7$. We show that for a $C^\infty$-generic metric $g$ on $M$, to any connected, closed, embedded, $2$-sided, stable, minimal hypersurface $S\subset (M,g)$ corresponds a sequence…

Differential Geometry · Mathematics 2021-09-10 Antoine Song , Xin Zhou

For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size three in time O(|V(G)|). Furthermore, we can allow a subgraph…

Data Structures and Algorithms · Computer Science 2012-10-30 Zdenek Dvorak , Ken-ichi Kawarabayashi

A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch}…

Combinatorics · Mathematics 2023-06-22 Richard C Brewster , Arnott Kidner , Gary MacGillivray

This paper is an extension of the result by Christowiak and Kreisbeck (2017), which addresses the Gamma-convergence approach to a homogenization problem for composite materials consisting of two distinct types of parallel layers. In…

Analysis of PDEs · Mathematics 2025-02-11 Akira Ishikawa , Karel Svadlenka

Given smooth manifolds $V^n$ and $M^m$, an integer $k$, and an immersion $f:V\looparrowright M$, we have constructed an obstruction for existence of regular homotopy of $f$ to an immersion $f':V\looparrowright M$ without $k$-fold points.…

Geometric Topology · Mathematics 2007-05-23 Konstantin Salikhov

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
‹ Prev 1 4 5 6 7 8 10 Next ›