Hypergraph regularity and the multidimensional Szemerédi theorem

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

53 pages

Scientific paper

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and Katznelson, and the first proof that provides an explicit bound. Similar results with the same consequences have been obtained independently by Nagle, R\"odl, Schacht and Skokan.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Hypergraph regularity and the multidimensional Szemerédi theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hypergraph regularity and the multidimensional Szemerédi theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hypergraph regularity and the multidimensional Szemerédi theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-714320

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.