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 4 of 4 for “"Counting lemma"”.

  1. Almost elusive permutation groups

    … points on Ω. As an easy consequence of the orbit counting lemma, <i>G</i> always contains such an element. In fact, by a theorem of Fein, Kantor and Schacher, <i>G</i> contains a derangement of prime power order. However, there do exist groups with no derangements of prime order; we call such …

    bristol Repository record for Almost elusive permutation groups (opens in a new tab) Download PDF for Almost elusive permutation groups (opens in a new tab)

  2. Topics in and around higher-order Fourier analysis

    … <p>Green and Tao’s arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the ‘flag condition’. In Chapter 4 we give an arithmetic regularity lemma and counting lemma which applies to all systems of …

    oxford Repository record for Topics in and around higher-order Fourier analysis (opens in a new tab)

  3. Analytic properties of sparse graphs and hypergraphs

    … of weighted 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)

  4. 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)