Related papers: Fully Packed Loop configurations in a triangle
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…
Planar/flat configurations of fixed-angle chains and trees are well studied in the context of polymer science, molecular biology, and puzzles. In this paper, we focus on a simple type of fixed-angle linkage: every edge has unit length…
We study equilibrium configurations of infinitely many identical particles on the real line or finitely many particles on the circle, such that the (repelling) force they exert on each other depends only on their distance. The main question…
In this paper, we resolve the computational complexity of a number of outstanding open problems with practical applications. Here is the list of problems we show to be PPAD-complete, along with the domains of practical significance:…
The class XNLP consists of (parameterized) problems that can be solved nondeterministically in $f(k)n^{O(1)}$ time and $f(k)\log n$ space, where $n$ is the size of the input instance and $k$ the parameter. The class XALP consists of…
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
It is shown that an ensemble of particles with tripolar (colour) charges will necessarily cohere in a hierarchy of structures, from simple clusters and strings to complex aggregates and cyclic molecule-like structures. The basic…
Let $X/\mathbb{C}$ be a smooth variety with simple normal crossings compactification $\bar{X}$, and let $L$ be an irreducible $\overline{\mathbb{Q}}_{\ell}$-local system on $X$ with torsion determinant. Suppose $L$ is cohomologically rigid.…
Using the framework of twisted cohomology, we study twisted Riemann bilinear relations (TRBRs) satisfied by multi-loop Feynman integrals and their cuts in dimensional regularisation. After showing how to associate to a given family of…
This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the…
Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…
Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set…
In the physics literature, Bilal--Fock--Kogan \cite{BFK} introduced the idea of parabolic reduced flat connections on a surface to give a geometric origin to $W$-algebras. In this paper, we combine these ideas with higher complex…
For a list-assignment $L$, the reconfiguration graph $C_L(G)$ of a graph $G$ is the graph whose vertices are proper $L$-colorings of $G$ and whose edges link two colorings that differ on only one vertex. If $|L(v)| \ge d(v) + 2$ for every…
Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a…
We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…
This paper explores the cluster algebra structure of the moduli space $\mathscr{A}_{\mathrm{SL}_{n+1},\mathbb{S}}$ of twisted $\mathrm{SL}_{n+1}$-local systems on a surface. We derive general recurrence relations for cluster variables…
Hexagon relations are algebraic realizations of four-dimensional Pachner moves, and there are hexagon relations admitting nontrivial cohomologies and leading thus to piecewise linear (PL) 4-manifold invariants. We show that some - but not…
Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to combine different…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…