Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

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
×

1 results

  • 8 - Constant-Degree Polynomial Partitioning and Incidences in C2

  • 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 108-124

  • Summary

    It is usually easier to study problems over the complex than over the reals. Discrete geometry problems are an exception, often being significantly simpler over the reals. While there are several simple proofs of the Szemerédi–Trotter theorem over the reals, we only have rather involved proofs for the complex variant of the theorem. To avoid such involved proofs, we prove a slightly weaker variant of the complex Szemerédi–Trotter theorem. Our analysis is based on thinking of C^2 as R^4.

    In Chapter 7, we began to prove the distinct distances theorem by studying the ESGK framework. We complete this proof in Chapter 9, by relying on the constant-degree polynomial partitioning technique. In the current chapter we introduce this technique by studying incidences with lines in the complex plane. This is a warm-up towards Chapter 9, where we use constant-degree polynomial partitioning in more involved ways.