English
Related papers

Related papers: Knotted surfaces as vanishing sets of polynomials

200 papers

We introduce and study a family of groups $\mathbf{BB}_n$, called the blocked-braid groups, which are quotients of Artin's braid groups $\mathbf{B}_n$, and have the corresponding symmetric groups $\Sigma_n$ as quotients. They are defined by…

Category Theory · Mathematics 2013-07-23 D. Maglia , N. Sabadini , R. F. C. Walters

Let C_T be the subgroup of the smooth knot concordance group generated by topologically slice knots and let C_D be the subgroup generated by knots with trivial Alexander polynomial. We prove the quotient C_T/C_D is infinitely generated, and…

Geometric Topology · Mathematics 2013-12-24 Matthew Hedden , Charles Livingston , Daniel Ruberman

We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…

Logic · Mathematics 2014-09-30 Hong Van Le

We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…

Geometric Topology · Mathematics 2020-03-03 Hsien-Chih Chang , Arnaud de Mesmay

We consider the space of embeddings of finitely many circles that bound disks in non-positively curved surfaces. We index the connected components of this space with finite rooted trees and show that the connected components are classifying…

Algebraic Topology · Mathematics 2026-01-21 Ryan C. Gelnett

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

Data Structures and Algorithms · Computer Science 2017-04-25 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

In this paper we compute the homotopy groups of the symplectomorphism groups of the 3-, 4- and 5-point blow-ups of the projective plane (considered as monotone symplectic Del Pezzo surfaces). Along the way, we need to compute the homotopy…

Symplectic Geometry · Mathematics 2014-05-13 Jonathan David Evans

This is the first in a series of papers studying w-knotted objects (w-knots, w-braids, w-tangles, etc.), which make a class of knotted objects which is {w}ider but {w}eaker than their usual counterparts. The group of w-braids was studied…

Geometric Topology · Mathematics 2016-05-04 Dror Bar-Natan , Zsuzsanna Dancso

Let $K\subseteq S^3$ be a knot with exterior $E_K$, and denote by $\rho\colon \pi_1(E_K)\twoheadrightarrow G$ a quotient of its group. We give a sharp obstruction to the existence of a connected, oriented, smooth surface $F\subseteq B^4$…

Geometric Topology · Mathematics 2026-04-02 Alexandra Kjuchukova , Kent E. Orr

Let S be a compact, oriented surface with negative Euler characteristic and let f be a homeomorphism of S that is isotopic to the identity. If there exists a periodic orbit with a non-zero rotation vector, then there exists a simple braid…

Dynamical Systems · Mathematics 2007-05-23 Kamlesh Parwani

We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev…

Geometric Topology · Mathematics 2007-05-23 Jacob Mostovoy , Theodore Stanford

The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…

Geometric Topology · Mathematics 2014-11-11 Joan S. Birman , Michael D. Hirsch

A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of…

Data Structures and Algorithms · Computer Science 2015-03-03 Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Erik Jan van Leeuwen , Marcin Wrochna

We investigate the complement of the discriminant in the projective space PSym^d C^{n+1} of polynomials defining hypersurfaces of degree d in P^n. Following the ideas of Zariski we are able to give a presentation for the fundamental group…

Algebraic Geometry · Mathematics 2019-12-19 Michael Lönne

A stable cutset in a graph $G$ is a set $S\subseteq V(G)$ such that vertices of $S$ are pairwise non-adjacent and such that $G-S$ is disconnected, i.e., it is both stable (or independent) set and a cutset (or separator). Unlike general…

Data Structures and Algorithms · Computer Science 2024-07-03 Stefan Kratsch , Van Bang Le

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Rings and Algebras · Mathematics 2011-12-22 Gábor Ivanyos , Lajos Rónyai , Josef Schicho

The unknot U in S^4 has non-unique smooth spanning 3-balls up to isotopy fixing U. Equivalently there are properly embedded non-separating 3-balls in S^1xB^3 not properly isotopic to 1xB^3. More generally there exist non-separating…

Geometric Topology · Mathematics 2021-04-28 Ryan Budney , David Gabai

We study the projection $\pi: M_d \to B_d$ which sends an affine conjugacy class of polynomial $f: \mathbb{C}\to\mathbb{C}$ to the holomorphic conjugacy class of the restriction of $f$ to its basin of infinity. When $B_d$ is equipped with a…

Dynamical Systems · Mathematics 2011-07-07 Laura DeMarco , Kevin Pilgrim

Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…

Combinatorics · Mathematics 2025-12-23 Phablo F. S. Moura , Hande Yaman , Roel Leus

We present a computational scheme that derives a global polynomial level set parametrisation for smooth closed surfaces from a regular surface-point set and prove its uniqueness. This enables us to approximate a broad class of smooth…