Related papers: Self and mixed delta-moves on algebraically split …
Link-homotopy and self Delta-equivalence are equivalence relations on links. It was shown by J. Milnor (resp. the last author) that Milnor invariants determine whether or not a link is link-homotopic (resp. self Delta-equivalent) to a…
A link stream is a collection of triplets $(t, u, v)$ indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given $\Delta$, a $\Delta$-clique…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
We introduce the non-self OU sequence and the OU number for link diagrams. Using these, we give a lower bound for the number of necessary Reidemeister moves of type III between two diagrams of the same link.
An association scheme is called partially metric if it has a connected relation whose distance-two relation is also a relation of the scheme. In this paper we determine the symmetric partially metric association schemes with a multiplicity…
We consider the operation of Whitehead double on a component of a link and study the behavior of Milnor invariants under this operation. We show that this operation turns a link whose Milnor invariants of length < k are all zero into a link…
We examine the global organization of heterogeneous equilibrium networks consisting of a number of well distinguished interconnected parts--``communities'' or modules. We develop an analytical approach allowing us to obtain the statistics…
Dabkowski and Sahi defined an invariant of a link in the $3$-sphere, which is preserved under $4$-moves. This invariant is a quotient of the fundamental group of the complement of the link. It is generally difficult to distinguish the…
We consider $n$-dimensional discrete motions such that any two neighbouring positions correspond in a pure rotation ("rotating motions"). In the Study quadric model of Euclidean displacements these motions correspond to quadrilateral nets…
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
Taking as starting point a perturbative study of the classical equations of motion of the non-Abelian Chern-Simons Theory with non-dynamical sources, we search for analytical expressions for link invarians. In order to present these…
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…
This paper considers a Markov-modulated duplication-deletion random graph where at each time instant, one node can either join or leave the network; the probabilities of joining or leaving evolve according to the realization of a finite…
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the original vertex. We introduce and study vertex splitting as a…
We extend Milnor's mu-invariants of link homotopy to ordered (classical or virtual) tangles. Simple combinatorial formulas for mu-invariants are given in terms of counting trees in Gauss diagrams. Invariance under Reidemeister moves…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
In movement ecology, the few works that have taken collective behaviour into account are data-driven and rely on simplistic theoretical assumptions, relying in metrics that may or may not be measuring what is intended. In the present paper,…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.