English
Related papers

Related papers: Bipartite knots

200 papers

Let T denote the group of smooth concordance classes of topologically sice knots. We show that the first quotient in the bipolar filtration of T (i.e. 0-bipolar knots modulo 1-bipolar knots) has infinite rank, even modulo Alexander…

Geometric Topology · Mathematics 2016-01-20 Tim D. Cochran , Peter D. Horn

Ng constructed an invariant of knots in ${\mathbb{R}}^3$, a combinatorial knot contact homology. Extending his study, we construct an invariant of surface-knots in ${\mathbb{R}}^4$ using diagrams in ${\mathbb{R}}^3$.

Geometric Topology · Mathematics 2019-09-17 Hiroshi Matsuda

It is well known that for $m\geq 2$ there are at most two non-equivalent $m$-knots with diffeomorphic exterior. Such pair of knots will be called $\textit{ non-reflexive knot pair}$. A classical problem in topology is to determine all…

Geometric Topology · Mathematics 2026-04-02 Hisaaki Endo , Kazunori Iwaki , Andrei Pajitnov

We introduce deformations of lattice cohomology corresponding to the knot homologies found by Ozsv\' ath, Stipsicz and Szab\' o in \cite{OSS4}. By means of holomorphic triangles counting, we prove equivalence with the analytic theory for a…

Geometric Topology · Mathematics 2020-10-16 Antonio Alfieri

A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in…

General Topology · Mathematics 2007-11-05 Kazuhiro Ichihara , Akira Ushijima

We show that the number of labelled $P_7$-free bipartite graphs with $n$ vertices grows as $n^{\Theta(n)}$. This resolves an open problem posed by Allen [P. Allen, Forbidden induced bipartite graphs. J. Graph Theory 60 (2009), no. 3,…

Combinatorics · Mathematics 2016-08-01 Vadim Lozin , Viktor Zamaraev

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes

It was recently shown \cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all edges within each partite set). Here we…

Data Structures and Algorithms · Computer Science 2016-02-26 Serge Gaspers , Christos Papadimitriou , Sigve Hortemo Saether , Jan Arne Telle

In this article, we give a rough, and so not complete yet, proof of Kashaev's conjecture, that is, the volume conjecture for hyperbolic knots, where the hyperbolicity equations associated to knot diagrams appear as the stationary phase…

Quantum Algebra · Mathematics 2007-05-23 Yoshiyuki Yokota

We exhibit an encoding of knots into processes in the {\pi}-calculus such that knots are ambient isotopic if and only their encodings are weakly bisimilar.

Geometric Topology · Mathematics 2010-09-20 L. G. Meredith , David F. Snyder

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…

Geometric Topology · Mathematics 2007-05-23 Maciej Mroczkowski

Whitehead doubles provide a plethora of examples of knots that are topologically slice but not smoothly slice. We discuss the problem of the Whitehead double of the Figure 8 knot and survey commonly used techniques to obstructing sliceness.…

Geometric Topology · Mathematics 2024-10-29 Megan Fairchild

Luo, Tian and Wu [Discrete Math. 345 (4) (2022) 112788] conjectured that for any tree $T$ with bipartition $(X,Y)$, every $k$-connected bipartite graph $G$ with minimum degree at least $k+w$, where $w=\max\{|X|,|Y|\}$, contains a tree…

Combinatorics · Mathematics 2024-12-24 Meng Ji

A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…

Geometric Topology · Mathematics 2026-02-23 Ioannis Diamantis

We construct two distinct yet related M-theory models that provide suitable frameworks for the study of knot invariants. We then focus on the four-dimensional gauge theory that follows from appropriately compactifying one of these M-theory…

High Energy Physics - Theory · Physics 2018-01-17 Verónica Errasti Díez

Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister…

Geometric Topology · Mathematics 2009-02-03 Vassily Olegovich Manturov

A Chebyshev knot is a knot which admits a parametrization of the form $ x(t)=T_a(t); \ y(t)=T_b(t) ; \ z(t)= T_c(t + \phi), $ where $a,b,c$ are pairwise coprime, $T_n(t)$ is the Chebyshev polynomial of degree $n,$ and $\phi \in \RR .$…

Geometric Topology · Mathematics 2010-06-01 Pierre-Vincent Koseleff , Daniel Pecker

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…

We show that if the connected sum of two knots with coprime Alexander polynomials has vanishing von Neumann rho-invariants associated with certain metabelian representations then so do both knots. As an application, we give a new example of…

Geometric Topology · Mathematics 2007-10-11 Se-Goo Kim , Taehee Kim

In this paper, we deal with the signed bad number and the negative decision number of graphs. We show that two upper bounds concerning these two parameters for bipartite graphs in papers [Discrete Math. Algorithms Appl. 1 (2011), 33--41]…

Combinatorics · Mathematics 2021-02-02 Doost Ali Mojdeh , Babak Samadi