On the Dimension of Kakeya Sets and Related Maximal Inequalities
β Scribed by J. Bourgain
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 401 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1016-443X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Any set throughout whole this paper will be assumed non-empty, if it will be not specially given a contrary and any order type, i.e. a type of linearly ordered set, will be assumed as a type of a set containing at bast two elements. If G is a set, then card a denotes the cardinality of G . A linearl
## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. ErdΓΆs, that the maximum number of m