Related papers: Decomposition results for multiplicative actions a…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the pi-calculus,…
This paper presents some results on a well-known problem in Algebraic Signal Sampling and in other areas of applied mathematics: reconstruction of piecewise-smooth functions from their integral measurements (like moments, Fourier…
Windowed recurrences are sliding window calculations where a function is applied iteratively across the window of data, and are ubiquitous throughout the natural, social, and computational sciences. In this monograph we explore the…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
We consider the demixing problem of two (or more) high-dimensional vectors from nonlinear observations when the number of such observations is far less than the ambient dimension of the underlying vectors. Specifically, we demonstrate an…
The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…
From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric…
We give necessary and sufficient conditions for joint ergodicity results of collections of sequences with respect to systems of commuting measure preserving transformations. Combining these results with a new technique that we call…
Determining whether a given program terminates is the quintessential undecidable problem. Algorithms for termination analysis are divided into two groups: (1) algorithms with strong behavioral guarantees that work in limited circumstances…
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…
The main objective of this paper is to extend Morse-Forman theory to vector-valued functions. This is mostly motivated by the need to develop new tools and methods to compute multiparameter persistence. To generalize the theory, in addition…
We establish new recurrence and multiple recurrence results for a rather large family $\mathcal{F}$ of non-polynomial functions which includes tempered functions defined in [11], as well as functions from a Hardy field with the property…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the…
We obtain partition regularity results for homogeneous quadratic equations whose parametrized solutions admit nice factorizations into linear forms over rings of integers of imaginary quadratic fields. To do so, we develop number-theoretic…
We present a coherent approach to recurrence and transience, starting from a version of the Riesz decomposition theorem for superharmonic elements. Our approach allows straightforward proofs of some known results, entails new theorems, and…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…
The present paper contains some investigations about a uniform variant of the notion of metric hemiregularity, the latter being a less explored property obtained by weakening metric regularity. The introduction of such a quantitative…
Cylindrical Algebraic Decomposition (CAD) by projection and lifting requires many iterated univariate resultants. It has been observed that these often factor, but to date this has not been used to optimise implementations of CAD. We…