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 20 of 45 for “"Additive combinatorics"”.
-
Additive Combinatorics
… of the Eventown theorem through the lens of additive combinatorics.
-
Topics in additive combinatorics
… a number of results in both pure and applied additive combinatorics.
-
Topics in additive combinatorics
<p>This thesis deals with four problems in additive combinatorics. After giving a brief introduction to the field and overview of the results in Chapter 1, in Chapter 2 we consider the problem of finding the clique number of the Cayley graph on 𝔽<sub>2</sub><sup>n</sup> generated by a random …
-
Three problems in additive combinatorics
… thesis involve several fundamental objects in additive combinatorics. In this project, we mainly focus on the structure of subsets of integers. As integers are the most fundamental objects in number theory, one of our main interests in this project is to understand additive combinatorial …
-
Exponential sums and additive combinatorics
In this thesis we provide new results in additive combinatorics which in turn lead us to new bounds of certain exponential sums. We also use known bounds on exponential and character sums to give new results in additive combinatorics. Specifically we will see how bounds on some quantities from …
-
Syzygies, regularity, and their interplay with additive combinatorics
… interactions between commutative algebra and additive combinatorics. Based on recent works by Eliahou and Mazumdar, Elias, and Colarte-Gómez, Elias and Miró-Roig, we associate with each finite set A ⊂ ℕᵈ a projective toric variety X⊂ ℙₖⁿ, where k is an infinite field and n = |A|-1. We focus on …
-
Quadratic phenomena in additive combinatorics and number theory
… some standard results in number theory and additive combinatorics.</p> <p>In Chapter 3 we look at partition regularity of equations of the form x<sup>a</sup> + y<sup>b</sup> = z<sup>c</sup> over Z/pZ. In particular we look at the equation x+y= z<sup>2</sup>.</p> <p>In Chapter 4 we prove that …
-
On certain problems in extremal and additive combinatorics
This thesis consists of five chapters. The first chapter serves as an introduction, presenting the four problems studied in this thesis, and the results obtained. Each subsequent chapter then treats a separate problem. The second chapter is about the existence of partial isomorphisms (i.e. …
-
Entropy in data compression, additive combinatorics and probability
This thesis has four parts:In the first part, the problem of lossless data compression with side information availableto both the encoder and the decoder is considered. The finite-blocklength fundamental limitsof the best achievable performance are defined, in two different versions of the …
-
Topics In Analytic And Combinatorial Number Theory
… and independently) in analytic number theory and additive combinatorics. In analytic number theory, I study certain continuous and discrete mean value estimates for the Z-function associated to a Dirichlet L-functions. These problems lead naturally to an investigation of certain Gauss type sums …
-
Additive structure in convex sets and related topics
… predominantly discusses a handful of problems in additive combinatorics and incidence geometry. <br/>Our particular interest 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 …
-
Variations on the problems of Erdős-Turán and Littlewood-Offord /
This thesis is focused of two problems - one in additive combinatorics and one in combinatorial probability. The first problem is a polynomial version of the famous Erdős-Turán problem concerning the growth of the representation function of additive bases of integers. The second problem is a …
-
Variations on the problems of Erdős-Turán and Littlewood-Offord /
This thesis is focused of two problems - one in additive combinatorics and one in combinatorial probability. The first problem is a polynomial version of the famous Erdős-Turán problem concerning the growth of the representation function of additive bases of integers. The second problem is a …
-
Some results on sums and products
We demonstrate new results in additive combinatorics, including a proof of a conjecture by J. Solymosi: for every epsilon > 0, there exists delta > 0 such that, given n² points in a grid formation in R², if L is a set of lines in general position such that each line intersects at least n^{1-delta} …
-
On the clique number of Paley graphs and generalized Paley graphs
… Paley graphs is an old and open problem in additive combinatorics. In this thesis, we use polynomial methods, together with various tools from number theory, graph theory, and combinatorics, to study this problem. Specifically, we obtain improved upper bounds on the clique number of Paley …
-
Arithmetic structures in random sets
We prove various results in additive combinatorics for subsets of random sets. In particular we extend Sarkozy's theorem and a theorem 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 …
-
Problems in combinatorial number theory
… part of the thesis is devoted to results in Additive Combinatorics. For a set with small doubling an order-preserving Freiman 2-isomorphism is constructed which maps the set to a dense subset of an interval. We also present several applications.
-
Sum-free sets and arithmetic notions of structure in combinatorics
This thesis is concerned with four problems in additive combinatorics, each of which studies a certain notion of arithmetic structure and which properties of a general additive set, such as its density or the structure of the group in which it is contained, imply that it necessarily exhibits such …
-
Incidence Geometry in the Plane and Applications to Arithmetic Combinatorics
… study the applications of incidence geometry to additive combinatorics, with a particular focus of the setting of the prime residue field. <br/><br/>We begin by introducing some context to incidence geometry and its role in combinatorics. In Chapters 4 and 5, we prove a new incidence bound …
-
Geometric and arithmetic structure in finite point sets
… a handful of problems in the related fields of additive combinatorics and discrete geometry. Following the prerequisite background presented in Chapters 2 and 3, the following results are given.<br/><br/>In Chapter 4, we prove that if a finite set of points in the real plane determines, up to …
Page 1 of 3