Related papers: A rotational approach to triple point obstructions

Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…

The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence…

A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of…

Like simpler graphs, nested (hypernodal) graphs consist of two components: a set of nodes and a set of edges, where each edge connects a pair of nodes. In the hypernodal graph model, however, a node may contain other graphs, so that a node…

Scalar curvature constraints can be studied by means of splitting procedures. The success of this strategy depends on the control we can get on its splitting factors. We introduce canonical so-called minimal splitting factors. They have…

In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…

Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…

We review the framework subfactors provide for understanding modular invariants. We discuss the structure of a generalized Longo-Rehren subfactor and the relationship between the coupling matrices of such subfactors, modular invariance and…

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…

Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…

We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\Omega(\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\log \log n$. We deduce that…

It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs,…

We examine three point functions with two scalar operators and a higher spin current in 2d W_N minimal model to the next non-trivial order in 1/N expansion. The minimal model was proposed to be dual to a 3d higher spin gauge theory, and 1/N…

Given a $\{ 0, 1, \ast \}$-matrix $M$, a minimal $M$-obstruction is a digraph $D$ such that $D$ is not $M$-partitionable, but every proper induced subdigraph of $D$ is. In this note we present a list of all the $M$-obstructions for every $2…

For a very general class of unbounded self-adjoint operator function we prove upper bounds for eigenvalues which lie within arbitrary gaps of the essential spectrum. These upper bounds are given by triple variations. Furthermore, we find…

Benefiting from the capability of building inter-dependencies among channels or spatial locations, attention mechanisms have been extensively studied and broadly used in a variety of computer vision tasks recently. In this paper, we…

Quantum sinh-Gordon model in 1+1 dimensions is one of the simplest and best-studied massive integrable relativistic quantum field theories. We consider this theory on a multi-sheeted Riemann surfaces with a flat metric, which can be seen as…