Related papers: Gordian Unlinks

We give a universal recipe for constructing nonlinear entanglement witnesses able to detect non-classical correlations in arbitrary systems of distinguishable and/or identical particles for an arbitrary number of constituents. The…

A triangle presentation is a combinatorial datum that encodes the action of a group on a $2$-dimensional triangle complex with prescribed links, which is simply transitive on the vertices. We provide the first infinite family of triangle…

The $2n$ dimensional manifold with two mutually commutative operators of differentiation is introduced. Nontrivial multidimensional integrable systems connected with arbitrary graded (semisimple) algebras are constructed. The general…

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

Complex networks are ubiquitous: a cell, the human brain, a group of people and the Internet are all examples of interconnected many-body systems characterized by macroscopic properties that cannot be trivially deduced from those of their…

The main theorem of Galois theory states that there are no finite group-subgroup pairs with the same invariants. On the other hand, if we consider complex linear reductive groups instead of finite groups, the analogous statement is no…

We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We…

A recent work by Lesnick and Wright proposed a visualisation of $2$D persistence modules by using their restrictions onto lines, giving a family of $1$D persistence modules. We give a constructive proof that any $1$D persistence module with…

We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…

A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…

We construct the complete invariant for fused links. It is proved that the set of equivalence classes of $n$-component fused links is in one-to-one correspondence with the set of elements of the abelization $UVP_n/UVP_n^{\prime}$ up to…

We give a sufficient condition under which vanishing property of Cochran-Orr-Teichner knot concordance obstructions splits under connected sum. The condition is described in terms of self-annihilating submodules with respect to higher-order…

We define a nontrivial mod 2 valued additive concordance invariant defined on the torsion subgroup of the knot concordance group using involutive knot Floer package. For knots not contained in its kernel, we prove that their iterated…

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network…

We construct Euclidean lattices whose sets of minimal vectors support some large equiangular families of lines, using notably reduction modulo~$2$ of lattices. %as considered in \cite{Ma1} and \cite{Ma2}. We also consider some related…

Several authors have introduced various type of coherent-like rings and proved analogous results on these rings. It appears that all these relative coherent rings and all the used techniques can be unified. In [2], several coherent-like…

We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…