Tree Duality Research Articles

Causality, unitarity thresholds, anomalous thresholds and infrared singularities from the loop-tree duality at higher orders

We present the first comprehensive analysis of the unitarity thresholds and anomalous thresholds of scattering amplitudes at two loops and beyond based on the loop- tree duality, and show how non-causal unphysical thresholds are locally cancelled in an efficient way when the forest of all the dual on-shell cuts is considered as one. We also prove that soft and collinear singularities at two loops and beyond are restricted to a compact region of the loop three-momenta, which is a necessary condition for implementing a local cancellation of loop infrared singularities with the ones appearing in real emission; without relying on a subtraction formalism.

Loop-Tree Duality for Multiloop Numerical Integration.

Loop-tree duality (LTD) offers a promising avenue to numerically integrate multiloop integrals directly in momentum space. It is well established at one loop, but there have been only sparse numerical results at two loops. We provide a formal derivation for a novel multiloop LTD expression and study its threshold singularity structure. We apply our findings numerically to a diverse set of up to four-loop finite topologies with kinematics for which no contour deformation is needed. We also lay down the ground work for constructing such a deformation. Our results serve as an important stepping stone towards a generalized and efficient numerical implementation of LTD, which is applicable to the computation of virtual corrections.

NU Polymorphisms on Reflexive Digraphs

We find a set of generators of the variety of reflexive digraphs admitting $k-{NU}$ polymorphisms. We do this, in spite of the fact that such digraphs do not have finite tree duality, by defining finite duals of infinite trees. As a result of this, we answer a question of Quackenbush, Rival, and Rosenberg, giving a finite family of generators of the variety of finite bounded posets admitting $k-{NU}$ polymorphisms.

On the singular behaviour of scattering amplitudes in quantum field theory

We analyse the singular behaviour of one-loop integrals and scattering amplitudes in the framework of the loop--tree duality approach. We show that there is a partial cancellation of singularities at the loop integrand level among the different components of the corresponding dual representation that can be interpreted in terms of causality. The remaining threshold and infrared singularities are restricted to a finite region of the loop momentum space, which is of the size of the external momenta and can be mapped to the phase-space of real corrections to cancel the soft and collinear divergences.

Colourful Theorems and Indices of Homomorphism Complexes

We extend the colourful complete bipartite subgraph theorems of [G. Simonyi, G. Tardos, Local chromatic number, Ky Fan's theorem, and circular colorings, Combinatorica 26 (2006), 587--626] and [G. Simonyi, G. Tardos, Colorful subgraphs of Kneser-like graphs, European J. Combin. 28 (2007), 2188--2200] to more general topological settings. We give examples showing that the hypotheses are indeed more general. We use our results to show that the topological bounds on chromatic numbers of digraphs with tree duality are at most one better than the clique number. We investigate combinatorial and complexity-theoretic aspects of relevant order-theoretic maps.

Adjoint functors and tree duality

Graphs and Algorithms A family T of digraphs is a complete set of obstructions for a digraph H if for an arbitrary digraph G the existence of a homomorphism from G to H is equivalent to the non-existence of a homomorphism from any member of T to G. A digraph H is said to have tree duality if there exists a complete set of obstructions T consisting of orientations of trees. We show that if H has tree duality, then its arc graph delta H also has tree duality, and we derive a family of tree obstructions for delta H from the obstructions for H. Furthermore we generalise our result to right adjoint functors on categories of relational structures. We show that these functors always preserve tree duality, as well as polynomial CSPs and the existence of near-unanimity functions.

On digraph coloring problems and treewidth duality

It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructions, we observe that the reduction is quantifier-free. Using this, we illustrate the power of the logical approach to CSPs by resolving two conjectures about treewidth duality in the digraph case. The point is that the analogues of these conjectures for general CSPs were resolved long ago by proof techniques that break down for digraphs. We also completely characterize those CSPs that are first-order definable and show that they coincide with those that have finitary tree duality. The combination of this result with an older result of Nešetřil and Tardif shows that there is a computable listing of all template structures whose CSP is definable in full first-order logic. Finally, we provide new width lower bounds for some tractable CSPs. The novelty is that our bounds are a tight function of the treewidth of the underlying instance. As a corollary we get a new proof that there exist tractable CSPs without bounded treewidth duality.

Duality and Polynomial Testing of Tree Homomorphisms

Let H be a fixed digraph. We consider the H-colouring problem, i.e., the problem of deciding which digraphs G admit a homomorphism to H. We are interested in a characterization in terms of the absence in G of certain tree-like obstructions. Specifically, we say that H has tree duality if, for all digraphs G, G is not homomorphic to H if and only if there is an oriented tree which is homomorphic to G but not to H. We prove that if H has tree duality then the H-colouring problem is polynomial. We also generalize tree duality to bounded treewidth duality and prove a similar result. We relate these duality concepts to the notion of the X-property studied by Gutjahr, Welzl, and Woeginger. We then focus on the case when H itself is an oriented tree. In fact, we are particularly interested in those trees that have exactly one vertex of degree three and all other vertices of degree one or two. Such trees are called triads. We have shown in a companion paper that there exist oriented triads H for which the H-colouring problem is NP -complete. We contrast these with several families of oriented triads H which have tree duality, or bounded treewidth duality, and hence polynomial H-colouring problems. If P 6= NP , then no oriented triad H with an NP -complete H-colouring problem can have bounded treewidth duality; however no proof of this is known, for any oriented triad H. We prove that none of the oriented triads H with NP -complete Hcolouring problems given in the companion paper has tree duality.