Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Additive combinatorics). Showing records 1 – 27 of 27 total matches.

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of British Columbia

1. Hamel, Mariah. Arithmetic structures in random sets .

Degree: 2008, University of British Columbia

 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… (more)

Subjects/Keywords: Additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hamel, M. (2008). Arithmetic structures in random sets . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/2838

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hamel, Mariah. “Arithmetic structures in random sets .” 2008. Thesis, University of British Columbia. Accessed July 20, 2019. http://hdl.handle.net/2429/2838.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hamel, Mariah. “Arithmetic structures in random sets .” 2008. Web. 20 Jul 2019.

Vancouver:

Hamel M. Arithmetic structures in random sets . [Internet] [Thesis]. University of British Columbia; 2008. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/2429/2838.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hamel M. Arithmetic structures in random sets . [Thesis]. University of British Columbia; 2008. Available from: http://hdl.handle.net/2429/2838

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rutgers University

2. Nguyen, Hoi H., 1980-. Some applications of Freiman's inverse theorem.

Degree: PhD, Mathematics, 2010, Rutgers University

The celebrated Freiman's inverse theorem in Additive Combinatorics asserts that an additive set of small doubling constant must have additive structure. This thesis contains two… (more)

Subjects/Keywords: Additive combinatorics; Number theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nguyen, Hoi H., 1. (2010). Some applications of Freiman's inverse theorem. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053124

Chicago Manual of Style (16th Edition):

Nguyen, Hoi H., 1980-. “Some applications of Freiman's inverse theorem.” 2010. Doctoral Dissertation, Rutgers University. Accessed July 20, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053124.

MLA Handbook (7th Edition):

Nguyen, Hoi H., 1980-. “Some applications of Freiman's inverse theorem.” 2010. Web. 20 Jul 2019.

Vancouver:

Nguyen, Hoi H. 1. Some applications of Freiman's inverse theorem. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2019 Jul 20]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053124.

Council of Science Editors:

Nguyen, Hoi H. 1. Some applications of Freiman's inverse theorem. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053124


University of Waterloo

3. Nishizawa, Yui. A survey of Roth's Theorem on progressions of length three.

Degree: 2011, University of Waterloo

 For any finite set B and a subset A⊆B, we define the density of A in B to be the value α=|A|/|B|. Roth's famous theorem,… (more)

Subjects/Keywords: Mathematics; Number theory; Additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nishizawa, Y. (2011). A survey of Roth's Theorem on progressions of length three. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6406

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nishizawa, Yui. “A survey of Roth's Theorem on progressions of length three.” 2011. Thesis, University of Waterloo. Accessed July 20, 2019. http://hdl.handle.net/10012/6406.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nishizawa, Yui. “A survey of Roth's Theorem on progressions of length three.” 2011. Web. 20 Jul 2019.

Vancouver:

Nishizawa Y. A survey of Roth's Theorem on progressions of length three. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/10012/6406.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nishizawa Y. A survey of Roth's Theorem on progressions of length three. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6406

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Cambridge

4. Milicevic, Luka. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics .

Degree: 2018, University of Cambridge

 In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space (X,d), a… (more)

Subjects/Keywords: combinatorics; graph theory; extremal combinatorics; metric geometry; combinatorial geometry; additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Milicevic, L. (2018). Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/273375

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics .” 2018. Thesis, University of Cambridge. Accessed July 20, 2019. https://www.repository.cam.ac.uk/handle/1810/273375.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics .” 2018. Web. 20 Jul 2019.

Vancouver:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics . [Internet] [Thesis]. University of Cambridge; 2018. [cited 2019 Jul 20]. Available from: https://www.repository.cam.ac.uk/handle/1810/273375.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics . [Thesis]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/273375

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Rochester

5. Murphy, Brendan; Iosevich, Alex (1967 - ). Group actions in arithmetic combinatorics.

Degree: PhD, 2017, University of Rochester

 The subject of this dissertation is approximate group actions. This subject is a synthesis of arithmetic combinatorics, which is the study of subsets of commutative… (more)

Subjects/Keywords: Additive combinatorics; Approximate group theory; Combinatorics; Geometric combinatorics; Group action; Sum-product problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Murphy, Brendan; Iosevich, A. (. -. ). (2017). Group actions in arithmetic combinatorics. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/31885

Chicago Manual of Style (16th Edition):

Murphy, Brendan; Iosevich, Alex (1967 - ). “Group actions in arithmetic combinatorics.” 2017. Doctoral Dissertation, University of Rochester. Accessed July 20, 2019. http://hdl.handle.net/1802/31885.

