Author:
Sheffer Adam,Silier Olivine
Funder
National Science Foundation
Research Foundation of The City University of New York
California Institute of Technology
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference24 articles.
1. Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85, # 101574 (2019)
2. Bombieri, E., Bourgain, J.: A problem on sums of two squares. Int. Math. Res. Not. 2015(11), 3343–3407 (2015)
3. Bourgain, J., Demeter, C.: New bounds for the discrete Fourier restriction to the sphere in 4D and 5D. Int. Math. Res. Not. 2015(11), 3150–3184 (2015)
4. Chernikov, A., Galvin, D., Starchenko, S.: Cutting lemma and Zarankiewicz’s problem in distal structures. Selecta Math. (N.S.) 26(2), # 25 (2020)
5. Elekes, Gy.: On linear combinatorics I. Concurrency—an algebraic approach. Combinatorica 17(4), 447–458 (1997)