相关论文: Cut-elimination for the mu-calculus with one varia…

We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…

The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…

We present an extension of the spinor integration formalism of one loop amplitudes from the double-cut to the single-cut case. This technique can be applied for the computation of the tadpole coefficients. Moreover we describe an off-shell…

Now there are many different methods to do the PV-reduction for the one loop amplitudes. Two of them are unitarity cut method and generalized unitarity cut method. In this short paper, we present an explicit connection of these two methods,…

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Using a gauge invariant exact renormalization group, we show how to compute the effective action, and extract the physics, whilst manifestly preserving gauge invariance at each and every step. As an example we give an elegant computation of…

The modern conformal bootstrap program often employs the method of linear functionals to derive the numerical or analytical bounds on the CFT data. These functionals must have a crucial "swapping" property, allowing to swap infinite…

In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…

We present an alternative reduction to master integrals for one-loop amplitudes using a unitarity cut method in arbitrary dimensions. We carry out the reduction in two steps. The first step is a pure four-dimensional cut-integration of tree…

A Monte Carlo method to optimize cuts on variables is presented and evaluated. The method gives a much higher signal to noise ratio than does a manual choice of cuts.

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…

This paper proposes first-order modal $\xi$-calculus as well as genealogical Kripke models. Inspired by modal $\mu$-calculus, first-order modal $\xi$-calculus takes a quite similar form and extends its inductive expressivity onto a…

We review different notions of cuts appearing throughout the literature on scattering amplitudes. Despite similar names, such as unitarity cuts or generalized cuts, they often represent distinct computations and distinct physics. We…

We study the classic Max-Cut problem under multiple cardinality constraints, which we refer to as the Constrained Max-Cut problem. Given a graph $G=(V, E)$, a partition of the vertices into $c$ disjoint parts $V_1, \ldots, V_c$, and…

We propose a new method for the numerical computation of the cut locus of a compact submanifold of $\mathbb{R}^3$ without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We…

In this note, we symmetrized the cut-join equation from the proof of Marino-Vafa formula by applying a transcendental changing of variable. One can derive more recursion formulas of Hodge integrals out of this polynomial equations. We also…

In this paper, we revisit Moggi's celebrated calculus of computational effects from the perspective of logic of monoidal action (actegory). Our development takes the following steps. Firstly, we perform proof-theoretic reconstruction of…

We study the conformal bootstrap of 1D CFTs on the straight Maldacena-Wilson line in 4D ${\cal N}=4$ super-Yang-Mills theory. We introduce an improved truncation scheme with an 'OPE tail' approximation and use it to reproduce the…

Dynamic logic is a modal logic for reasoning about programs. A cyclic proof system is a proof system that allows proofs containing cycles and is an alternative to a proof system containing (co-)induction. This paper introduces a sequent…