Given a knot $K$ we can apply Seifert's algorithm to produce a surface whose boundary is $K$. The genus of this surface is not necessarily minimal. Is there an upper bound on the genus of the surface produced by Seifert's algorithm in terms of the knot genus of $K$? That is, if $K$ has genus $g$ and Seifert's algorithm produces a surface of genus $n$ does there exist a function $\phi \colon \mathbb{N} \rightarrow \mathbb{N}$ such that $n \leq \phi(g)$?
2026-03-26 19:15:43.1774552543
Upper bound on the genus produced by Seifert's algorithm
113 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GENERAL-TOPOLOGY
- Is every non-locally compact metric space totally disconnected?
- Let X be a topological space and let A be a subset of X
- Continuity, preimage of an open set of $\mathbb R^2$
- Question on minimizing the infimum distance of a point from a non compact set
- Is hedgehog of countable spininess separable space?
- Nonclosed set in $ \mathbb{R}^2 $
- I cannot understand that $\mathfrak{O} := \{\{\}, \{1\}, \{1, 2\}, \{3\}, \{1, 3\}, \{1, 2, 3\}\}$ is a topology on the set $\{1, 2, 3\}$.
- If for every continuous function $\phi$, the function $\phi \circ f$ is continuous, then $f$ is continuous.
- Defining a homotopy on an annulus
- Triangle inequality for metric space where the metric is angles between vectors
Related Questions in UPPER-LOWER-BOUNDS
- Bound for difference between arithmetic and geometric mean
- Show that $\frac{1}{k}-\ln\left(\frac{k+1}{k}\right)$ is bounded by $\frac{1}{k^2}$
- Bounding Probability with Large Variance
- Connectivity of random graphs - proof $\frac{logn}{n}$ is threshold
- Natural log integral inequality
- Spectrum of a matrix after applying an element-wise function (e.g. elementwise log)
- Majorization form for a given set of integers in some interval.
- Proving $(λ^d + (1-λ^d)e^{(d-1)s})^{\frac{1}{1-d}}\leq\sum\limits_{n=0}^\infty\frac1{n!}λ^{\frac{(d^n-1)d}{d-1}+n}s^ne^{-λs}$
- Upper bound for distribution function of the standard normal distribution
- Show $0 < f'(x) \leqslant \frac{1}{2}$
Related Questions in KNOT-THEORY
- Is unknot a composite knot?
- Can we modify one component of a link and keep the others unchanged
- Can we split a splittable link by applying Reidemeister moves to non-self crossings only
- Involution of the 3 and 4-holed torus and its effects on some knots and links
- Equivalence polygonal knots with smooth knots
- Can a knot diagram be recovered from this data?
- Does Seifert's algorithm produce Seifert surfaces with minimal genus?
- Equivalence of links in $R^3$ or $S^3$
- Homotopy type of knot complements
- The complement of a knot is aspherical
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
First, let me answer the question you probably didn't mean: is there a function $\phi:\mathbb{N}\to\mathbb{N}$ such that, given a knot diagram $D$ of a knot $K$ of genus $g$, the genus $n$ of the surface obtained from Seifert's algorithm for $D$ satisfies $n\leq \phi(g)$? The answer is "no" since you can make diagrams of the unknot whose corresponding surface's genus can be made arbitrarily large. For example, the following unknot diagram's surface from Seifert's algorithm has genus $4$:
Extending the pattern horizontally increases the genus of the corresponding surface. (I checked this with KnotFolio. The genus of the Seifert's algorithm surface is under "Can. genus" in the "Diagram information" section. The program does not give the true canonical genus, so it's arguably mislabeled.)
The stronger interpretation of your question is about canonical genus, the minimal genus over all diagrams of $K$ of the surface obtained through Seifert's algorithm. It's not immediately clear to me that canonical genus has an algorithm, so I hesitate to call the canonical genus "the genus of the surface obtained by Seifert's algorithm," which is why I'm giving two answers. When answering this question, I came across a paper that says the answer is "no," since it purports to show that the difference between canonical genus and the knot genus can be arbitrarily large. (I say "purports" because I've only read the abstract.) I don't know whether this is the first paper with this result, since, from the abstract, it seems like their contribution is that they introduce an intermediate quantity called "free genus."
Kobayashi, Masako; Kobayashi, Tsuyoshi, On canonical genus and free genus of knot, J. Knot Theory Ramifications 5, No. 1, 77-85 (1996). ZBL0859.57009.