arXiv research

New algebraic structures biquasiles defined using dual graph diagrams for knot and link invariants.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by over…

In a recent work of Ayaka Shimizu$^{[5]}$, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only…

The main results in this paper provide upper bounds of the second order Dehn functions for three-dimensional groups Nil and Sol. These upper bounds are obtained by using the Varopoulos transport argument on dual graphs. The first step is to start with reduced handlebody diagrams of the three-dimensional balls either im…

To each ribbon graph we assign a so-called L-space, which is a Lagrangian subspace in an even-dimensional vector space with the standard symplectic form. This invariant generalizes the notion of the intersection matrix of a chord diagram. Moreover, the actions of Morse perestroikas (or taking a partial dual) and Vassil…

This paper improves upper bounds on ribbonlength for certain alternating links.

Let $G$ be a signed graph. Let $\hat{G}$ be the graph obtained from $G$ by replacing each edge $e$ by a chain or a sheaf. We first establish a relation between the $Q$-polynomial of $\hat{G}$[6] and the $W$-polynomial of $G$ [9]. Two special dual cases are derived from the relation, one of which has been studied in [8]…

We construct nontrivial cohomology classes of the space $Imb(S^1,\R^n)$ of imbeddings of the circle into $\R^n$, by means of Feynman diagrams. More precisely, starting from a suitable linear combination of nontrivalent diagrams, we construct, for every even number $n\geq 4$, a de Rham cohomology class on $Imb(S^1,\R^n)…

The dual to a tetrahedron consists of a single vertex at which four edges and six faces are incident. Along each edge, three faces converge. A 2-foam is a compact topological space such that each point has a neighborhood homeomorphic to a neighborhood of that complex. Knotted foams in 4-dimensional space are to knotted…

The paper explores algorithms to transform 3-manifold triangulations while controlling sparsity.

Classifies doodles into prime and super prime types, describing them with doodle codes.

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

Constructs Koszul dual algebras for star-shaped diagrams in 3-manifolds.

Proves minimal crossing diagrams for specific spatial graphs.

The paper examines circle graphs of Gauss diagrams and finds counterexamples to previous descriptions.

Study links and quivers, proving polynomial equality conjecture.

A marked graph diagram is a link diagram possibly with marked $4$-valent vertices. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of representing surface-links by marked graph diagrams. Specially, K. Yoshikawa gave local moves on marked graph diagrams, nowadays called Yoshikawa moves. It is now known that two…

We show that for a special alternating link diagram, the following three polynomials are essentially the same: a) the part of the HOMFLY polynomial that corresponds to the leading term in the Alexander polynomial; b) the $h$-vector for a triangulation of the root polytope of the Seifert graph and c) the enumerator of p…

Paper extends method of presenting surface-links to immersed surface-links.

New approach to electric group for knots and links.

Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon graphs of a knot or link diagram that arise from Seifert states. We provide a ch…

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken …

In this paper Legendrian graphs in $(\mathbb{R}^3,ξ_{\mathrm{st}})$ are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendr…

Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.

Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to show that these graphs determine the chord diagram if the graph has at most one loo…

Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual link diagrams, that are represented by the same ribbon graphs are related to eac…

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

Graphs with certain eigenvalues are linked to simply laced Dynkin diagrams.

New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.

Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study…

Enhances knot counting using mosaic diagrams.

New method finds knots without low treewidth diagrams.

Gem theory helps estimate trisection genus of 4-manifolds.

Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a…

PersLay embeds graph topological signatures into neural networks for improved machine learning.

Optimal diagram found for complete graphs with linear trees.

Proves generalized meander conjectures for knots and spatial graphs.

It is known that every surface-link can be presented by a marked graph diagram, and such a diagram presentation is unique up to moves called Yoshikawa moves. G. Kuperberg introduced a regular isotopy invariant, called the quantum A_2 invariant, for tangled trivalent graph diagrams. In this paper, a polynomial for a mar…

Enhances knot counting invariant using biquasile Boltzmann weights.

MXGNet tackles visual reasoning tasks using graph neural networks.

Given a rational homology sphere M, whose splice diagram satisfy the semigroup condition, Neumann and Wahl were able to define a complete intersection surface singularity called splice diagram singularity from the splice diagram of M. They were also able to show that under an additional hypothesis on M called the congr…

New formulas for spatial 2-bouquet graphs discovered.

Proves partial-dual genus polynomial is a knot invariant weight system.

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a sub-chord diagram. For any generic immersion of the complete graph on six vertices to t…

In this paper we clarify the relationship between ribbon surfaces of Legendrian graphs and quasipositive diagrams by using certain fence diagrams. As an application, we give an alternative proof of a theorem concerning a relationship between quasipositive fiber surfaces and contact structures on the 3-sphere. We also a…

Loops in surfaces and chord diagrams are studied with graph factorizations and grammars.