A conjecture concerning the Crame r Wold device is answered in the negative by giving a Fourier-free, probabilistic proof using only elementary techniques. It is also shown how a geometric idea allows one to interpret the Crame r Wold device as a special case of a more general concept.
On a Conjecture Concerning Strong Unicity Constants
✍ Scribed by Wolfgang Gehlen
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 163 KB
- Volume
- 101
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In 1983 C. Thomassen conjectured that for every k, g ∈ N there exists d such that any graph with average degree at least d contains a subgraph with average degree at least k and girth at least g. Kühn and Osthus [2004] proved the case g = 6. We give another proof for the case g = 6 which is based
Let C \* n , n=0, 1, ..., \*>&1Â2 be the ultraspherical (Gegenbauer) polynomials, orthogonal on (&1, 1) with respect to the weight (1&x 2 ) \*&1Â2 . Denote by `n, k (\*), k=1, ..., [nÂ2] the positive zeros of C \* n enumerated in decreasing order. The problem of finding the ``extremal'' function f f
we established the validity of the main theorem (1.1) for solid bricks. Here, we establish the existence of suitable separating cuts in nonsolid bricks and prove the theorem by applying induction to cut-contractions with respect to such cuts.