Related papers: Some remarks on Ramanujan sums and cyclotomic poly…

A survey is given on mathematical structures which emerge in multi-loop Feynman diagrams. These are multiply nested sums, and, associated to them by an inverse Mellin transform, specific iterated integrals. Both classes lead to sets of…

We introduce new analogues of the Ramanujan sums, denoted by $\widetilde{c}_q(n)$, associated with unitary divisors, and obtain results concerning the expansions of arithmetic functions of several variables with respect to the sums…

We settle a conjecture proposed by B. Maji and T. Sarkar regarding the location of zeros of a two-parameter family of reciprocal polynomials, $R_{k,\ell}(z)$ for positive integers $k$ and $\ell$. These polynomials are generalizations of…

The determination of Jacobi sums, their congruences and cyclotomic numbers have been the object of attention for many years and there are large number of interesting results related to these in the literature. This survey aims at reviewing…

In this paper, the authors present sharp approximations in terms of sine function and polynomials for the so-called Ramanujan constant (or the Ramanujan $R$-function) $R(a)$, by showing some monotonicity, concavity and convexity properties…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

Let $F_n(x)$ be the partition polynomial $\sum_{k=1}^n p_k(n) x^k$ where $p_k(n)$ is the number of partitions of $n$ with $k$ parts. We emphasize the computational experiments using degrees up to $70,000$ to discover the asymptotics of…

It turned out that the partial sums $g_n(z) = \sum_{k=0}^n \frac{(a_1)_k ... (a_p)_k}{(b_1)_k ... (b_q)_k} \frac{z^k}{k!}$, of the generalized hypergeometric series ${}_p F_q(a_1,...,a_p; b_1,...,b_q;z)$, with parameters…

In this work we introduce interesting infinite series, related to Ramanujan-Soldner constant. Our method uses general properties of polynomials of binomial type and Lagrange inversion theorem. Also we study properties of the operator…

A SONC polynomial is a sum of finitely many non-negative circuit polynomials, whereas a non-negative circuit polynomial is a non-negative polynomial whose support is a simplicial circuit. We show that there exist non-negative polynomials…

Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…

Using the WZ-method we find some of the easiest Ramanujan's formulae and also some new interesting Ramanujan-like sums.

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

A unitary cyclotomic polynomial of order three is a polynomial of the form \[ \Phi^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$,…

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 give some results and conjectures about recurrence relations for certain sequences of binomial sums.

In this paper, we list several interesting structures of cyclotomic polynomials: specifically relations among blocks obtained by suitable partition of cyclotomic polynomials. We present explicit and self-contained proof for all of them,…

We consider sums of the form \[\sum_{j=0}^{n-1}F_1(a_1n+b_1j+c_1)F_2(a_2n+b_2j+c_2)... F_k(a_kn+b_kj+c_k),\] in which each $\{F_i(n)\}$ is a sequence that satisfies a linear recurrence of degree $D(i)<\infty$, with constant coefficients. We…

In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…

In the first part we establish a connection between the Euler-Maclaurin summation formula and the Rota-Baxter functional equation. In the second part we give a simple proof of a formula, due to Ramanujan, on the summation of certain…