Related papers: Deciding summability via residues in theory and in…
A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…
We construct Mahler discrete residues for rational functions and show that they comprise a complete obstruction to the Mahler summability problem of deciding whether a given rational function $f(x)$ is of the form $g(x^p)-g(x)$ for some…
Summability has been a central object of study in difference algebra over the past half-century. It serves as a cornerstone of algebraic methods to study linear recurrences over various fields of coefficients and with respect to various…
In 2012 Chen and Singer introduced the notion of discrete residues for rational functions as a complete obstruction to rational summability. More explicitly, for a given rational function f(x), there exists a rational function g(x) such…
Recently we constructed Mahler discrete residues for rational functions and showed they comprise a complete obstruction to the Mahler summability problem of deciding whether a given rational function $f(x)$ is of the form $g(x^p)-g(x)$ for…
A summation framework is developed that enhances Karr's difference field approach. It covers not only indefinite nested sums and products in terms of transcendental extensions, but it can treat, e.g., nested products defined over roots of…
Continuing previous work, this paper focuses on the summability problem of multivariate rational functions in the mixed case in which both shift and $q$-shift operators can appear. Our summability criteria rely on three ingredients…
For given multivariate functions specified by algebraic, differential or difference equations, the separability problem is to decide whether they satisfy linear differential or difference equations in one variable. In this paper, we will…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…
In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the $q$-case.
A summation is a shift-invariant ${\rm R}$-module homomorphism from a submodule of ${\rm R}[[\sigma]]$ to ${\rm R}$ or another ring. [11] formalized a method for extending a summation to a larger domain by telescoping. In this paper, we…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Differential operators usually result in derivatives expressed as a ratio of differentials. For all but the simplest derivatives, these ratios are typically not algebraically manipulable, but must be held together as a unit in order to…
In this paper, we present the foundations of Summability Calculus, which places various established results in number theory, infinitesimal calculus, summability theory, asymptotic analysis, information theory, and the calculus of finite…
We introduce the notion of difference equation defined on a structured set. The symmetry group of the structure determines the set of difference operators. All main notions in the theory of difference equations are introduced as invariants…
Computations, where the number of results is much smaller than the input data and are produced through some sort of accumulation, are called Reductions. Reductions appear in many scientific applications. Usually, reductions admit an…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…