Stable Kneser hypergraphs and ideals in ℕ with the Nikodym property

Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodym property
HTML articles powered by AMS MathViewer

by Noga Alon, Lech Drewnowski and Tomasz Łuczak PDF

Proc. Amer. Math. Soc. 137 (2009), 467-471 Request permission

We use stable Kneser hypergraphs to construct ideals in $\mathbb {N}$ which are not nonatomic yet have the Nikodým property.

References

N. Alon, P. Frankl, and L. Lovász, The chromatic number of Kneser hypergraphs, Trans. Amer. Math. Soc. 298 (1986), no. 1, 359–370. MR 857448, DOI 10.1090/S0002-9947-1986-0857448-8
H. Auerbach, Über die Vorzeichenverteilung in unendlichen Reihen, Studia Math. 2 (1930), 228–230.
Lech Drewnowski and Iwo Labuda, Vector series whose lacunary subseries converge, Studia Math. 138 (2000), no. 1, 53–80. MR 1750322
Lech Drewnowski and Pedro J. Paúl, The Nikodým property for ideals of sets defined by matrix summability methods, Rev. R. Acad. Cienc. Exactas Fís. Nat. (Esp.) 94 (2000), no. 4, 485–503. Perspectives in mathematical analysis (Spanish). MR 1865750
Jiří Matoušek, Using the Borsuk-Ulam theorem, Universitext, Springer-Verlag, Berlin, 2003. Lectures on topological methods in combinatorics and geometry; Written in cooperation with Anders Björner and Günter M. Ziegler. MR 1988723
A. Schrijver, Vertex-critical subgraphs of Kneser graphs, Nieuw Arch. Wisk. (3) 26 (1978), no. 3, 454–461. MR 512648
Christopher E. Stuart and Paul Abraham, Generalizations of the Nikodym boundedness and Vitali-Hahn-Saks theorems, J. Math. Anal. Appl. 300 (2004), no. 2, 351–361. MR 2098214, DOI 10.1016/j.jmaa.2004.06.030
Günter M. Ziegler, Generalized Kneser coloring theorems with combinatorial proofs, Invent. Math. 147 (2002), no. 3, 671–691. MR 1893009, DOI 10.1007/s002220100188