Related papers: Generating links that are both quasi-alternating a…
The Turaev genus and dealternating number of a link are two invariants that measure how far away a link is from alternating. We determine the Turaev genus of a torus knot with five or fewer strands either exactly or up to an error of at…
We show that the infinite matroid intersection conjecture of Nash-Williams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture is true whenever one matroid is nearly finitary and the…
We introduce and study strongly invertible Legendrian links in the standard contact three-dimensional space. We establish the equivariant analogs of basic results separately well-known for strongly invertible and Legendrian links, i.e. the…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
Since the 1974 paper by Peskine and Szpiro, liaison theory via complete intersections, and more generally via Gorenstein varieties, has become a standard tool kit in commutative algebra and algebraic geometry, allowing to compare algebraic…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
Given a graph or a matroid, a tree of tangles is a tree decomposition that displays the structure of the connectivity: every edge of the decomposition tree induces a separation, that is, a way to divide the graph or matroid into two parts;…
We develop a semigroup-theoretic analogue of liaison for relative ideals of a numerical semigroup. Two parallel linkage notions are proposed: a theory based on translates of the semigroup and a theory based on translates of the canonical…
We prove that Legendrian and transverse links in overtwisted contact structures having overtwisted complements can be classified coarsely by their classical invariants. We further prove that any coarse equivalence class of loose links has…
Bar-Natan's Zh-construction associates to each $n$ component virtual link diagram $L$ an $(n+1)$ component virtual link diagram $Zh(L)$. If $L_0,L_1$ are equivalent virtual link diagrams, then $Zh(L_0),Zh(L_1)$ are equivalent as semi-welded…
A virtual link is said to be almost classical (AC) if it has a homologically trivial representative in some thickened surface $\Sigma \times [0,1]$, where $\Sigma$ is a closed orientable surface. AC links provide a useful window for…
We show that quasi-projective relation algebras and directed cylindric algebras are equivalent categorialy. We work out a Godels second incompleteness theorem for finite varibale fragments of first order logic. We show that distinct set…
A {\em string graph} is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the…
Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…
The large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalizations of the potential. This extends into two directions: higher genus and…
The linking number of an oriented two-component link is an invariant indicating how intertwined the two components are. Tuler proved that the linking number of a two-component rational $\frac{p}{q}$-link is $$\sum^{\frac{|p|}{2}}_{k=1}…
Recently, Masanobu Kaneko introduced a conjecture on an extension of the derivation relation for multiple zeta values. The goal of the present paper is to present a proof of this conjecture by reducing it to a class of relations for…
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…
Di Francesco conjectured in 2021 that the number of domino tilings of a certain family of regions -- called Aztec triangles -- on the square lattice is given by a product formula reminiscent of the one giving the number of alternating sign…
We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on…