Related papers: Series misdemeanors
The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…
Computers calculate transcendental functions by approximating them through the composition of a few limited-precision instructions. For example, an exponential can be calculated with a Taylor series. These approximation methods were…
The present paper is devoted to power series of SP type, i.e. with coefficients that are syntactically sum-product combinations. Apart from their applications to analytic knot theory and the so-called "Volume Conjecture", SP-series are…
This paper describes Nancy, a Network Calculus (NC) library that allows users to perform complex min-plus and max-plus algebra operations efficiently. To the best of our knowledge, Nancy is the only open-source library that implements…
A method for finding Puiseux series goes back to Isaac Newton, which gives the terms of Puiseux series through an infinite recursive process; an additional argument is then used to show that the resulting Puiseux series are convergent. This…
In this paper we present two algorithms for the multiplication of sparse Laurent polynomials and Poisson series (the latter being algebraic structures commonly arising in Celestial Mechanics from the application of perturbation theories).…
We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…
In this paper, a semigroup algebra consisting of polynomial expressions with coefficients in a field $F$ and exponents in an additive submonoid $M$ of $\mathbb{Q}_{\ge 0}$ is called a Puiseux algebra and denoted by $F[M]$. Here we study the…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
First-order probabilistic models combine representational power of first-order logic with graphical models. There is an ongoing effort to design lifted inference algorithms for first-order probabilistic models. We analyze lifted inference…
In the past, empirical evidence has been presented that Hilbert series of symplectic quotients of unitary representations obey a certain universal system of infinitely many constraints. Formal series with this property have been called…
We define the Artinian and Noetherian algebra which consist of formal series involving exponents which are not necessarily integers. All of the usual operations are defined here and characterized. As an application, we compute the algebra…
Probabilistic circuits (PCs) have gained prominence in recent years as a versatile framework for discussing probabilistic models that support tractable queries and are yet expressive enough to model complex probability distributions.…
We associate a formal power series with integer coefficients to a positive real number, we interpret this series as a "$q$-analogue of a real." The construction is based on the notion of $q$-deformed rational number introduced in…
Power series representations for special functions are computationally satisfactory only in the vicinity of the expansion point. Thus, it is an obvious idea to use instead Pad\'{e} approximants or other rational functions constructed from…
What is Sequence Algebra? This is a question that any teacher or student of mathematics or computer science can engage with. Sequences are in Calculus, Combinatorics, Statistics and Computation. They are foundational, a step up from number…
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of linear programming problems and obtain, for each of these…
We are concerned with power series in 1/T over a finite field of 3 elements $\F_3$. In a previous article, Alain Lasjaunias investigated the existence of particular power series of elements algebraic over $\F_3[T]$, having all partial…