Mathematics – Combinatorics
Scientific paper
2006-12-28
Mathematics
Combinatorics
16 pages
Scientific paper
We give a simple and natural (probabilistic) construction of hypergraph regularization. It is done just by taking a constant-bounded number of random vertex samplings only one time (thus, iteration-free). It is independent from the definition of quasi-randomness and yields a new elementary proof of a strong hypergraph regularity lemma. Consequently, as an example of its applications, we have a new self-contained proof of Szemer\'edi's classic theorem on arithmetic progressions (1975) as well as its multidimensional extension by Furstenberg-Katznelson (1978).
No associations
LandOfFree
A Simple Regularization of Hypergraphs 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 A Simple Regularization of Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Regularization of Hypergraphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-380189