𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A numerical computation of the structure of the roots of q-Bernoulli polynomials

✍ Scribed by C.S. Ryoo; Taekyun Kim

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
223 KB
Volume
214
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

Over the years, there has been increasing interest in solving mathematical problems with the aid of computers. The main purpose of this paper is to construct new generating functions of q-Bernoulli numbers n,q r and q-Bernoulli polynomials n,q r (x). We study the q-Bernoulli polynomials n,q r (x) and investigate the roots of the q-Bernoulli polynomials n,q r (x) for values of the index n by using computer. Finally, we consider the reflection symmetries of the q-Bernoulli polynomials.

πŸ“œ SIMILAR VOLUMES

A numerical computation on the structure
A numerical computation on the structure of the roots of -extension of Genocchi polynomials
✍ C.S. Ryoo πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 750 KB

In this work we observe the behavior of real roots of the q-extension of Genocchi polynomials, c n,q (x), using numerical investigation. By means of numerical experiments, we demonstrate a remarkably regular structure of the complex roots of the c n,q (x) for -1 < q < 0. Finally, we give a table for

On the Roots of Chromatic Polynomials
On the Roots of Chromatic Polynomials
✍ Jason I. Brown πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 158 KB

It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)Γ‚(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a

On the roots of cauchy polynomials
On the roots of cauchy polynomials
✍ K.P. Hadeler; G. Meinardus πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 734 KB