Related papers: On rational definite summation
We consider a generalization of the "Hadamard quotient theorem" of Pourchet and van der Poorten. A particular case of our conjecture states that if $f := \sum_{n \geq 0} a(n)x^n$ and $g := \sum_{n \geq 0} b(n)x^n$ represent, respectively,…
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…
Existence of long arithmetic progression in sumsets and subset sums has been studied extensively in the field of additive combinatorics. These additive combinatorics results play a central role in the recent progress of fundamental problems…
In our previous publications we have introduced the cosine product-to-sum identity [17] $$ \prod\limits_{m = 1}^M {\cos \left( {\frac{t}{{{2^m}}}} \right)} = \frac{1}{{{2^{M - 1}}}}\sum\limits_{m = 1}^{{2^{M - 1}}} {\cos \left( {\frac{{2m -…
In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…
An analytic proof is proposed of Wiener's theorem on factorization of positive definite matrix-functions.
We demonstrate the general outlines of a method for obtaining analytic expressions for certain types of general arithmetical sums. In particular, analytical expressions for a general arithmetical sum whose terms are summed over either the…
The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a…
Inspired by the recent pioneering work, dubbed "The Ramanujan Machine" by Raayoni et al. (arXiv:1907.00205), we (automatically) [rigorously] prove some of their conjectures regarding the exact values of some specific infinite continued…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
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…
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
A simple expression is derived for the terms in the Baker-Campbell-Hausdorff series. One formulation of the result involves a finite number of operations with matrices of rational numbers. Generalizations are discussed.
We give a new proof of a classical theorem on approximation of continuous functions on totally real sets
We describe the subgroups of the group $\Z_m \times \Z_n \times \Z_r$ and derive a simple formula for the total number $s(m,n,r)$ of the subgroups, where $m,n,r$ are arbitrary positive integers. An asymptotic formula for the function…
We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
Numerical data processing is a key task across different fields of computer technology use. However, even simple summation of values is not precise due to the floating point representation use. This paper presents a practical algorithm for…
We show that double sums of the form $$ \sum_{i,j=-n} ^{n} |i^sj^t(i^k-j^k)^\beta| \binom {2n} {n+i} \binom {2n} {n+j} $$ can always be expressed in terms of a linear combination of just four functions, namely $\binom {4n}{2n}$, ${\binom…