• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Some results on sums and products

Pryby, Christopher Ian 12 January 2015 (has links)
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} points of the grid, then |L| < n^epsilon. This result implies a conjecture of Gy. Elekes regarding a uniform statistical version of Freiman's theorem for linear functions with small image sets.
2

Additive stucture, rich lines, and exponential set-expansion

Borenstein, Evan 19 May 2009 (has links)
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 results. The first result will generalize a structural theorem from Balog and Szemerédi. The second result will establish a new tool in incidence geometry, which should prove useful in attacking combinatorial estimates. The third result evolved from the famous sum-product problem, by providing a partial categorization of bivariate polynomial set functions which induce exponential expansion on all finite sets of real numbers.

Page generated in 0.0645 seconds