Related papers: Knotted surfaces as vanishing sets of polynomials

We present computational methods for constructing orthogonal/orthonormal polynomials over arbitrary polygonal domains in $\mathbb{R}^2$ using bivariate spline functions. Leveraging a mature MATLAB implementation which generates spline…

Let $f$ be a polynomial system consisting of $n$ polynomials $f_1,\cdots, f_n$ in $n$ variables $x_1,\cdots, x_n$, with coefficients in $\mathbb{Q}$ and let $\langle f\rangle$ be the ideal generated by $f$. Such a polynomial system, which…

We introduce and develop a language of semigroups over the braid groups for a study of braid monodromy factorizations (bmf's) of plane algebraic curves and other related objects. As an application we give a new proof of Orevkov's theorem on…

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…

This article introduces a finite piecewise Euclidean cell complex homeomorphic to the space of monic centered complex polynomials of degree $d$ whose critical values lie in a fixed closed rectangular region. We call this the branched…

One strategy for distinguishing smooth structures on closed $4$-manifolds is to produce a knot $K$ in $S^3$ that is slice in one smooth filling $W$ of $S^3$ but not slice in some homeomorphic smooth filling $W'$. In this paper we explore…

We compute the mapping class group-valued monodromy of any sufficiently ample linear system on any smooth simply connected projective surface, identifying this with the r-spin mapping class group associated to a maximal root of the adjoint…

In this paper, we make use of the relations between the braid and mapping class groups of a compact, connected, non-orientable surface N without boundary and those of its orientable double covering S to study embeddings of these groups and…

A knitted surface is a surface with or without closed components smoothly properly embedded in $D^2 \times B^2$, which is a generalization of a braided surface. A knitted surface is called a 2-dimensional knit if its boundary is the closure…

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…

Given a simply-connected 4-manifold with boundary the 3-sphere, this paper establishes sufficient conditions for a knot in the boundary to be sliced by a locally flat disc in the 4-manifold, whose complement has finite cyclic fundamental…

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

Given $n$ subspaces of a finite-dimensional vector space over a fixed finite field $\mathbb F$, we wish to find a "branch-decomposition" of these subspaces of width at most $k$ that is a subcubic tree $T$ with $n$ leaves mapped bijectively…

In this paper we find a family of knots with trivial Alexander polynomial, and construct two non-isotopic Seifert surfaces for each member in our family. In order to distinguish the surfaces we study the sutured Floer homology invariants of…

Homology groups of spaces of nonsingular polynomial embeddings ${\bf R}^1 \to {\bf R}^n$ of degrees $\le 4$ are calculated. A general algebraic technique of such calculations for spaces of polynomial knots of arbitrary degrees is described.

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

Knot polynomials colored with symmetric representations of $SL_q(N)$ satisfy difference equations as functions of representation parameter, which look like quantization of classical ${\cal A}$-polynomials. However, they are quite difficult…

We construct braided versions $sV_{br}$ of the Brin-Thompson groups $sV$ and prove that they are of type $F_\infty$. The proof involves showing that the matching complexes of colored arcs on surfaces are highly connected.

For $\alpha\colon\mathbb{N}\rightarrow\mathbb{R}$, an $\alpha$-approximate bi-kernel is a polynomial-time algorithm that takes as input an instance $(I, k)$ of a problem $Q$ and outputs an instance $(I',k')$ of a problem $Q'$ of size…