Related papers: Legendrian theta-graphs

We give a classification of Legendrian torus links. Along the way, we give the first classification of infinite families of Legendrian links where some smooth symmetries of the link cannot be realized by Legendrian isotopies. We also give…

We classify Legendrian knots of topological type $7_6$ having maximal Thurston--Bennequin number confirming the corresponding conjectures of Chongchitmate--Ng.

We show that there exists a Legendrian knot with maximal Thurston-Bennequin invariant whose contact homology is trivial. We also provide another Legendrian knot which has the same knot type and classical invariants but nonvanishing contact…

We define a differential graded algebra for Legendrian graphs and tangles in the standard contact Euclidean three space. This invariant is defined combinatorially by using ideas from Legendrian contact homology. The construction is…

It is shown that, in the 1-jet space of the circle, the swapping and the flyping procedures, which produce topologically equivalent links, can produce nonequivalent legendrian links. Each component of the links considered is legendrian…

In this article, we introduce rack invariants of oriented Legendrian knots in the 3-dimensional Euclidean space endowed with the standard contact structure, which we call Legendrian racks. These invariants form a generalization of the…

We prove that Legendrian and transverse links in overtwisted contact structures having overtwisted complements can be classified coarsely by their classical invariants. We further prove that any coarse equivalence class of loose links has…

We prove that each overtwisted contact structure has knot types that are represented by infinitely many distinct transverse knots all with the same self-linking number. In some cases, we can even classify all such knots. We also show…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$ is the graph whose vertices correspond to the $i(G)$-sets, and where two…

We study Legendrian surfaces determined by cubic planar graphs. Graphs with distinct chromatic polynomials determine surfaces that are not Legendrian isotopic, thus giving many examples of non-isotopic Legendrian surfaces with the same…

Using convex surfaces and Kanda's classification theorem, we classify Legendrian isotopy classes of Legendrian linear curves in all tight contact structures on $T^3$. Some of the knot types considered in this article provide new examples of…

The class of +adequate links contains both alternating and positive links. Generalizing results of Tanaka (for the positive case) and Ng (for the alternating case), we construct fronts of an arbitrary +adequate link A so that the diagram…

A graph $G$ is a link-irregular graph if every two distinct vertices of $G$ have non-isomorphic links. The link of a vertex $v$ in $G$ is the subgraph induced by the neighbors of $v$ in $G$. Ali, Chartrand and Zhang [Discussiones…

For any generic immersion of a Petersen graph into a plane, the number of crossing points between two edges of distance one is odd. The sum of the crossing numbers of all $5$-cycles is odd. The sum of the rotation numbers of all $5$-cycles…

We show that for any Legendrian link $L$ in the $1$-jet space of $S^1$ the $2$-graded ruling polynomial, $R^2_L(z)$, is determined by the Thurston-Bennequin number and the HOMFLY-PT polynomial. Specifically, we recover $R^2_L(z)$ as a…

We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…

We introduce a new braid-theoretic framework with which to understand the Legendrian and transversal classification of knots, namely a Legendrian Markov Theorem without Stabilization which induces an associated transversal Markov Theorem…

We give explicit formulas and algorithms for the computation of the rotation number of a nullhomologous Legendrian knot on a page of a contact open book. On the way, we derive new formulas for the computation of the Thurston-Bennequin…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

We give a complete characterization of the topological slice status of odd 3-strand pretzel knots, proving that an odd 3-strand pretzel knot is topologically slice if and only if either it is ribbon or has trivial Alexander polynomial. (By…