English
Related papers

Related papers: Deriving Closed-Form Expressions for Arithmetic Se…

200 papers

A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…

Numerical Analysis · Mathematics 2021-05-31 W. A. Gunarathna , H. M. Nasir , W. B. Daundasekera

We present a relationship between the generalized hyperharmonic numbers and the poly-Bernoulli polynomials, motivated from the connections between harmonic and Bernoulli numbers. This relationship yields numerous identities for the…

Number Theory · Mathematics 2021-05-11 Levent Kargın , Mehmet Cenkci , Ayhan Dil , Mümün Can

Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.

Combinatorics · Mathematics 2016-05-12 Ilker Akkus

In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…

Combinatorics · Mathematics 2016-03-01 Beáta Bényi , Péter Hajnal

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…

Combinatorics · Mathematics 2024-11-27 Aung Phone Maw

The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a…

Classical Analysis and ODEs · Mathematics 2019-03-25 Sergio A. Carrillo

Display calculi are generalized sequent calculi which enjoy a `canonical' cut elimination strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a meta-theorem, and is preserved by adding or removing…

We transformed the generalized exponential power series to another functional form suitable for further analysis. By applying the Cauchy-Euler differential operator in the form of an exponential operator, the series became a sum of…

General Mathematics · Mathematics 2017-01-04 Henrik Stenlund

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

Classical Analysis and ODEs · Mathematics 2024-09-30 Gergő Nemes

We give some new canonical representations for forms over $\cc$. For example, a general binary quartic form can be written as the square of a quadratic form plus the fourth power of a linear form. A general cubic form in $(x_1,...,x_n)$ can…

Algebraic Geometry · Mathematics 2016-01-20 Bruce Reznick

The purpose of this paper is to present series expansions for even powers of the number $\pi$. This is accomplished by generalizing Euler's method for solving the Basel Problem, which was published in 1735. We employ elementary symmetric…

General Mathematics · Mathematics 2024-03-18 Alois Schiessl

Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.

Number Theory · Mathematics 2018-10-18 Goubi Mouloud

We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain a symbolic summation framework that solves this problem for sums defined, e.g., over…

Symbolic Computation · Computer Science 2009-04-16 Carsten Schneider

One-parameter generalizations of the logarithmic and exponential functions have been obtained as well as algebraic operators to retrieve extensivity. Analytical expressions for the successive applications of the sum or product operators on…

We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets.…

Optimization and Control · Mathematics 2022-08-10 Tzanis Anevlavis , Zexiang Liu , Necmiye Ozay , Paulo Tabuada

A large class of Feynman integrals, like e.g., two-point parameter integrals with at most one mass and containing local operator insertions, can be transformed to multi-sums over hypergeometric expressions. In this survey article we present…

Symbolic Computation · Computer Science 2015-06-17 Carsten Schneider

This paper considers functional series whose terms are higher-order derivatives of Chebyshev polynomials of the second kind, where the degree of the polynomial is related to the order of the derivative. Analytic summation is used to…

Complex Variables · Mathematics 2026-05-14 Dmitriy Dmitrishin , Daniel Gray , Vitaly Khamitov , Alexander Stokolos

Let us consider a cyclic extension of a function field defined over a finite field. For a character (non-trivial) of this extension, we calculate, as a linear combinations of products of Jacobi sums, the coefficients of the polynomial given…

Number Theory · Mathematics 2014-09-22 Alvarez Arturo

We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…

Combinatorics · Mathematics 2015-05-28 José Agapito , Ângela Mestre , Pasquale Petrullo , Maria M. Torres

Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…

Formal Languages and Automata Theory · Computer Science 2025-05-05 Olivier Carton , Jean-Michel Couvreur , Martin Delacourt , Nicolas Ollinger