Related papers: Binomial convolutions for rational power series

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

We obtain some new results on the unimodal sequences of the real values of rational functions by polynomials with positive integer coefficients. Thus, we introduce the notion of merged-log-concavity of rational functions. Roughly speaking,…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

We present criteria for deciding whether a bivariate rational function in two variables can be written as a sum of two (q-)differences of bivariate rational functions. Using these criteria, we show how certain double sums can be evaluated,…

We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a…

In this paper, we discuss sums of powers of the positive integers and compute both the exponential and ordinary generating functions for these sums. We express these generating functions in terms of exponential and geometric polynomials and…

The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…

An extended generating series of the radical of n, involving two variables, leads to an identity in said variables, which proves Bombieri's abc-Conjecture for certain sets of integers.

In this paper, we explore a variety of series involving the central binomial coefficients, highlighting their structural properties and connections to other mathematical objects. Specifically, we derive new closed-form representations and…

We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…

Let $N(n,r,k)$ denote the number of binary words of length $n$ that begin with $0$ and contain exactly $k$ runs (i.e., maximal subwords of identical consecutive symbols) of length $r$. We show that the generating function for the sequence…

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

We give a combinatorial interpretation in terms of bicolored ordered trees for the sequence (a_n)_{n>=1}=(1, 1, 1, 2, 3, 6, 10, 20, 36, 73,... ), A345973 in OEIS, whose generating function satisfies the defining identity Sum_{n>=1}a_n x^n =…

Tandem duplication is an evolutionary process whereby a segment of DNA is replicated and proximally inserted. The different configurations that can arise from this process give rise to some interesting combinatorial questions. Firstly, we…

Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…

The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue problem for a pencil of Hessenberg matrices. Two procedures are…

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…