MLA Handbook (7th Edition):

Murphy, Brendan; Iosevich, Alex (1967 - ). “Group actions in arithmetic combinatorics.” 2017. Web. 20 Jul 2019.

Vancouver:

Murphy, Brendan; Iosevich A(-). Group actions in arithmetic combinatorics. [Internet] [Doctoral dissertation]. University of Rochester; 2017. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1802/31885.

Council of Science Editors:

Murphy, Brendan; Iosevich A(-). Group actions in arithmetic combinatorics. [Doctoral Dissertation]. University of Rochester; 2017. Available from: http://hdl.handle.net/1802/31885


UCLA

6. Carolino, Pietro Kreitlon. The Structure of Locally Compact Approximate Groups.

Degree: Mathematics, 2015, UCLA

 A subset A of a locally compact group G is said to be a K-approximate group if it contains the identity, is closed under inverses,… (more)

Subjects/Keywords: Mathematics; additive combinatorics; approximate groups; gleason-yamabe; growth in groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Carolino, P. K. (2015). The Structure of Locally Compact Approximate Groups. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/8388n9jk

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Carolino, Pietro Kreitlon. “The Structure of Locally Compact Approximate Groups.” 2015. Thesis, UCLA. Accessed July 20, 2019. http://www.escholarship.org/uc/item/8388n9jk.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Carolino, Pietro Kreitlon. “The Structure of Locally Compact Approximate Groups.” 2015. Web. 20 Jul 2019.

Vancouver:

Carolino PK. The Structure of Locally Compact Approximate Groups. [Internet] [Thesis]. UCLA; 2015. [cited 2019 Jul 20]. Available from: http://www.escholarship.org/uc/item/8388n9jk.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Carolino PK. The Structure of Locally Compact Approximate Groups. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/8388n9jk

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

7. Makkuva, Ashok Vardhan. On equivalence of additive-combinatorial inequalities for Shannon entropy and differential entropy.

Degree: MS, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 Entropy inequalities are very important in information theory and they play a crucial role in various communication-theoretic problems, for example, in the study of the… (more)

Subjects/Keywords: Shannon entropy; Differential entropy; Information theory; Additive combinatorics; Entropy inequalities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Makkuva, A. V. (2017). On equivalence of additive-combinatorial inequalities for Shannon entropy and differential entropy. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97446

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Makkuva, Ashok Vardhan. “On equivalence of additive-combinatorial inequalities for Shannon entropy and differential entropy.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed July 20, 2019. http://hdl.handle.net/2142/97446.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Makkuva, Ashok Vardhan. “On equivalence of additive-combinatorial inequalities for Shannon entropy and differential entropy.” 2017. Web. 20 Jul 2019.

Vancouver:

Makkuva AV. On equivalence of additive-combinatorial inequalities for Shannon entropy and differential entropy. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/2142/97446.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Makkuva AV. On equivalence of additive-combinatorial inequalities for Shannon entropy and differential entropy. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97446

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Vilnius University

8. Šarka, Paulius. Retų aibių aritmetinės savybės.

Degree: Dissertation, Mathematics, 2013, Vilnius University

Disertacijoje nagrinėjamos aritmetinės prigimties aibių, tokių kaip sumų aibė, poaibių sumų aibė ar Sidon aibė, savybės bei aritmetinę struktūrą atspindintys dydžiai, tokie kaip adityvioji energija… (more)

Subjects/Keywords: Adityvioji kombinatorika; Sidon aibės; Adityvioji energija; Reprezentacinės funkcijos; Additive combinatorics; Sidon sets; Additive energy; Representation functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Šarka, Paulius. (2013). Retų aibių aritmetinės savybės. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160039-47489 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Šarka, Paulius. “Retų aibių aritmetinės savybės.” 2013. Doctoral Dissertation, Vilnius University. Accessed July 20, 2019. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160039-47489 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Šarka, Paulius. “Retų aibių aritmetinės savybės.” 2013. Web. 20 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Šarka, Paulius. Retų aibių aritmetinės savybės. [Internet] [Doctoral dissertation]. Vilnius University; 2013. [cited 2019 Jul 20]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160039-47489 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Šarka, Paulius. Retų aibių aritmetinės savybės. [Doctoral Dissertation]. Vilnius University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160039-47489 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Vilnius University

9. Šarka, Paulius. Retų aibių aritmetinės savybės.

Degree: PhD, Mathematics, 2013, Vilnius University

Disertacijoje nagrinėjamos aritmetinės prigimties aibių, tokių kaip sumų aibė, poaibių sumų aibė ar Sidon aibė, savybės bei aritmetinę struktūrą atspindintys dydžiai, tokie kaip adityvioji energija… (more)

