Related papers: Inclusion-exclusion by ordering-free cancellation
Explicit divergences and counterterms do not appear in the differential renormalization method, but they are concealed in the neglected surface terms in the formal partial integration procedure used. A systematic real space cutoff procedure…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension,…
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…
We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.
For even dimensional manifolds, we prove some twisted anomaly cancellation formulas which generalize some well-known cancellation formulas. For odd dimensional manifolds, we obtain some modularly invariant characteristic forms by the…
In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms…
The framework of cyclic proof systems provides a reasonable proof system for logics with inductive definitions. It also offers an effective automated proof search procedure for such logics without finding induction hypotheses. Recent…
In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…
In this paper, we describe how to get Janet decomposition for a finite set of terms and detect completeness of that set by means of the associated Bar Code. Moreover, we explain an algorithm to find a variable ordering (if it exists) s.t. a…
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…
The aim of this paper is to study a whole class of first order differential inclusions, which fit into the framework of perturbed sweeping process by uniformly prox-regular sets. After obtaining well-posedness results, we propose a…
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…
We propose a variation of the notion of Segre class, by forcing a naive `inclusion-exclusion' principle to hold. The resulting class is computationally tractable, and is closely related to Chern-Schwartz-MacPherson classes. We deduce…
Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly…
The paper proposes a model reduction algorithm for linear hybrid systems, i.e., hybrid systems with externally induced discrete events, with linear continuous subsystems, and linear reset maps. The model reduction algorithm is based on…
In this paper combinatorial aspects of normal ordering arbitrary words in the creation and annihilation operators of the q-deformed boson are discussed. In particular, it is shown how by introducing appropriate q-weights for the associated…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
We study the notion of a nice partition or factorization of a hyperplane arrangement due to Terao from the early 1990s. The principal aim of this note is an analogue of Terao's celebrated addition-deletion theorem for free arrangements for…
We develop a version of small cancellation theory in the variety of Burnside groups. More precisely, we show that there exists a critical exponent $n_0$ such that for every odd integer $n\geq n_0$, the well-known classical $C'(1/6)$-small…