Related papers: The binomial transform of p-recursive sequences an…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
As is well-known, poly-Bernoulli polynomials are defined in terms of polylogarithm functions. Recently, as degenerate version of such functions and polynomials, degenerate polylogarithm functions were introduced and degenertae…
This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…
By a classical principle of analysis, sufficiently thin subsequences of general sequences of functions behave like sequences of independent random variables. This observation not only explains the remarkable properties of lacunary…
Motivated by the substantial development of the special functions, we contribute to establish some rigorous results on the general series identities with bounded sequences and hypergeometric functions with different arguments, which are…
We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…
This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…
We begin with the observation that the signed generalized Stirling polynomials $P_k(m,x)$, which occur in a generalization of Malmsten's integral, reduce to the falling factorials when $k=m$. The structure of these generalized Stirling…
We introduce a shifted version of the binomial theorem, and use it to study some remarkable trigonometric integrals and their explicit rewriting in terms of binomial multiple sums. Motivated by the expressions of area generating functions…
We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
Discrete analogs of the index transforms, involving Bessel and the modified Bessel functions are introduced and investigated. The corresponding inversion theorems for suitable classes of functions and sequences are established.
In an earlier preprint (math.AG/9810142) we gave an explicit description of the algebraic closure of the field of power series over a field of characteristic p, in terms of "generalized power series". In this paper, we give an analogous…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…
We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields, and a size $n$ transform takes $O(n)$ operations. In the multitape Turing machine model, it allows us to multiply two $n$ bit numbers in…
In this article we study a generalization of Fibonomials, replacing the Fibonacci sequences by bivariate s-Fibonacci polynomial sequences. We call the obtained objects "Bivariate s-Fibopolynomials".
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
Departing from a class of infinite series with central binomial coefficients in the numerator and depending on a positive integer parameter, we first extend known identities to all complex parameters. Then we use various methods, including…
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…