Related papers: Maximal Cuts in Arbitrary Dimension
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this paper, we give FPT algorithms for the…
Any lossless transformation on $n_{s}$ spatial and $n_{p}$ internal modes of light can be described by an $n_{s}n_{p}\times n_{s}n_{p}$ unitary matrix, but there is no known procedure to effect an arbitrary $n_{s}n_{p}\times n_{s}n_{p}$…
It is analysed the triple-cut of one-loop amplitudes in dimensional regularisation within spinor-helicity representation. The triple-cut is defined as a difference of two double-cuts with the same particle content, and a same propagator…
Unitarity cuts are widely used in analytic computation of loop amplitudes in gauge theories such as QCD. We expand upon the technique introduced in hep-ph/0503132 to carry out any finite unitarity cut integral. This technique naturally…
Complex-valued Feynman integrals in the imaginary time formalism and zero-temperature limit suffer from particular types of infrared divergences that can not be regulated by integration dimension alone. Related problems leading to…
We report on three improvements in the context of Feynman integral reduction and $\varepsilon$-factorised differential equations: Firstly, we show that with a specific choice of prefactors, we trivialise the $\varepsilon$-dependence of the…
We propose a novel method, called the dimension-changing transformation (DCT), to compute one-loop Feynman integrals and recently introduced fixed-branch integrals to arbitrary orders in $\epsilon$. The DCT relates one-loop Feynman…
In the simultaneous Max-Cut problem, we are given $k$ weighted graphs on the same set of $n$ vertices, and the goal is to find a cut of the vertex set so that the minimum, over the $k$ graphs, of the cut value is as large as possible.…
In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set.…
We introduce a new approach for the computation of the class of Feynman integrals whose integrands vanish in strictly four-dimensions, so-called ''pseudo-evanescent'' integrals. We argue that, up to $\mathcal{O}(\epsilon)$ corrections,…
We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct…
Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their…
Integration-by-parts identities between loop integrals arise from the vanishing integration of total derivatives in dimensional regularization. Generic choices of total derivatives in the Baikov or parametric representations lead to…
When calculating higher terms of the epsilon-expansion of massive Feynman diagrams, one needs to evaluate particular cases of multiple inverse binomial sums. These sums are related to the derivatives of certain hypergeometric functions with…
We consider Feynman integrals with algebraic leading singularities and total differentials in $\epsilon\,\mathrm{d}\ln$ form. We show for the first time that it is possible to evaluate integrals with singularities involving unrationalizable…
The maximum cut problem for a quintic del Pezzo surface ${\rm Bl}_{4}(\mathbb{P}^2)$ asks: Among all partitions of the 10 exceptional curves into two disjoint sets, what is the largest possible number of pairwise intersections? In this…
We study two variants of \textsc{Maximum Cut}, which we call \textsc{Connected Maximum Cut} and \textsc{Maximum Minimal Cut}, in this paper. In these problems, given an unweighted graph, the goal is to compute a maximum cut satisfying some…
In the first part of this paper, we extend the d-dimensional unitarity cut method of hep-ph/0609191 to cases with massive propagators. We present formulas for integral reduction with which one can obtain coefficients of all pentagon, box,…
Scattering amplitudes at loop level can be expressed in terms of Feynman integrals. The latter satisfy partial differential equations in the kinematical variables. We argue that a good choice of basis for (multi-)loop integrals can lead to…
We provide a comprehensive summary of concepts from Calabi-Yau motives relevant to the computation of multi-loop Feynman integrals. From this we derive several consequences for multi-loop integrals in general, and we illustrate them on the…