๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A numerical computation on the structure of the roots of -extension of Genocchi polynomials

โœ Scribed by C.S. Ryoo

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
750 KB
Volume
21
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 the solutions of the q-extension of Genocchi polynomials.

๐Ÿ“œ SIMILAR VOLUMES

A numerical computation of the structure
A numerical computation of the structure of the roots of q-Bernoulli polynomials
โœ C.S. Ryoo; Taekyun Kim ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

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) an

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
On the Extension of 2-Polynomials
On the Extension of 2-Polynomials
โœ P.K. Lin ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 136 KB