Purdy's generalization of Griinbaum's gap conjecture is roved for all arrangements w&h a sufficiently high maximum number of concurrent lines. We also improve Purdy's bounds for the general theorem and establish two lower bounds for h(A) for all arrangements.
Grünbaum's inequality for Bessel functions
✍ Scribed by Richard Askey
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 93 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A simple proof of Grfinbaum's theorem on the 3-colourability of planar graphs having at most three 3-cycles is given, which does not employ the colouring extension. In 1958, Gr6tzsch I-5] proved that every planar graph without cycles of length three is 3-colourable. In 1963, Griinbaum [6] extended
Let ((Z t ), P z ) be a Bessel process of dimension :>0 started at z under P z for z 0. Then the maximal inequality is shown to be satisfied for all stopping times { for (Z t ) with E z ({ pÂ2 )< , and all p>(2&:) 6 0. The constants ( pÂ( p&(2&:))) pÂ(2&:) and pÂ( p&(2&:)) are the best possible. If