Related papers: The C-complex clasp number of links
Triple linking numbers were defined for 3-component oriented surface-links in 4-space using signed triple points on projections in 3-space. In this paper we give an algebraic formulation using intersections of homology classes (or cup…
Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called $c$-closure, for a parameterized study of clique enumeration problems. A graph $G$ is $c$-closed if every pair of vertices with at least $c$ common neighbors is adjacent.…
As a generalization of the linking number, we construct a set of invariant numbers for two-component handlebody-links. These numbers are elementary divisors associated with the natural homomorphism from the first homology group of a…
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
Fixing two concordant links in $3$--space, we study the set of all embedded concordances between them, as knotted annuli in $4$--space. When regarded up to surface-concordance or link-homotopy, the set $\mathcal{C}(L)$ of concordances from…
A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\em cylindrical crossing…
We describe a framework for estimating Hilbert-Samuel multiplicities $e_XY$ for pairs of projective varieties $X \subset Y$ from finite point samples rather than defining equations. The first step involves proving that this multiplicity…
The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…
We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…
The homotopy trivializing number, \(n_h(L)\), and the Delta homotopy trivializing number, \(n_\Delta(L)\), are invariants of the link homotopy class of \(L\) which count how many crossing changes or Delta moves are needed to reduce that…
Given a clover link, we construct a bottom tangle by using a disk/band surface of the clover link. Since the Milnor number is already defined for a bottom tangle, we define the Milnor number for the clover link to be the Milnor number for…
Reduce and control complexity is an essential practice in software design. Cyclomatic complexity (CC) is one of the most popular software metrics, applied for more than 40 years. Despite CC is an interesting metric to highlight the number…
The ball number of a link $L$, denoted by $ball(L)$, is the minimum number of solid balls (not necessarily of the same size) needed to realize a necklace representing $L$. In this paper, we show that $ball(L)\leq 5 cr(L)$ where $cr(L)$…
Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating…
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…
By twisting a given link $L$ along an unknotted circle $c$, we obtain an infinite family of links $\{ L_n \}$. We introduce the ``stable unknotting number'' which describes the asymptotic behavior of unknotting numbers of links in the twist…
We present the notion of hom-complexity, $\text{C}(G;H)$, for two graphs $G$ and $H$, along with basic results for this numerical invariant. This invariant $\text{C}(G;H)$ is a number that measures the \aspas{complexity} of the question:…
We consider the link and three-manifold invariants from arXiv:1912.02063, which are defined in terms of certain non-semisimple finite ribbon categories $\mathcal{C}$ together with a choice of tensor ideal and modified trace. If the ideal is…
In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or…