Subjects/Keywords: Adityvioji kombinatorika; Sidon aibės; Adityvioji energija; Reprezentacinės funkcijos; Additive combinatorics; Sidon sets; Additive energy; Representation functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Šarka, Paulius. (2013). Retų aibių aritmetinės savybės. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160051-11263 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Šarka, Paulius. “Retų aibių aritmetinės savybės.” 2013. Doctoral Dissertation, Vilnius University. Accessed July 20, 2019. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160051-11263 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Šarka, Paulius. “Retų aibių aritmetinės savybės.” 2013. Web. 20 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Šarka, Paulius. Retų aibių aritmetinės savybės. [Internet] [Doctoral dissertation]. Vilnius University; 2013. [cited 2019 Jul 20]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160051-11263 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Šarka, Paulius. Retų aibių aritmetinės savybės. [Doctoral Dissertation]. Vilnius University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131015_160051-11263 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Georgia Tech

10. Hart, Derrick N. Finite Field Models of Roth's Theorem in One and Two Dimensions.

Degree: MS, Mathematics, 2006, Georgia Tech

 Recent work on many problems in additive combinatorics, such as Roth's Theorem, has shown the usefulness of first studying the problem in a finite field… (more)

Subjects/Keywords: Arithmetic progressions; Corners; Roth; Additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hart, D. N. (2006). Finite Field Models of Roth's Theorem in One and Two Dimensions. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/11516

Chicago Manual of Style (16th Edition):

Hart, Derrick N. “Finite Field Models of Roth's Theorem in One and Two Dimensions.” 2006. Masters Thesis, Georgia Tech. Accessed July 20, 2019. http://hdl.handle.net/1853/11516.

MLA Handbook (7th Edition):

Hart, Derrick N. “Finite Field Models of Roth's Theorem in One and Two Dimensions.” 2006. Web. 20 Jul 2019.

Vancouver:

Hart DN. Finite Field Models of Roth's Theorem in One and Two Dimensions. [Internet] [Masters thesis]. Georgia Tech; 2006. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1853/11516.

Council of Science Editors:

Hart DN. Finite Field Models of Roth's Theorem in One and Two Dimensions. [Masters Thesis]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/11516

11. Bush, Albert. Multifold sums and products over R, and combinatorial problems on sumsets.

Degree: PhD, Mathematics, 2015, Georgia Tech

 We prove a new bound on a version of the sum-product problem studied by Chang. By introducing several combinatorial tools, this expands upon a method… (more)

Subjects/Keywords: Additive combinatorics; Sum-product inequalities

