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 14 of 14 for “"Sumset"”.

  1. Additive structure in convex sets and related topics

    … within additive combinatorics is proving sumset and energy bounds for convex sets and images of structured sets under convex functions. For both types of problems, we extend existing techniques and pioneer new ones for longer sums and functions with higher convexity. <br/>The results and …

    bristol Repository record for Additive structure in convex sets and related topics (opens in a new tab) Download PDF for Additive structure in convex sets and related topics (opens in a new tab)

  2. Arithmetic structures in random sets

    … of Green on long arithmetic progressions in sumsets to dense subsets of random sets with asymptotic density 0. Our proofs require a transference argument due to Green and Green-Tao which enables us to apply known results for sets of positive upper density to subsets of random sets which have …

    ubc Repository record for Arithmetic structures in random sets (opens in a new tab) Download PDF for Arithmetic structures in random sets (opens in a new tab)

  3. Topics in arithmetic combinatorics

    … In Chapter 3, we establish the restricted sumset analogue of a celebrated conjecture of Sárközy on additive decompositions of the set of nonzero squares over a finite field. More precisely, we show that if q > 13 is an odd prime power, then the set of nonzero squares in F𝘲 cannot be written …

    ubc Repository record for Topics in arithmetic combinatorics (opens in a new tab) Download PDF for Topics in arithmetic combinatorics (opens in a new tab)

  4. Structure and arithmetic in sets

    … bounds on the density in the integers of the sumset of a positive relative density subset of the primes. The proof of this result uses Green and Green-Tao pseudorandomness arguments to reduce the problem to an analogous statement for relatively dense subsets of the multiplicative subgroup of …

    ubc Repository record for Structure and arithmetic in sets (opens in a new tab) Download PDF for Structure and arithmetic in sets (opens in a new tab)

  5. Infinitely Often Dense Bases and Geometric Structure of Sumsets

    We'll discuss two problems related to sumsets. Nathanson constructed bases of integers with prescribed representation functions, then asked how dense bases for integers can be in such cases. Let A(-x, x) be the number of elements of A whose absolute value is less than or equal to x, then it's easy …

    cuny-grad Repository record for Infinitely Often Dense Bases and Geometric Structure of Sumsets (opens in a new tab)

  6. On some distribution problems in Analytic Number Theory

    … Number Theory. Our interest here is in certain sumsets of Farey fractions. Also, in this dissertation we study Farey fractions by working in the quotient group Q/Z, which is the modern point of view. We first derive an identity which involves the structure of Farey fractions in the group ring of …

    texas Repository record for On some distribution problems in Analytic Number Theory (opens in a new tab)

  7. Some results in set addition

    … theorem of Green and Morris. We prove that if a sumset of a random subset of the set of natural numbers misses at least <em>k</em> elements of &Nopf;, with positive probability it means that in fact among those elements we can find all of 1; 2;...,<em>k</em>.</p>

    oxford Repository record for Some results in set addition (opens in a new tab)

  8. Improving averages over the prime numbers and Goldbach's conjecture

    … density exceeding $(k+1)/2$, then their $k$-fold sumset also forms an additive basis.

    gatech Repository record for Improving averages over the prime numbers and Goldbach's conjecture (opens in a new tab)

  9. New results in extremal combinatorics

    … estimate concerns the larger size of the sumset and productset in terms of the size of the set itself. In Chapter 4 we prove an estimate with exponent 4/3 for the ring of quaternions and a certain family of well-conditioned matrices, using the boundedness of the kissing numbers.

    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)

  10. Entropy in data compression, additive combinatorics and probability

    … these inequalities lie in the interface between sumset inequalities forentropy and the central limit theorem.

    greece Repository record for Entropy in data compression, additive combinatorics and probability (opens in a new tab)

  11. Extractors for Additive Structures and Space-bounded Computation

    Randomness is a powerful resource in computer science, with rich applications in algorithm design, cryptography, distributed computing, etc. Most of the applications assume access to a sequence of uniform and independent random bits. However, the randomness we collect from nature (e.g., activity of …

    cornell Repository record for Extractors for Additive Structures and Space-bounded Computation (opens in a new tab)

  12. SUMSETS AND CARRIES IN CYCLIC GROUPS

    … some direct and inverse problems concerning sumsets in cyclic groups, with applications to the study of carries. First of all we prove a generalization of the classical Cauchy-Davenport inequality in finite cyclic groups, thus bounding the cardinality of sumsets of sets satisfying certain …

    milano Repository record for SUMSETS AND CARRIES IN CYCLIC GROUPS (opens in a new tab)

  13. Zastosowania metod kombinatoryki addytywnej do wybranych zagadnień multiplikatywnych

    Głównym celem pracy jest badanie różnych sposobów, w jakie kombinatoryka addytywna może być wykorzystana do radzenia sobie z pewnymi zagadnieniami pojawiającymi się w multiplikatywnej teorii liczb. Najważniejsza część pracy dotyczy następującego problemu: dla pewnej liczby naturalnej n i pewnej …

    amu-pl Repository record for Zastosowania metod kombinatoryki addytywnej do wybranych zagadnień multiplikatywnych (opens in a new tab)

  14. Wybrane zagadnienia addytywne kombinatorycznej teorii liczb

    Praca ma na celu przedstawienie kilku wyników dotyczących zagadnień addytywnych kombinatorycznej teorii liczb. Każdy z rozdziałów dotyczy innej tematyki. Rozdział pierwszy zawiera wykaz stosowanych oznaczeń oraz definicje. W rozdziale drugim omawiane są pewne własności minimalnych baz …

    amu-pl Repository record for Wybrane zagadnienia addytywne kombinatorycznej teorii liczb (opens in a new tab)