𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds on cyclotomic numbers

✍ Scribed by Koichi Betsumiya; Mitsugu Hirasaka; Takao Komatsu; Akihiro Munemasa

Book ID
119317639
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
249 KB
Volume
438
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Upper bounds for Ramsey numbers
Upper bounds for Ramsey numbers
✍ Lingsheng Shi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 207 KB
Upper Bounds for TurΓ‘n Numbers
Upper Bounds for TurΓ‘n Numbers
✍ Alexander Sidorenko πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 549 KB

A system of r-element subsets (blocks) of an n-element set X n is called a Tura n (n, k, r)-system if every k-element subset of X n contains at least one of the blocks. The Tura n number T(n, k, r) is the minimum size of such a system. We prove upper estimates: + as n Γ„ , r Γ„ , k=(#+o(1))r, #>1.

New Upper Bounds for Ramsey Numbers
New Upper Bounds for Ramsey Numbers
✍ Y.R Huang; K.M Zhang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 79 KB

The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.

A note on upper bounds for some Ramsey n
A note on upper bounds for some Ramsey numbers
✍ ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 345 KB

We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.