Related papers: Quick cut-elimination for strictly positive cuts
We consider the discrete analogue of a fractional integral operator on the Heisenberg group, for which we are able to prove nearly sharp results by means of a simple argument of a combinatorial nature.
A proof using the theory of completely positive maps is given to the fact that if $A \in M_2$, or $A \in M_3$ has a reducing eigenvalue, then every bounded linear operator $B$ with $W(B) \subseteq W(A)$ has a dilation of the form $I \otimes…
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…
We study the low-energy effective theory in N=2 super Yang-Mills theories by microscopic and exact approaches. We calculate the one-instanton correction to the prepotential for any simple Lie group from the microscopic approach. We also…
We set up a method for a recursive calculation of the effective potential which is applied to a cubic potential with imaginary coupling. The result is resummed using variational perturbation theory (VPT), yielding an exponentially fast…
We introduce a generic presentation of 'syntactic objects built by mixed induction and coinduction' encompassing all standard kinds of infinitary terms, as well as derivation trees in non-wellfounded proof systems. We then define a notion…
We investigate the possibility to extract Seiberg-Witten curves from the formal series for the prepotential, which was obtained by the Nekrasov approach. A method for models whose Seiberg-Witten curves are not hyperelliptic is proposed. It…
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our…
The main observation of this paper is that some sequential weak compactness arguments in Hilbert space theory can be replaced by Heine/Borel compactness arguments (for the strong topology). Even though the latter form of compactness fails…
Iterated integrals of paths arise frequently in the study of the Taylor's expansion for controlled differential equations. We will prove a factorial decay estimate, conjectured by M. Gubinelli, for the iterated integrals of non-geometric…
Standard finite element discretizations of the Richards equation may violate the discrete minimum principle, producing unphysical negative saturations. While existing bound-preserving methods typically rely on computationally expensive…
We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description…
The extension of classical imperative programs with real-valued random variables and random branching gives rise to probabilistic programs. The termination problem is one of the most fundamental liveness properties for such programs. The…
In the article the formulas for the modeling of conservative fields in piecewise infinite plate with a thin inclusion found. The accuracy of the found formulas is of order equal to the thickness of the outer layer. The problem for higher…
There are many techniques and tools for termination of C programs, but up to now they were not very powerful for termination proofs of programs whose termination depends on recursive data structures like lists. We present the first approach…
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…
Suzuki-Trotter decompositions of exponential operators like $\exp(Ht)$ are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators, for instance as local…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
In previous work we provided a method for eliminating cuts in non-wellfounded proofs with a local-progress condition, these being the simplest kind of non-wellfounded proofs. The method consisted of splitting the proof into nicely behaved…
We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…