Skip to main content Accessibility help
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Algorithmics, Complexity, Computer Algebra, Computational Geometry
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

6974 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry

Page 53 of 349

  • 9 - Lines in R3

  • Adam Sheffer, Bernard M. Baruch College, City University of New York
  • Book:
    Polynomial Methods and Incidence Theory
    Published online:
    17 March 2022
    Print publication:
    24 March 2022, pp 125-141

  • Summary

    In Chapter 7 we studied the ESGK framework. This was a reduction from the distinct distances problem to a problem about pairs of intersecting lines in R^3. In the current chapter we further reduce the problem to bounding the number of rich points of lines in R^3. We solve this incidence problem with a more involved variant of the constant-degree polynomial partitioning technique. This completes the proof of the Guth–Katz distinct distances theorem.

    The original proof of Guth and Katz is quite involved. We study a simpler proof for a slightly weaker variant of the distinct distances theorem. This simpler proof was introduced by Guth and avoids the use of tools such as flat points and properties of ruled surfaces.

  • 12 - Incidence Applications in Rd

  • Adam Sheffer, Bernard M. Baruch College, City University of New York
  • Book:
    Polynomial Methods and Incidence Theory
    Published online:
    17 March 2022
    Print publication:
    24 March 2022, pp 172-181

  • Summary

    In Chapter 11 we derived general point-variety incidence bounds in R^d. We now study two applications of these bounds. These applications do not require reading any part of Chapter 11, except for the statement of Theorem 11.3. The first application comes from discrete geometry and is another distinct distances problem. Specifically, it is a distinct distances problem with local properties. The second application is a discrete Fourier restriction problem from harmonic analysis. For simplicity, we only discuss the combinatorial aspect of that problem. This aspect is the additive energy of points on a hypersphere.

Polynomial Methods and Incidence Theory
  • Adam Sheffer
  • Published online:
    17 March 2022
    Print publication:
    24 March 2022
  • The past decade has seen numerous major mathematical breakthroughs for topics such as the finite field Kakeya conjecture, the cap set conjecture, Erdős's distinct distances problem, the joints problem, as well as others, thanks to the introduction of new polynomial methods. There has also been significant progress on a variety of problems from additive combinatorics, discrete geometry, and more. This book gives a detailed yet accessible introduction to these new polynomial methods and their applications, with a focus on incidence theory. Based on the author's own teaching experience, the text requires a minimal background, allowing graduate and advanced undergraduate students to get to grips with an active and exciting research front. The techniques are presented gradually and in detail, with many examples, warm-up proofs, and exercises included. An appendix provides a quick reminder of basic results and ideas.

Page 53 of 349