Related papers: Marked Graph Mosaics
In this paper, we introduce a method, called a plat form, of describing a surface-link in the 4-space using a braided surface. We prove that every surface-link, which is not necessarily orientable, can be described in a plat form. The plat…
We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…
We give a brief survey of some known results on intrinsically linked or knotted graphs.
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
We study a canonical spanning surface obtained from a knot or link diagram depending on a given Kauffman state, and give a sufficient condition for the surface to be essential. By using the essential surface, we can see the triviality and…
In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves needed for unlinking. In this paper, we introduce a new link…
We will discuss a method for visual presentation of knotted surfaces in the four space, by examining a number and a position of its Morse's critical points. Using this method, we will investigate surface-knot with one critical point of…
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…
A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
A. S. Lipson constructed two state models yielding the same classical link invariant obtained from the Kauffman polynomial $F(a,z)$. In this paper, we apply Lipson's state models to marked graph diagrams of surface-links, and observe when…
In this paper, we discuss the (co)homology theory of biquandles, derived biquandle cocycle invariants for oriented surface-links using broken surface diagrams and how to compute the biquandle cocycle invariants from marked graph diagrams.…
Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph…
We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…
Dye and Kauffman defined surface bracket polynomials for virtual links by use of surface states, and found a relationship between the surface states and the minimal genus of a surface in which a virtual link diagram is realized. They and…
M. Niebrzydowski and J. H. Przytycki defined a Kauffman bracket magma and constructed the invariant P of framed links in 3-space. The invariant is closely related to the Kauffman bracket polynomial. The normalized bracket polynomial is…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time…