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
×
Hostname: page-component-6d856f89d9-76ns8 Total loading time: 0 Render date: 2024-07-16T08:54:29.210Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  17 March 2022

Adam Sheffer
Adam Sheffer
Affiliation:
Bernard M. Baruch College, City University of New York
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Polynomial Methods and Incidence Theory , pp. 232 - 239
Publisher: Cambridge University Press
Print publication year: 2022

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ajtai, Miklós, Chvátal, Vašek, Newborn, Monroe M., and Szemerédi, Endre. 1982. Crossing-free subgraphs. Annals of Discrete Mathematics, 12, 9–12.Google Scholar
Alon, Noga. 1999. Combinatorial nullstellensatz. Combinatorics, Probability and Computing, 8(1–2), 7–29.Google Scholar
Alon, Noga, and Spencer, Joel H. 2004. The Probabilistic Method. John Wiley & Sons.Google Scholar
Apfelbaum, Roel, and Sharir, Micha. 2007. Large complete bipartite subgraphs in incidence graphs of points and hyperplanes. SIAM Journal on Discrete Mathematics, 21(3), 707–725.CrossRefGoogle Scholar
Atiyah, Michael. 2005. Michael Atiyah Collected Works. Vol. 6. Oxford University Press.Google Scholar
Bardwell-Evans, Sam, and Sheffer, Adam. 2019. A reduction for the distinct distances problem in Rd. Journal of Combinatorial Theory, Series A, 166, 171–225.CrossRefGoogle Scholar
Barone, Sal, and Basu, Saugata. 2012. Refined bounds on the number of connected components of sign conditions on a variety. Discrete & Computational Geometry, 47(3), 577–597.Google Scholar
Basu, Saugata, and Raz, Orit E. 2018. An o-minimal Szemerédi–Trotter theorem. The Quarterly Journal of Mathematics, 69(1), 223–239.CrossRefGoogle Scholar
Basu, Saugata, and Sombra, Martin. 2016. Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions. Discrete & Computational Geometry, 55(1), 158–184.CrossRefGoogle Scholar
Bateman, Michael, and Katz, Nets. 2012. New bounds on cap sets. Journal of the American Mathematical Society, 25(2), 585–613.Google Scholar
Beck, József. 1983. On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry. Combinatorica, 3(3–4), 281–297.Google Scholar
Behrend, Felix A. 1946. On sets of integers which contain no three terms in arithmetical progression. Proceedings of the National Academy of Sciences of the United States of America, 32(12), 331.Google Scholar
Berndt, Bruce C., and Rankin, Robert Alexander. 1995. Ramanujan. Letters and commentary. American Mathematical Society.Google Scholar
Bochnak, Jacek, Coste, Michel, and Roy, Marie-Françoise. 2013. Real algebraic geometry. Vol. 36 of A Series of Modern Surveys inMathematics. Springer Science & Business Media.Google Scholar
Bombieri, Enrico, and Pila, Jonathan. 1989. The number of integral points on arcs and ovals. Duke Mathematical Journal, 59(2), 337–357.Google Scholar
Bóna, Miklós. 2006. A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory. World Scientific.CrossRefGoogle Scholar
Bourgain, Jean, and Demeter, Ciprian. 2015. New bounds for the discrete Fourier restriction to the sphere in 4D and 5D. International Mathematics Research Notices, 2015(11), 3150–3184.Google Scholar
Boyer, Carl B. 1949. The invention of analytic geometry. Scientific American, 180(1), 40–45.Google Scholar
Braß, Peter, and Knauer, Christian. 2003. On counting point-hyperplane incidences. Computational Geometry, 25(1–2), 13–20.Google Scholar
Breuillard, Emmanuel, Green, Ben, and Tao, Terence. 2011. Approximate subgroups of linear groups. Geometric and Functional Analysis, 21(4), 774.Google Scholar
Bruner, Ariel, and Sharir, Micha. 2018. Distinct distances between a collinear set and an arbitrary set of points. Discrete Mathematics, 341(1), 261–265.CrossRefGoogle Scholar
Carbery, Anthony, and Iliopoulou, Marina. 2020. Joints formed by lines and a k-plane, and a discrete estimate of Kakeya type. Discrete Analysis, 18361.Google Scholar
Charalambides, Marcos. 2013. A note on distinct distance subsets. Journal of Geometry, 104(3), 439–442.CrossRefGoogle Scholar
Chazelle, Bernard, Edelsbrunner, Herbert, Guibas, Leonidas J., et al. 1992. Counting and cutting cycles of lines and rods in space. Computational Geometry, 1(6), 305–323.Google Scholar
Chernikov, Artem, Galvin, David, and Starchenko, Sergei. 2020. Cutting lemma and Zarankiewicz’s problem in distal structures. Selecta Mathematica, 26(2), 1–27.CrossRefGoogle Scholar
Clarkson, Kenneth L., Edelsbrunner, Herbert, Guibas, Leonidas J., Sharir, Micha, and Welzl, Emo. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry, 5(2), 99–160.CrossRefGoogle Scholar
Cox, David, Little, John, and O’Shea, Donal. 2013. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer Science & Business Media.Google Scholar
Croot, Ernie, Lev, Vsevolod F., and Pach, Péter Pál. 2017. Progression-free sets in are exponentially small. Annals of Mathematics, 185, 331–337.Google Scholar
Demeter, Ciprian. 2014. Incidence theory and restriction estimates. arXiv preprint arXiv:1401.1873.Google Scholar
Demeter, Ciprian. 2020. Fourier Restriction, Decoupling and Applications. Vol. 184 of Cambridge Studies in Advanced Mathematics. Cambridge University Press.Google Scholar
Dhar, Manik, and Dvir, Zeev. 2020. Proof of the Kakeya set conjecture over rings of integers modulo square-free N. arXiv preprint arXiv:2011.11225.CrossRefGoogle Scholar
Di Benedetto, Daniel, Solymosi, Jozsef, and White, Ethan. 2020. Combinatorics of intervals in the plane I: trapezoids. arXiv preprint arXiv:2005.09003.Google Scholar
Do, Thao. 2019. Representation complexities of semialgebraic graphs. SIAM Journal on Discrete Mathematics, 33(4), 1864–1877.Google Scholar
Do, Thao, and Sheffer, Adam. 2021. A general incidence bound in Rd . European Journal of Combinatorics, 95, 103330.CrossRefGoogle Scholar
Dvir, Zeev. 2009. On the size of Kakeya sets in finite fields. Journal of the American Mathematical Society, 22(4), 1093–1097.Google Scholar
Dvir, Zeev. 2012. Incidence theorems and their applications. Foundations and Trends® in Theoretical Computer Science, 6(4), 257–393.Google Scholar
Dvir, Zeev, and Gopi, Sivakanth. 2015. On the number of rich lines in truly high dimensional sets. Pages 584–598 of: 31st International Symposium on Computational Geometry, SoCG 2015. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.Google Scholar
Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi, and Sudan, Madhu. 2013. Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. SIAM Journal on Computing, 42(6), 2305–2328.Google Scholar
Edel, Yves. 2004. Extensions of generalized product caps. Designs, Codes and Cryptography, 31(1), 5–14.CrossRefGoogle Scholar
Elekes, György. 1997. On the number of sums and products. Acta Arithmetica, 81, 365–367.Google Scholar
Elekes, György. 2001. Sums versus products in number theory, algebra and Erdős geometry. Paul Erdős and his Mathematics II, 11, 241–290.Google Scholar
Elekes, György, and Szabó, Endre. 2012. How to find groups? (and how to use them in Erdős geometry?). Combinatorica, 32(5), 537–571.Google Scholar
Ellenberg, Jordan S., and Gijswijt, Dion. 2017. On large subsets of with no three-term arithmetic progression. Annals of Mathematics, 185, 339–343.Google Scholar
Erdős, Paul. 1946. On sets of distances of n points. The AmericanMathematical Monthly, 53(5), 248–250.Google Scholar
Erdős, Paul. 1985. Problems and results in combinatorial geometry. Annals of the New York Academy of Sciences, 440(1), 1–11.Google Scholar
Erdős, Paul. 1986. On some metric and combinatorial geometric problems. Discrete Mathematics, 60, 147–153.CrossRefGoogle Scholar
Erdős, Paul. 1993. On some of my favourite theorems. Pages 97–132 of: Combinatorics, Paul Erdős is Eighty, vol. 2. János Bolyai Mathematical Society.Google Scholar
Erdős, Paul, and Purdy, George. 1971. Some extremal problems in geometry. Journal of Combinatorial Theory, Series A, 10, 246–252.CrossRefGoogle Scholar
Erdős, Paul, and Szemerédi, Endre. 1983. On sums and products of integers. Pages 213–218 of: Studies in Pure Mathematics. Springer.Google Scholar
Farber, Miriam, Ray, Saurabh, and Smorodinsky, Shakhar. 2014. On totally positive matrices and geometric incidences. Journal of Combinatorial Theory, Series A, 128, 149–161.Google Scholar
Fox, Jacob, Pach, János, Sheffer, Adam, Suk, Andrew, and Zahl, Joshua. 2017. A semi-algebraic version of Zarankiewicz’s problem. Journal of the European Mathematical Society, 19(6), 1785–1810.Google Scholar
Fox, Jacob, Pach, János, and Suk, Andrew. 2018. More distinct distances under local conditions. Combinatorica, 38(2), 501–509.Google Scholar
Gibson, Christopher G. 1998. Elementary Geometry of Algebraic Curves: An Undergraduate Introduction. Cambridge University Press.Google Scholar
Giusti, Marc. 1984. Some effectivity problems in polynomial ideal theory. Pages 159–171 of: International Symposium on Symbolic and Algebraic Manipulation. Springer.Google Scholar
Green, Ben, and Tao, Terence. 2013. On sets defining few ordinary lines. Discrete & Computational Geometry, 50(2), 409–468.Google Scholar
Grosswald, Emil. 1985. Representations of Integers as Sums of Squares. Springer.Google Scholar
Grosu, Codruţ. 2014. Fp is locally like C. Journal of the London Mathematical Society, 89(3), 724–744.Google Scholar
Guth, Larry. 2015a. Distinct distance estimates and low degree polynomial partitioning. Discrete & Computational Geometry, 53(2), 428–444.Google Scholar
Guth, Larry. 2015b. Polynomial partitioning for a set of varieties. Mathematical Proceedings of the Cambridge Philosophical Society, 159(3), 459–469.Google Scholar
Guth, Larry. 2016. Polynomial Methods in Combinatorics. Vol. 64 of University Lecture Series. American Mathematical Society.Google Scholar
Guth, Larry, and Katz, Nets Hawk. 2010. Algebraic methods in discrete analogs of the Kakeya problem. Advances in Mathematics, 225(5), 2828–2839.CrossRefGoogle Scholar
Guth, Larry, and Katz, Nets Hawk. 2015. On the Erdős distinct distances problem in the plane. Annals of Mathematics, 181(1), 155–190.Google Scholar
Hablicsek, Márton, and Scherr, Zachary. 2016. On the number of rich lines in high dimensional real vector spaces. Discrete & Computational Geometry, 55(4), 955–962.Google Scholar
Halmos, Paul R. 1970. How to write mathematics. L’Enseignement Mathématique, 16(2), 123–152.Google Scholar
Harris, Joe. 2013. Algebraic Geometry: A First Course. Vol. 133 of Graduate Texts in Mathematics. Springer Science & Business Media.Google Scholar
Hickman, Jonathan, and Wright, James. 2018. The Fourier restriction and Kakeya problems over rings of integers modulo N. Discrete Analysis 2018: 11, 1–54.Google Scholar
Hilbert, David, and Cohn-Vossen, Stephan. 2021. Geometry and the Imagination. American Mathematical Society.Google Scholar
Iosevich, Alex. 2008. Fourier analysis and geometric combinatorics. Pages 321–335 of: Topics In Mathematical Analysis. World Scientific.Google Scholar
Jackson, John. 1821. Rational Amusement for Winter Evenings, Or, A Collection of Above 200 Curious and Interesting Puzzles and Paradoxes Relating to Arithmetic, Geometry, Geography, &c: With Their Solutions, and Four Plates, Designed Chiefly for Young Persons. Longman, Hurst, Rees, Orme, and Brown.Google Scholar
Kaplan, Haim, Sharir, Micha, and Shustin, Eugenii. 2010. On lines and joints. Discrete & Computational Geometry, 44(4), 838–843.Google Scholar
Kaplan, Haim, Matoušek, Jiří, Safernová, Zuzana, and Sharir, Micha. 2012. Unit distances in three dimensions. Combinatorics, Probability and Computing, 21(4), 597–610.Google Scholar
Kelley, Walter G., and Peterson, Allan C. 2010. The Theory of Differential Equations: Classical and Qualitative. Springer Science & Business Media.Google Scholar
Kollár, János. 2015. Szemerédi–Trotter-type theorems in dimension 3. Advances in Mathematics, 271, 30–61.Google Scholar
Landau, Edmund. 1909. Über die Einteilung der positiven ganzen Zahlen in vier Klassen nach der Mindestzahl der zu ihrer additiven Zusammensetzung erforderlichen Quadrate. Archiv der Mathematik und Physik, 13, 305–312.Google Scholar
Larman, David G, Rogers, C. Ambrose, and Seidel, Johan J. 1977. On two-distance sets in Euclidean space. Bulletin of the London Mathematical Society, 9(3), 261–267.Google Scholar
Lee, John M. 2013. Introduction to Smooth Manifolds. Vol. 218 of Graduate Texts in Mathematics. Springer-Verlag.Google Scholar
Leighton, Frank Thomson. 1983. Complexity Issues in VLSI: Optimal Layouts For the Shuffle-Exchange Graph and Other Networks. MIT Press.Google Scholar
Lo, Chi-Yuan, Matoušek, Jiří, and Steiger, William. 1994. Algorithms for ham-sandwich cuts. Discrete & Computational Geometry, 11(4), 433–452.Google Scholar
Mantel, Willem. 1907. Problem 28. Wiskundige Opgaven, 10(60–61), 320.Google Scholar
Matoušek, Jiří. 2011. The number of unit distances is almost linear for most norms. Advances in Mathematics, 226(3), 2618–2628.Google Scholar
Matoušek, Jiří. 2013. Lectures on Discrete Geometry. Vol. 212 of Graduate Texts in Mathematics. Springer Science & Business Media.Google Scholar
Meshulam, Roy. 1995. On subsets of finite abelian groups with no 3-term arithmetic progressions. Journal of Combinatorial Theory, Series A, 71(1), 168–172.Google Scholar
Milnor, J. 1964. On the Betti numbers of real varieties. Proceedings of the American Mathematical Society, 15(2): 275–280.Google Scholar
Mohammadi, Ali, and Stevens, Sophie. 2021. Attaining the exponent 5/4 for the sum-product problem in finite fields. arXiv preprint arXiv:2103.08252.Google Scholar
Moser, Leo. 1952. On the different distances determined by n points. The American Mathematical Monthly, 59(2), 85–91.Google Scholar
Moshkovitz, Dana. 2010. An alternative proof of the Schwartz-Zippel lemma. Page 96 of: Electronic Colloquium on Computational Complexity, vol. 17.Google Scholar
Mumford, David. 1999. The Red Book of Varieties and Schemes: Includes the Michigan Lectures (1974) on Curves and Their Jacobians. Vol. 1358 of Lecture Notes in Mathematics. Springer Science & Business Media.Google Scholar
Naslund, Eric, and Sawin, Will. 2017. Upper bounds for sunflower-free sets. Forum of Mathematics, Sigma, 5, e15. doi: 10.1017/fms.2017.12.CrossRefGoogle Scholar
Pach, János, and Sharir, Micha. 1992. Repeated angles in the plane and related problems. Journal of Combinatorial Theory, Series A, 59(1), 12–22.Google Scholar
Pach, János, and Sharir, Micha. 1998. On the number of incidences between points and curves. Combinatorics, Probability and Computing, 7(1), 121–127.Google Scholar
Pach, János, and Sharir, Micha. 2004. Geometric incidences. Contemporary Mathematics, 342, 185–224.Google Scholar
Pach, János, and Tardos, Gábor. 2002. Isosceles triangles determined by a planar point set. Graphs and Combinatorics, 18(4), 769–779.Google Scholar
Pach, János, and de Zeeuw, Frank. 2017. Distinct distances on algebraic curves in the plane. Combinatorics, Probability and Computing, 26(1), 99–117.Google Scholar
Pascal, Blaise. 1640. Essay pour les coniques. Œuvres (Brunschvigg et Boutroux, eds.), 1.Google Scholar
Plücker, Julius. 1847. Note sur le theorème de Pascal. Journal für die Reine und Angewandte Mathematik, 34, 337–340.Google Scholar
Quilodrán, René. 2010. The Joints Problem in Rn. SIAM Journal on Discrete Mathematics, 23(4), 2211–2213.CrossRefGoogle Scholar
Ramanujan, Srinivasan. 1916. Some formulae in the analytic theory of numbers. Messenger of Mathematics, 45, 81–84.Google Scholar
Raz, Orit E., and Sharir, Micha. 2017. The number of unit-area triangles in the plane: Theme and variation. Combinatorica, 37(6), 1221–1240.Google Scholar
Raz, Orit E., Roche-Newton, Oliver, and Sharir, Micha. 2015. Sets with few distinct distances do not have heavy lines. Discrete Mathematics, 338(8), 1484–1492.Google Scholar
Raz, Orit E., Sharir, Micha, and de Zeeuw, Frank. 2016a. Polynomials vanishing on Cartesian products: The Elekes–Szabó theorem revisited. Duke Mathematical Journal, 165(18), 3517–3566.CrossRefGoogle Scholar
Raz, Orit E., Sharir, Micha, and Solymosi, József. 2016b. Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. American Journal of Mathematics, 138(4), 1029–1065.Google Scholar
Rédei, László. 1970. Luckenhafte Polynome uber Endlichen Korpern. Birkhauser.CrossRefGoogle Scholar
Reid, Constance. 1970. Hilbert. Springer-Verlag.Google Scholar
Roche-Newton, Oliver, Rudnev, Misha, and Shkredov, Ilya D. 2016. New sum-product type estimates over finite fields. Advances in Mathematics, 293, 589–605.Google Scholar
Rota, Gian-Carlo. 2008. Indiscrete Thoughts. Springer Science & Business Media.Google Scholar
Roth, Klaus F. 1953. On certain sets of integers. Journal of the London Mathematical Society, 1(1), 104–109.Google Scholar
Rudnev, Misha. 2018. On the number of incidences between points and planes in three dimensions. Combinatorica, 38(1), 219–254.Google Scholar
Rudnev, Misha, and Selig, JM. 2016. On the use of the Klein quadric for geometric incidence problems in two dimensions. SIAM Journal on Discrete Mathematics, 30(2), 934–954.Google Scholar
Saraf, Shubhangi, and Sudan, Madhu. 2008. An improved lower bound on the size of Kakeya sets over finite fields. Analysis & PDE, 1(3), 375–379.Google Scholar
Schwartz, Jacob T. 1980. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4), 701–717.Google Scholar
Sharir, M. 2009. On distinct distances and incidences: Elekes’s transformation and the new algebraic developments. In Annales Univ. Sci. Budapest, 52, 75–102.Google Scholar
Sharir, Micha, and Zahl, Joshua. 2017. Cutting algebraic curves into pseudo-segments and applications. Journal of Combinatorial Theory, Series A, 150, 1–35.Google Scholar
Sharir, Micha, Sheffer, Adam, and Solymosi, József. 2013. Distinct distances on two lines. Journal of Combinatorial Theory, Series A, 120(7), 1732–1736.Google Scholar
Sharir, Micha, Sheffer, Adam, and Solomon, Noam. 2016. Incidences with curves in Rd. The Electronic Journal of Combinatorics, P4–16.Google Scholar
Sheffer, Adam. 2014. Distinct distances: open problems and current bounds. arXiv:1406.1949.Google Scholar
Sheffer, Adam. 2016. Lower bounds for incidences with hypersurfaces. Discrete Analysis, 2016:16.Google Scholar
Sheffer, Adam, and Zahl, Joshua. 2021. Distinct distances in the complex plane. Transactions of the American Mathematical Society, 367, 6691–6725.Google Scholar
Sheffer, Adam, Zahl, Joshua, and de Zeeuw, Frank. 2016. Few distinct distances implies no heavy lines or circles. Combinatorica, 36(3), 349–364.Google Scholar
Sheffer, Adam, Szabó, Endre, and Zahl, Joshua. 2018. Point-curve incidences in the complex plane. Combinatorica, 38(2), 487–499.Google Scholar
Solymosi, József. 2006. Dense arrangements are locally very dense. I. SIAM Journal on Discrete Mathematics, 20(3), 623–627.Google Scholar
Solymosi, József. 2009. Bounding multiplicative energy by the sumset. Advances in Mathematics, 222(2), 402–408.Google Scholar
Solymosi, József, and Tao, Terence. 2012. An incidence theorem in higher dimensions. Discrete & Computational Geometry, 48(2), 255–280.Google Scholar
Solymosi, József, and Vu, Van H. 2008. Near optimal bounds for the Erdős distinct distances problem in high dimensions. Combinatorica, 28(1), 113–125.Google Scholar
Spencer, Joel, Szemerédi, Endre, and Trotter, William T. 1984. Unit distances in the Euclidean plane. Pages 294–304 of: Graph Theory and Combinatorics. Academic Press.Google Scholar
Stevens, Sophie, and de Zeeuw, Frank. 2017. An improved point-line incidence bound over arbitrary fields. Bulletin of the London Mathematical Society, 49(5), 842–858.Google Scholar
Stillwell, John. 2008. Naive Lie Theory. Springer Science & Business Media.Google Scholar
Stone, Arthur H., and Tukey, John W. 1942. Generalized “sandwich” theorems. Duke Mathematical Journal, 9(2), 356–359.CrossRefGoogle Scholar
Sylvester, James Joseph. 1868. Mathematical question 2571. Educational Times.Google Scholar
Székely, László A. 1997. Crossing numbers and hard Erdős problems in discrete geometry. Combinatorics, Probability and Computing, 6(3), 353–358.Google Scholar
Szemerédi, Endre, and Trotter, WilliamT. 1983. Extremal problems in discrete geometry. Combinatorica, 3(3), 381–392.CrossRefGoogle Scholar
Tao, Terence. 2014. Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory. EMS Surveys in Mathematical Sciences, 1(1), 1–46.Google Scholar
Tao, Terence. 2016. A symmetric formulation of the Croot-Lev-Pach-Ellenberg-Gijswijt capset bound. blog post. https://terrytao.wordpress.com/2016/05/18/a-symmetric-formulation-of-the-croot-lev-pach-ellenberg-gijswijt-capset-bound/.Google Scholar
Tao, Terence, and Vu, Van H. 2006. Additive Combinatorics. Vol. 105 of Cambridge Studies in Advanced Mathematics. Cambridge University Press.Google Scholar
Thom, R. 2015. Sur l’homologie des variétés algébriques réelles. In Differential and Combinatorial Topology, pages 255–265. Princeton University Press.Google Scholar
Tidor, Jonathan, Yu, Hung-Hsun Hans, and Zhao, Yufei. 2020. Joints of varieties. arXiv preprint arXiv:2008.01610.Google Scholar
Tóth, Csaba D. 2015. The Szemerédi–Trotter theorem in the complex plane. Combinatorica, 35(1), 95–126.Google Scholar
Valtr, Pavel. 2005. Strictly convex norms allowing many unit distances and related touching questions. Preprint.Google Scholar
Vinh, Le Anh. 2011. The Szemerédi–Trotter type theorem and the sum-product estimate in finite fields. European Journal of Combinatorics, 32(8), 1177–1181.Google Scholar
Walsh, Miguel N. 2020. The polynomial method over varieties. Inventiones mathematicae, 222, 469–512.Google Scholar
Warren, Hugh E. 1968. Lower bounds for approximation by nonlinear manifolds. Transactions of the American Mathematical Society, 133(1), 167–178.Google Scholar
West, Douglas Brent. 2001. Introduction to Graph Theory. Vol. 2. Prentice Hall.Google Scholar
Whitney, Hassler. 1957. Elementary structure of real algebraic varieties. Annals of Mathematics, 66(3), 545–556.Google Scholar
Wolff, Thomas. 1999. Recent work connected with the Kakeya problem. In: Prospects in Mathematics 1996. American Mathematical Society.Google Scholar
Yu, Hung-Hsun Hans, and Zhao, Yufei. 2019. Joints tightened. arXiv preprint arXiv:1911.08605.Google Scholar
Zahl, Joshua. 2013. An improved bound on the number of point-surface incidences in three dimensions. Contributions to Discrete Mathematics, 8(1) 100–121.Google Scholar
Zahl, Joshua. 2015. A Szemerédi–Trotter type theorem in R4. Discrete & Computational Geometry, 54(3), 513–572.Google Scholar
Zahl, Joshua. 2016. A note on rich lines in truly high dimensional sets. Forum of Mathematics, Sigma, 4, 1–13.Google Scholar
de Zeeuw, Frank. 2016. A short proof of Rudnev’s point-plane incidence bound. arXiv preprint arXiv:1612.02719.Google Scholar
Zhang, Ruixiang. 2020. A proof of the Multijoints Conjecture and Carbery’s generalization. Journal of the European Mathematical Society, 22(8), 2405–2417.Google Scholar
Zippel, Richard. 1979. Probabilistic algorithms for sparse polynomials. Pages 216–226 of: International Symposium on Symbolic and Algebraic Manipulation.Springer.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • References
  • Adam Sheffer, Bernard M. Baruch College, City University of New York
  • Book: Polynomial Methods and Incidence Theory
  • Online publication: 17 March 2022
  • Chapter DOI: https://doi.org/10.1017/9781108959988.017
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • References
  • Adam Sheffer, Bernard M. Baruch College, City University of New York
  • Book: Polynomial Methods and Incidence Theory
  • Online publication: 17 March 2022
  • Chapter DOI: https://doi.org/10.1017/9781108959988.017
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • References
  • Adam Sheffer, Bernard M. Baruch College, City University of New York
  • Book: Polynomial Methods and Incidence Theory
  • Online publication: 17 March 2022
  • Chapter DOI: https://doi.org/10.1017/9781108959988.017
Available formats
×