Related papers: Parameterized Telescoping Proves Algebraic Indepen…
A special class of autonomous algebraic differential equations is studied. No equations in the class have any entire transcendental solutions. In a sense, for almost all equations in the class, transcendental meromorphic solutions can also…
We present a theorem on taking the repeated indefinite summation of a holomorphic function $\phi(z)$ in a vertical strip of $\mathbb{C}$ satisfying exponential bounds as the imaginary part grows. We arrive at this result using transforms…
Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search,…
In this article, we explore a series of elementary yet insightful results involving integrals related to Gaussian sums. Using techniques rooted in classical calculus, we derive several identities and evaluate nontrivial definite integrals…
We consider the problem of recovering conditional independence relationships between $p$ jointly distributed Hilbertian random elements given $n$ realizations thereof. We operate in the sparse high-dimensional regime, where $n \ll p$ and no…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We introduce a new criterion which tests if a given decomposition of a given ternary form $T$ of even degree is unique. The criterion is based on the analysis of the Hilbert function of the projective set of points $Z$ associated to the…
Discrete tomography is concerned with the reconstruction of images that are defined on a discrete set of lattice points from their projections in several directions. The range of values that can be assigned to each lattice point is…
This article deals with the multiple values and algebraic dependences problem of meromorphic mappings sharing moving hyperplanes in projective space. We give some algebraic dependences theorems for meromorphic mappings sharing moving…
This paper's central theme is to prove the existence of an n-algebra whose multiplication cannot be expressed employing any binary operation. Furthermore, to prove if two algebras are not isomorphic, this property does not hold for…
This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…
We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…
We show that $T_p(z)=\prod_{j=1}^{\infty}(1-z^{p^{j}})^{-1/p^{j}}$ is transcendental over $\overline{\mathbb{Q}}(z)$, and establish the transcendence of its values at nonzero algebraic points inside the unit disk. Furthermore, we obtain an…
The aim of this paper is to exhibit a method for proving that certain analytic functions are not solutions of algebraic differential equations. The method is based on model-theoretic properties of differential fields and properties of…
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First we define formally different…
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of…
Probabilistic programming has emerged as a powerful paradigm in statistics, applied science, and machine learning: by decoupling modelling from inference, it promises to allow modellers to directly reason about the processes generating…
Free theorems are a popular tool in reasoning about parametrically polymorphic code. They are also of instructive use in teaching. Their derivation, though, can be tedious, as it involves unfolding a lot of definitions, then hoping to be…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
The Euler-MacLaurin summation formula relates a sum of a function to a corresponding integral, with a remainder term. The remainder term has an asymptotic expansion, and for a typical analytic function, it is a divergent (Gevrey-1) series.…