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

Sharp bounds for the partition function of integer sequences

โœ Scribed by Daniel C. Mayer

Publisher
Springer Netherlands
Year
1987
Tongue
English
Weight
748 KB
Volume
27
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sharp bounds for decompositions of graph
Sharp bounds for decompositions of graphs into completer-partite subgraphs
โœ Gregory, David A.; Vander Meulen, Kevin N. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 435 KB ๐Ÿ‘ 2 views

If G is a graph on n vertices and r 2 2, w e let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), w e may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w

Sharp Bounds for the Ratio of q โ€“ Gamma
Sharp Bounds for the Ratio of q โ€“ Gamma Functions
โœ Horst Alzer ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 148 KB ๐Ÿ‘ 2 views

Let ฮ“q (0 < q = 1) be the q -gamma function and let s โˆˆ (0, 1) be a real number. We determine the largest number ฮฑ = ฮฑ(q, s) and the smallest number ฮฒ = ฮฒ(q, s) such that the inequalities hold for all positive real numbers x. Our result refines and extends recently published inequalities by Ismail