Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Removal lemma"”.

  1. The Removal Property for Linear Configurations in Compact Abelian Groups

    The combinatorial removal lemma states that, if a (hyper)graph K has not many copies of the fixed (hyper)graph H , then K can be made free of copies of H by removing a small set of (hyper)edges from K. In this thesis we show results for homomorphisms in finite abelian groups, and for integer linear …

    toronto-retro Repository record for The Removal Property for Linear Configurations in Compact Abelian Groups (opens in a new tab)

  2. Topics in combinatorics and additive number theory

    … 2, we will consider bounds for the arithmetic removal lemma in abelian groups, and show that good bounds would hold as a consequence of good bounds on a related problem.</p> <p>In Chapter 3, we will discuss sets of integers with many solutions to a linear equation, and prove various results …

    oxford Repository record for Topics in combinatorics and additive number theory (opens in a new tab)

  3. A multidimensional Szemerédi's theorem in the primes

    … by directly proving a version of hypergraph removal lemma in the weighted hypergraphs. The method is to run an energy increment on a parametric weight systems of measures, rather than on a single measure space, to overcome the presence of intermediate weights. Contrary to [110], [68] where …

    ubc Repository record for A multidimensional Szemerédi's theorem in the primes (opens in a new tab) Download PDF for A multidimensional Szemerédi's theorem in the primes (opens in a new tab)

  4. Extremal problems on counting combinatorial structures

    … other tools the Ruzsa-Szemer\'{e}di Triangle Removal Lemma and recent results on characterizing of the structure of independent sets in hypergraphs. This is a joint work with J\'{o}zsef Balogh. In Chapter 3, we investigate the structure of maximal triangle-free graphs. We prove that almost all …

    uiuc Repository record for Extremal problems on counting combinatorial structures (opens in a new tab)

  5. New results in extremal combinatorics

    … are ‘fat’. The main tool we used is the triangle removal lemma. The last problem in this dissertation is about the sum-product conjecture of Erdos and Szemeredi. The sum-product estimate concerns the larger size of the sumset and productset in terms of the size of the set itself. In Chapter 4 we …

    ubc Repository record for New results in extremal combinatorics (opens in a new tab) Download PDF for New results in extremal combinatorics (opens in a new tab)

  6. Removing Redundancies of Fast Fourier Transform Computations

    … order to reduce the redundant samples, a sample removal lemma, and two types of twiddle factor transformations are proposed: pushing and modulation. We consider 4 different cases for an N = P x Q point canonic RFFT: 1) P is odd, Q is odd; 2) P is odd, Q is even; 3) P is even, Q is odd; and 4) P …

    umn Repository record for Removing Redundancies of Fast Fourier Transform Computations (opens in a new tab)

  7. Analytic properties of sparse graphs and hypergraphs

    … hypergraphs that satisfy relative counting and removal lemmas. Finally, we present number theoretical and algorithmic applications of the aforementioned results.

    greece Repository record for Analytic properties of sparse graphs and hypergraphs (opens in a new tab)

  8. A Hypergraph Regularity Method for Linear Hypergraphs

    Szemerédi's Regularity Lemma is powerful tool in Graph Theory, yielding many applications in areas such as Extremal Graph Theory, Combinatorial Number Theory and Theoretical Computer Science. Strong hypergraph extensions of graph regularity techniques were recently given by Nagle, Rödl, Schacht and …

    usf Repository record for A Hypergraph Regularity Method for Linear Hypergraphs (opens in a new tab)