Related papers: Deriving Closed-Form Expressions for Arithmetic Se…
We use analytic combinatorics to give a direct proof of the closed formula for the generating function of $p$-Bernoulli numbers.
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…
We prove a duality formula for certain sums of values of poly-Bernoulli polynomials which generalizes dualities for poly-Bernoulli numbers. We first compute two types of generating functions for these sums, from which the duality formula is…
Exponential sums have applications to a variety of scientific fields, including, but not limited to, cryptography, coding theory and information theory. Closed formulas for exponential sums of symmetric Boolean functions were found by Cai,…
We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.
The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The…
A very simple closed-form formula for Sheppard's corrections is recovered by means of the classical umbral calculus. By means of this symbolic method, a more general closed-form formula for discrete parent distributions is provided and the…
In this paper we evaluate sums and integrals of products of Fubini polynomials and have new explicit formulas for Fubini polynomials and numbers. As a consequence of these results new explicit formulas for p-Bernoulli numbers and…
We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
When neural networks are used to solve differential equations, they usually produce solutions in the form of black-box functions that are not directly mathematically interpretable. We introduce a method for generating symbolic expressions…
The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
In this paper, we describe a general method for computing Selberg-like integrals based on a formula, due to Kaneko, for Selberg-Jack integrals. The general principle consists in expanding the integrand \emph{w.r.t.} the Jack basis, which is…
This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…
Faulhaber's formula expresses the sum of the first $n$ positive integers, each raised to an integer power $p\geq 0$, as a polynomial in $n$ of degree $p+1$. Ramanujan expressed this sum for $p\in\{\frac12,\frac32,\frac52,\frac72\}$ as the…
This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…