Related papers: FPS In Action: An Easy Way To Find Explicit Formul…
An exact representation of the Baker-Campbell-Hausdorff formula as a power series in just one of the two variables is constructed. Closed form coefficients of this series are found in terms of hyperbolic functions, which contain all of the…
A well-established approach to reasoning about loops during program analysis is to capture the effect of a loop by extracting recurrences from the loop; these express relationships between the values of variables, or program properties such…
Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
In this paper, we construct two binary linear codes associated with multi-dimensional and $m -$multiple power Kloosterman sums (for any fixed $m$) over the finite field $\mathbb{F}_{q}$. Here $q$ is a power of two. The former codes are dual…
Formulas are presented for the recursive generation of four-body integrals in which the integrand consists of arbitrary integer powers (>= -1) of all the interparticle distances r_ij, multiplied by an exponential containing an arbitrary…
A mathematically rigorous Hamiltonian formulation for classical and quantum field theories is given. New results include clarifications of the structure of linear fields, and a plausible formulation for nonlinear fields. Many mathematical…
The general features and characteristics of Kapteyn series, which are a special type of series involving Bessel function, are investigated. For many applications to physics, astrophysics, and mathematics, it is crucial to have closed-form…
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…
The Topological Signal Processing (TSP) framework has been recently developed to analyze signals defined over simplicial complexes, i.e. topological spaces represented by finite sets of elements that are closed under inclusion of subsets…
Reconfiguration paths express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-pin particular, alternatives-to introduce…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
We develop a general framework for finding all perfect powers in sequences derived by shifting non-degenerate quadratic Lucas-Lehmer binary recurrence sequences by a fixed integer. By combining this setup with bounds for linear forms in…
The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of…
For real power series whose non-zero coefficients satisfy $|a_m|^{1/m}\to~1$ we prove a stronger version of Fabry theorem relating the frequency of sign changes in the coefficients and analytic continuation of the sum of the power series.
This paper shows that a simple algorithm produces the {\em all-prefixes-LCSs-graph} in $O(mn)$ time for two input sequences of size $m$ and $n$. Given any prefix $p$ of the first input sequence and any prefix $q$ of the second input…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…
We show generic existence of power series a with complex coefficients a_n, such that the sequence of partial sums of a new power series where its coefficients b_n are functions of a_0, a_1, ..., a_n approximate every polynomial uniformly on…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
The theory of formal power series and derivation is developed from the point of view of the power matrix. A Loewner equation for formal power series is introduced. We then show that the matrix exponential is surjective onto the group of…