…points and lines and additive combinatorics. Amirkhanyan et al [1] demonstrated – not… …Known Results The Pl¨ unnecke-Ruzsa inequality is ubiquitious in additive combinatorics and… …c, d ∈ A. The number of solutions to this equation is called the additive energy of a set… …additive energy is o(|A|3 ), it is easy to see that the sumset has substantial size |A… …A| = Ω(|A|). Conversely, one can have sets where the additive energy is Θ(… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bush, A. (2015). Multifold sums and products over R, and combinatorial problems on sumsets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53950

Chicago Manual of Style (16th Edition):

Bush, Albert. “Multifold sums and products over R, and combinatorial problems on sumsets.” 2015. Doctoral Dissertation, Georgia Tech. Accessed July 20, 2019. http://hdl.handle.net/1853/53950.

MLA Handbook (7th Edition):

Bush, Albert. “Multifold sums and products over R, and combinatorial problems on sumsets.” 2015. Web. 20 Jul 2019.

Vancouver:

Bush A. Multifold sums and products over R, and combinatorial problems on sumsets. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1853/53950.

Council of Science Editors:

Bush A. Multifold sums and products over R, and combinatorial problems on sumsets. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53950


University of Oxford

12. Walker, Aled. Topics in analytic and combinatorial number theory.

Degree: PhD, 2018, University of Oxford

 In this thesis we consider three different issues of analytic number theory. Firstly, we investigate how residues modulo q may be expressed as products of… (more)

Subjects/Keywords: 510; Mathematics; Analytic Number Theory; Diophantine inequalities; Additive Combinatorics; Metric poissonian property

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Walker, A. (2018). Topics in analytic and combinatorial number theory. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:0d48a697-fd7a-4aca-bebe-4806322bdbbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757796

Chicago Manual of Style (16th Edition):

Walker, Aled. “Topics in analytic and combinatorial number theory.” 2018. Doctoral Dissertation, University of Oxford. Accessed July 20, 2019. http://ora.ox.ac.uk/objects/uuid:0d48a697-fd7a-4aca-bebe-4806322bdbbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757796.

MLA Handbook (7th Edition):

Walker, Aled. “Topics in analytic and combinatorial number theory.” 2018. Web. 20 Jul 2019.

Vancouver:

Walker A. Topics in analytic and combinatorial number theory. [Internet] [Doctoral dissertation]. University of Oxford; 2018. [cited 2019 Jul 20]. Available from: http://ora.ox.ac.uk/objects/uuid:0d48a697-fd7a-4aca-bebe-4806322bdbbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757796.

Council of Science Editors:

Walker A. Topics in analytic and combinatorial number theory. [Doctoral Dissertation]. University of Oxford; 2018. Available from: http://ora.ox.ac.uk/objects/uuid:0d48a697-fd7a-4aca-bebe-4806322bdbbd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757796


Princeton University

13. Gopi, Sivakanth. Locality in coding theory .

Degree: PhD, 2018, Princeton University

 Error correcting codes have been extremely successful in practice to build storage and communication systems which are resilient to noise and corruptions. They also found… (more)

Subjects/Keywords: additive combinatorics; Coding theory; distributed storage; Locality; locally decodable codes; private information retrieval

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gopi, S. (2018). Locality in coding theory . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01ng451m268

Chicago Manual of Style (16th Edition):

Gopi, Sivakanth. “Locality in coding theory .” 2018. Doctoral Dissertation, Princeton University. Accessed July 20, 2019. http://arks.princeton.edu/ark:/88435/dsp01ng451m268.

MLA Handbook (7th Edition):

Gopi, Sivakanth. “Locality in coding theory .” 2018. Web. 20 Jul 2019.

Vancouver:

Gopi S. Locality in coding theory . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Jul 20]. Available from: http://arks.princeton.edu/ark:/88435/dsp01ng451m268.

Council of Science Editors:

Gopi S. Locality in coding theory . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp01ng451m268


University of Cambridge

14. Milicevic, Luka. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.

Degree: PhD, 2018, University of Cambridge

Subjects/Keywords: combinatorics; graph theory; extremal combinatorics; metric geometry; combinatorial geometry; additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Milicevic, L. (2018). Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/273375 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557

