Related papers: Brunnian links are determined by their complements
Link prediction is one of the fundamental problems in computational social science. A particularly common means to predict existence of unobserved links is via structural similarity metrics, such as the number of common neighbors; node…
A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
If $P$ is a prime number, we show that reduced $\mathfrak{sl}(P)$ link homology with coefficients in $\mathbf{Z}/P$ detects split links. The argument uses Dowlin's spectral sequence and sutured Floer homology with twisted coefficients. When…
If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These…
A 3-connected graph is a brick if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of…
A graph is componentwise biconnected if every connected component either is an isolated vertex or is biconnected. We present a linear-time algorithm for the problem of adding the smallest number of edges to make a bipartite graph…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
Networks play a prominent role in the study of complex systems of interacting entities in biology, sociology, and economics. Despite this diversity, we demonstrate here that a statistical model decomposing networks into matching and…
The central discovery of $2d$ conformal theory was holomorphic factorization, which expressed correlation functions through bilinear combinations of conformal blocks, which are easily cut and joined without a need to sum over the entire…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
We consider the problem of link prediction in networks whose edge structure may vary (sufficiently slowly) over time. This problem, with applications in many important areas including social networks, has two main variants: the first, known…
A lemniscate of a complex polynomial $Q_n$ of degree $n$ is a sublevel set of its modulus, i.e., of the form $\{z \in \mathbb{C}: |Q_n(z)| < t\}$ for some $t>0.$ In general, the number of connected components of this lemniscate can vary…
This paper contains linear systems of equations which can distinguish knots without knot invariants. Let $M_n$ be the topological moduli space of all n-component string links and such that a fixed projection into the plane is an immersion.…
Topological properties of networks are widely applied to study the link-prediction problem recently. Common Neighbors, for example, is a natural yet efficient framework. Many variants of Common Neighbors have been thus proposed to further…
A linking pairing is a symetric bilinear pairing lambda: GxG --> Q/Z on a finite abelian group. The set of isomorphism classes of linking pairings is a non-cancellative monoid E under orthogonal sum, which is infinitely generated and…
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the…
This note shows that if two elements of equal trace (e.g., conjugate elements) generate an arithmetic two-bridge knot or link group, then the elements are parabolic. This includes the figure-eight knot and Whitehead link groups. Similarly,…
The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…