Related papers: Arc-presentations of links. Monotonic simplificati…
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose…
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…
We describe symmetries of the braid monodromy decomposition for a class of plane curves defined over reals including the real curves with no real points and proving new divisibility relations for Alexander invariants of such curves.
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
This text provides very easy and short proofs of some basic properties of complex power series (addition, subtraction, multiplication, division, rearrangement, composition, differentiation, uniqueness, Taylor's series, Principle of…
We define numerical link-homotopy invariants of link maps of any number of components, which naturally generalize the Kirk invariant. The Kirk invariant is a link-homotopy invariant of 2-component link maps given by linking numbers of loops…
We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
There is an infinitely generated free subgroup of the smooth knot concordance group with the property that no nontrivial element in this subgroup can be represented by an alternating knot. This subgroup has the further property that every…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…
The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.
The aim of this survey article is to highlight several notoriously intractable problems about knots and links, as well as to provide a brief discussion of what is known about them.
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
If L is an oriented link with $n$ components, then the rank of its Khovanov homology is at least $2^n$. We classify all the links whose Khovanov homology with Z/2-coefficients achieves this lower bound, and show that such links can be…
We show that, given any $n$ and $\alpha$, every embedding of any sufficiently large complete graph in $\mathbb{R}^3$ contains an oriented link with components $Q_1$, ..., $Q_n$ such that for every $i\not =j$, $|\lk(Q_i,Q_j)|\geq\alpha$ and…
In this paper, we introduce a notion of clock moves for spanning trees in plane graphs. This enables us to develop a spanning tree model of an Alexander polynomial for a plane graph and prove the unimodal property of its associate…