Chicago Manual of Style (16th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Doctoral Dissertation, University of Cambridge. Accessed July 20, 2019. https://www.repository.cam.ac.uk/handle/1810/273375 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557.

MLA Handbook (7th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Web. 20 Jul 2019.

Vancouver:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2019 Jul 20]. Available from: https://www.repository.cam.ac.uk/handle/1810/273375 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557.

Council of Science Editors:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/273375 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557

15. Pryby, Christopher Ian. Some results on sums and products.

Degree: PhD, Mathematics, 2014, Georgia Tech

 We demonstrate new results in additive combinatorics, including a proof of a conjecture by J. Solymosi: for every epsilon > 0, there exists delta >… (more)

Subjects/Keywords: Additive combinatorics; Incidence geometry; Sum-product inequality

…1 Two major objects of study in the field of additive combinatorics are the ratios |A+A… …additive combinatorics. Let G be a finite additive group. Define the Fourier transform of a… …additive group, [72] denotes the by σ[A], the doubling constant, and the… …useful measure of additive structure between two sets A, B ⊆ G is the Ruzsa distance d, defined… …relation between the doubling and difference constants [72]. 2 1.2 The Additive… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pryby, C. I. (2014). Some results on sums and products. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53090

Chicago Manual of Style (16th Edition):

Pryby, Christopher Ian. “Some results on sums and products.” 2014. Doctoral Dissertation, Georgia Tech. Accessed July 20, 2019. http://hdl.handle.net/1853/53090.

MLA Handbook (7th Edition):

Pryby, Christopher Ian. “Some results on sums and products.” 2014. Web. 20 Jul 2019.

Vancouver:

Pryby CI. Some results on sums and products. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1853/53090.

Council of Science Editors:

Pryby CI. Some results on sums and products. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/53090

16. F. Monopoli. SUMSETS AND CARRIES IN CYCLIC GROUPS.

Degree: 2015, Università degli Studi di Milano

 This thesis studies some direct and inverse problems concerning sumsets in cyclic groups, with applications to the study of carries. First of all we prove… (more)

Subjects/Keywords: Additive combinatorics; number theory; sumsets; Cauchy-Davenport inequality; carries; modular addition; Settore MAT/05 - Analisi Matematica

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Monopoli, F. (2015). SUMSETS AND CARRIES IN CYCLIC GROUPS. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/342841

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Monopoli, F.. “SUMSETS AND CARRIES IN CYCLIC GROUPS.” 2015. Thesis, Università degli Studi di Milano. Accessed July 20, 2019. http://hdl.handle.net/2434/342841.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Monopoli, F.. “SUMSETS AND CARRIES IN CYCLIC GROUPS.” 2015. Web. 20 Jul 2019.

Vancouver:

Monopoli F. SUMSETS AND CARRIES IN CYCLIC GROUPS. [Internet] [Thesis]. Università degli Studi di Milano; 2015. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/2434/342841.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Monopoli F. SUMSETS AND CARRIES IN CYCLIC GROUPS. [Thesis]. Università degli Studi di Milano; 2015. Available from: http://hdl.handle.net/2434/342841

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Montréal

17. Poirier, Antoine. Les progressions arithmétiques dans les nombres entiers .

Degree: 2012, Université de Montréal

 Le sujet de cette thèse est l'étude des progressions arithmétiques dans les nombres entiers. Plus précisément, nous nous intéressons à borner inférieurement v(N), la taille… (more)

Subjects/Keywords: Combinatoire additive; Progressions arithmétiques; Points de réseau; Points entiers contenu dans des sphères; Additive combinatorics; Arithmetic progressions; Lattice theory; Integer points in large spheres

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Poirier, A. (2012). Les progressions arithmétiques dans les nombres entiers . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/6931

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Poirier, Antoine. “Les progressions arithmétiques dans les nombres entiers .” 2012. Thesis, Université de Montréal. Accessed July 20, 2019. http://hdl.handle.net/1866/6931.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Poirier, Antoine. “Les progressions arithmétiques dans les nombres entiers .” 2012. Web. 20 Jul 2019.

Vancouver:

Poirier A. Les progressions arithmétiques dans les nombres entiers . [Internet] [Thesis]. Université de Montréal; 2012. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1866/6931.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Poirier A. Les progressions arithmétiques dans les nombres entiers . [Thesis]. Université de Montréal; 2012. Available from: http://hdl.handle.net/1866/6931

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Biswas, Arindam. Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications.

Degree: Docteur es, Mathématiques fondamentales, 2016, Paris Saclay

Dans la premier partie de cette thèse, nous étudions la structure des sous-groupes approximatifs dans les groupes metabéliens (groupes résolubles de classe de résolubilité 2)… (more)

Subjects/Keywords: Groupes approximatifs; Diamètre d'un groupe fini; Graphe de Cayley; Combinatoire additive; Boucles des moufang; Approximate groups; Diameter of finite groups; Cayley graph; Additive combinatorics; Moufang loops

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Biswas, A. (2016). Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications. (Doctoral Dissertation). Paris Saclay. Retrieved from http://www.theses.fr/2016SACLS573

Chicago Manual of Style (16th Edition):

Biswas, Arindam. “Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications.” 2016. Doctoral Dissertation, Paris Saclay. Accessed July 20, 2019. http://www.theses.fr/2016SACLS573.

MLA Handbook (7th Edition):

Biswas, Arindam. “Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications.” 2016. Web. 20 Jul 2019.

Vancouver:

Biswas A. Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications. [Internet] [Doctoral dissertation]. Paris Saclay; 2016. [cited 2019 Jul 20]. Available from: http://www.theses.fr/2016SACLS573.

Council of Science Editors:

Biswas A. Théorie des groupes approximatifs et ses applications : Theory of approximate groups and its applications. [Doctoral Dissertation]. Paris Saclay; 2016. Available from: http://www.theses.fr/2016SACLS573

19. Dellamonica Junior, Domingos. Extração de aleatoriedade a partir de fontes defeituosas.

Degree: Mestrado, Ciência da Computação, 2007, University of São Paulo

Recentemente, Barak et al. (2004) exibiram construções de extratores e dispersores determinísticos (funções computáveis em tempo polinomial) com parâmetros melhores do que era anteriormente possível.… (more)

Subjects/Keywords: additive number theory; aleatoriedade; algorithms; algoritmos; combinatória; combinatorics; complexidade computacional; computational complexity; desaleatorização; dispersers; extractors; pseudoaleatoriedade; pseudorandomness; randomness; teoria aditiva dos números

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dellamonica Junior, D. (2007). Extração de aleatoriedade a partir de fontes defeituosas. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/ ;

Chicago Manual of Style (16th Edition):

Dellamonica Junior, Domingos. “Extração de aleatoriedade a partir de fontes defeituosas.” 2007. Masters Thesis, University of São Paulo. Accessed July 20, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/ ;.

MLA Handbook (7th Edition):

Dellamonica Junior, Domingos. “Extração de aleatoriedade a partir de fontes defeituosas.” 2007. Web. 20 Jul 2019.

Vancouver:

Dellamonica Junior D. Extração de aleatoriedade a partir de fontes defeituosas. [Internet] [Masters thesis]. University of São Paulo; 2007. [cited 2019 Jul 20]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/ ;.

Council of Science Editors:

Dellamonica Junior D. Extração de aleatoriedade a partir de fontes defeituosas. [Masters Thesis]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/ ;

20. Borenstein, Evan. Additive stucture, rich lines, and exponential set-expansion.

Degree: PhD, Mathematics, 2009, Georgia Tech

 We will survey some of the major directions of research in arithmetic combinatorics and their connections to other fields. We will then discuss three new… (more)

Subjects/Keywords: Arithmetic combinatorics; Additive combinatorics; Combinatorics; Incidence geometry; Sum-product inequalities; Structural theorems; Combinatorial analysis; Combinatorial geometry; Set functions

additive combinatorics. It began with a paper by Balog and Szemer´ edi [1], and then… …additive sets in an ambient abelian group and |A + B| ≤ K|B|, then for any positive integer k, we… …have |kA − mA| ≤ K k+m |B|. One way to measure the additive structure between two sets A and… …B is to count the the number of additive quadruples (a, a , b, b ) ∈ A2 × B 2… …a + b = a + b . We call the total number of additive quadruples the additive energy… 

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Borenstein, E. (2009). Additive stucture, rich lines, and exponential set-expansion. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29664

Chicago Manual of Style (16th Edition):

Borenstein, Evan. “Additive stucture, rich lines, and exponential set-expansion.” 2009. Doctoral Dissertation, Georgia Tech. Accessed July 20, 2019. http://hdl.handle.net/1853/29664.

MLA Handbook (7th Edition):

Borenstein, Evan. “Additive stucture, rich lines, and exponential set-expansion.” 2009. Web. 20 Jul 2019.

Vancouver:

Borenstein E. Additive stucture, rich lines, and exponential set-expansion. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1853/29664.

Council of Science Editors:

Borenstein E. Additive stucture, rich lines, and exponential set-expansion. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29664


Université de Montréal

21. Henriot, Kevin. Structures linéaires dans les ensembles à faible densité .

Degree: 2014, Université de Montréal

 Nous présentons trois résultats en combinatoire additive, un domaine récent à la croisée de la combinatoire, l'analyse harmonique et la théorie analytique des nombres. Le… (more)

Subjects/Keywords: combinatoire additive; progressions arithmétiques; ensembles somme; théorème de Freiman-Ruzsa; théorème de Roth; théorème de Green-Tao; équations linéaires dans les nombres premiers; additive combinatorics; arithmetic progressions in sumsets; Freiman-Ruzsa theorem; Roth's theorem; Green-Tao theorem; linear equations in primes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Henriot, K. (2014). Structures linéaires dans les ensembles à faible densité . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/11116

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Henriot, Kevin. “Structures linéaires dans les ensembles à faible densité .” 2014. Thesis, Université de Montréal. Accessed July 20, 2019. http://hdl.handle.net/1866/11116.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Henriot, Kevin. “Structures linéaires dans les ensembles à faible densité .” 2014. Web. 20 Jul 2019.

Vancouver:

Henriot K. Structures linéaires dans les ensembles à faible densité . [Internet] [Thesis]. Université de Montréal; 2014. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1866/11116.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Henriot K. Structures linéaires dans les ensembles à faible densité . [Thesis]. Université de Montréal; 2014. Available from: http://hdl.handle.net/1866/11116

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Amirkhanyan, Gagik M. Problems in combinatorial number theory.

Degree: PhD, Mathematics, 2014, Georgia Tech

 The dissertation consists of two parts. The first part is devoted to results in Discrepancy Theory. We consider geometric discrepancy in higher dimensions (d >… (more)

Subjects/Keywords: Geometric discrepancy; Additive energy, Freiman isomorphism; Combinatorial number theory; Irregularities of distribution (Number theory); Additive combinatorics

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Amirkhanyan, G. M. (2014). Problems in combinatorial number theory. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51865

Chicago Manual of Style (16th Edition):

Amirkhanyan, Gagik M. “Problems in combinatorial number theory.” 2014. Doctoral Dissertation, Georgia Tech. Accessed July 20, 2019. http://hdl.handle.net/1853/51865.

MLA Handbook (7th Edition):

Amirkhanyan, Gagik M. “Problems in combinatorial number theory.” 2014. Web. 20 Jul 2019.

Vancouver:

Amirkhanyan GM. Problems in combinatorial number theory. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Jul 20]. Available from: http://hdl.handle.net/1853/51865.

Council of Science Editors:

Amirkhanyan GM. Problems in combinatorial number theory. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51865

23. Tringali, Salvatore. Some questions in combinatorial and elementary number theory : Quelques questions de théories combinatoire et élémentaire des nombres.

Degree: Docteur es, Mathématiques pures, 2013, Saint-Etienne

Cette thèse est divisée en deux parties : la partie I traite de combinatoire additive, la partie II s’est portée sur des questions de théorie… (more)

Subjects/Keywords: Combinatoire additive; Théorie des nombres élémentaire et combinatoire; Théorèmes de type Cauchy-Davenport; Théorie de Freiman des sommes d'ensembles; Théorie du groupe additif et du semi-groupe; Sommes d'ensembles de Minkowski; Groupes ordonnés; Congruences cycliques; Additive combinatorics; Elementary and combinatorial number theory; Cauchy-Davenport type theorems; Freiman's theory of set addition; Additive group and semigroup theory; Minkowski sumsets; Ordered groups; Cyclic congruences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tringali, S. (2013). Some questions in combinatorial and elementary number theory : Quelques questions de théories combinatoire et élémentaire des nombres. (Doctoral Dissertation). Saint-Etienne. Retrieved from http://www.theses.fr/2013STET4021

Chicago Manual of Style (16th Edition):

Tringali, Salvatore. “Some questions in combinatorial and elementary number theory : Quelques questions de théories combinatoire et élémentaire des nombres.” 2013. Doctoral Dissertation, Saint-Etienne. Accessed July 20, 2019. http://www.theses.fr/2013STET4021.

MLA Handbook (7th Edition):

Tringali, Salvatore. “Some questions in combinatorial and elementary number theory : Quelques questions de théories combinatoire et élémentaire des nombres.” 2013. Web. 20 Jul 2019.

Vancouver:

Tringali S. Some questions in combinatorial and elementary number theory : Quelques questions de théories combinatoire et élémentaire des nombres. [Internet] [Doctoral dissertation]. Saint-Etienne; 2013. [cited 2019 Jul 20]. Available from: http://www.theses.fr/2013STET4021.

Council of Science Editors:

Tringali S. Some questions in combinatorial and elementary number theory : Quelques questions de théories combinatoire et élémentaire des nombres. [Doctoral Dissertation]. Saint-Etienne; 2013. Available from: http://www.theses.fr/2013STET4021

24. Rice, Alex Joseph. Improvements and extensions of two theorems of Sarkozy.

Degree: PhD, Mathematics, 2012, University of Georgia

 We explore quantitative improvements and extensions of two theorems of Sarkozy, the qualitative versions of which state that any set of natural numbers of positive… (more)

Subjects/Keywords: Arithmetic Combinatorics; Additive Combinatorics; Discrete Fourier Analysis; Hardy-Littlewood Circle Method; Sarkozy's Theorem; Intersective Polynomials; P-intersective Polynomials

…of the field of arithmetic combinatorics to determine which structures sets of positive… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rice, A. J. (2012). Improvements and extensions of two theorems of Sarkozy. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/rice_alex_j_201208_phd

Chicago Manual of Style (16th Edition):

Rice, Alex Joseph. “Improvements and extensions of two theorems of Sarkozy.” 2012. Doctoral Dissertation, University of Georgia. Accessed July 20, 2019. http://purl.galileo.usg.edu/uga_etd/rice_alex_j_201208_phd.

MLA Handbook (7th Edition):

Rice, Alex Joseph. “Improvements and extensions of two theorems of Sarkozy.” 2012. Web. 20 Jul 2019.

Vancouver:

Rice AJ. Improvements and extensions of two theorems of Sarkozy. [Internet] [Doctoral dissertation]. University of Georgia; 2012. [cited 2019 Jul 20]. Available from: http://purl.galileo.usg.edu/uga_etd/rice_alex_j_201208_phd.

Council of Science Editors:

Rice AJ. Improvements and extensions of two theorems of Sarkozy. [Doctoral Dissertation]. University of Georgia; 2012. Available from: http://purl.galileo.usg.edu/uga_etd/rice_alex_j_201208_phd


University of Cambridge

25. Sanders, Tom. Topics in arithmetic combinatorics.

Degree: PhD, 2007, University of Cambridge

 This thesis is chiefly concerned with a classical conjecture of Littlewood's regarding the L¹-norm of the Fourier transform, and the closely related idem-potent theorem. The… (more)

Subjects/Keywords: 530.1; Fourier analysis; Freiman's theorem; Chang's theorem; Additive combinatorics; Littlewood's conjecture; Arithmetic combinatorics; Bourgain systems; Idempotent theorem; Local Fourier analysis; Induction on doubling; Discrete analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sanders, T. (2007). Topics in arithmetic combinatorics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/236994 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541878

Chicago Manual of Style (16th Edition):

Sanders, Tom. “Topics in arithmetic combinatorics.” 2007. Doctoral Dissertation, University of Cambridge. Accessed July 20, 2019. https://www.repository.cam.ac.uk/handle/1810/236994 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541878.

MLA Handbook (7th Edition):

Sanders, Tom. “Topics in arithmetic combinatorics.” 2007. Web. 20 Jul 2019.

Vancouver:

Sanders T. Topics in arithmetic combinatorics. [Internet] [Doctoral dissertation]. University of Cambridge; 2007. [cited 2019 Jul 20]. Available from: https://www.repository.cam.ac.uk/handle/1810/236994 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541878.

Council of Science Editors:

Sanders T. Topics in arithmetic combinatorics. [Doctoral Dissertation]. University of Cambridge; 2007. Available from: https://www.repository.cam.ac.uk/handle/1810/236994 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541878


University of Cambridge

26. Sanders, Tom. Topics in arithmetic combinatorics .

Degree: 2007, University of Cambridge

 This thesis is chiefly concerned with a classical conjecture of Littlewood's regarding the L1-norm of the Fourier transform, and the closely related idempotent theorem. The… (more)

Subjects/Keywords: Fourier analysis; Freiman's theorem; Chang's theorem; Additive combinatorics; Littlewood's conjecture; Arithmetic combinatorics; Bourgain systems; Idempotent theorem; Local Fourier analysis; Induction on doubling; Discrete analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sanders, T. (2007). Topics in arithmetic combinatorics . (Thesis). University of Cambridge. Retrieved from http://www.dspace.cam.ac.uk/handle/1810/236994

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sanders, Tom. “Topics in arithmetic combinatorics .” 2007. Thesis, University of Cambridge. Accessed July 20, 2019. http://www.dspace.cam.ac.uk/handle/1810/236994.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sanders, Tom. “Topics in arithmetic combinatorics .” 2007. Web. 20 Jul 2019.

Vancouver:

Sanders T. Topics in arithmetic combinatorics . [Internet] [Thesis]. University of Cambridge; 2007. [cited 2019 Jul 20]. Available from: http://www.dspace.cam.ac.uk/handle/1810/236994.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sanders T. Topics in arithmetic combinatorics . [Thesis]. University of Cambridge; 2007. Available from: http://www.dspace.cam.ac.uk/handle/1810/236994

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Tait, Michael. Connections between graph theory, additive combinatorics, and finite incidence geometry.

Degree: Mathematics, 2016, University of California – San Diego

 This thesis studies problems in extremal graph theory, combinatorial number theory, and finite incidence geometry, and the interplay between these three areas. The first topic… (more)

Subjects/Keywords: Mathematics; Additive Combinatorics; Extremal Graph Theory; Polarity Graphs; Projective Plane; Sidon Set; Sum-Product Estimate

…Connections between graph theory, additive combinatorics, and finite incidence geometry by Michael… …theory, additive combinatorics, and finite incidence geometry. Questions in extremal graph… …in a C4 -free graph, we branch into the field of additive combinatorics. This field, also… …number for the 4-cycle, Australasian Journal of Combinatorics, 63(1), (2015)… …of the Erdős-Rényi orthogonal polarity graph”, Electronic Journal of Combinatorics, P2.21… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tait, M. (2016). Connections between graph theory, additive combinatorics, and finite incidence geometry. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/65v3m58c

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tait, Michael. “Connections between graph theory, additive combinatorics, and finite incidence geometry.” 2016. Thesis, University of California – San Diego. Accessed July 20, 2019. http://www.escholarship.org/uc/item/65v3m58c.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tait, Michael. “Connections between graph theory, additive combinatorics, and finite incidence geometry.” 2016. Web. 20 Jul 2019.

Vancouver:

Tait M. Connections between graph theory, additive combinatorics, and finite incidence geometry. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2019 Jul 20]. Available from: http://www.escholarship.org/uc/item/65v3m58c.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tait M. Connections between graph theory, additive combinatorics, and finite incidence geometry. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/65v3m58c

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.