Abstract
We use methods from spectral graph theory to obtain bounds on the number of incidences between -planes and -planes in which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More precisely, we prove that the number of incidences between a set of -planes and a set of -planes with , which is denoted by , satisfies
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.