activity
20162020
most citedClosure of VP under taking factors: a short and simple proof

4 citations · 5 across the 4 of their papers we have counts for

collaborators

7 papers

math.CO2020

Incidences with curves in three dimensions

Micha Sharir, Noam Solomon

We study incidence problems involving points and curves in . The current (and in fact only viable) approach to such problems, pioneered by Guth and Katz, requires a variety of…

math.NT2019

The distribution of rational numbers on Cantor's middle thirds set

Alexander Rahm, Noam Solomon, Tara Trauthwein +1

We give a heuristic for the number of reduced rationals on Cantor's middle thirds set, with a fixed bound on the denominator. We also describe extensive numerical computations supp…

cs.CC2019

Derandomization from Algebraic Hardness

Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi +1

A hitting-set generator (HSG) is a polynomial map such that for all -variate polynomials of small enough circuit size and degree, if is…

cs.CC20194 cited

Closure of VP under taking factors: a short and simple proof

Chi-Ning Chou, Mrinal Kumar, Noam Solomon

In this note, we give a short, simple and almost completely self contained proof of a classical result of Kaltofen [Kal86, Kal87, Kal89] which shows that if an variate degree $…

math.CA2019

Incidence estimates for well spaced tubes

Larry Guth, Noam Solomon, Hong Wang

We prove analogues of the Szemerédi-Trotter theorem and other incidence theorems using -tubes in place of straight lines, assuming that the -tubes are well-spaced in a strong…

math.CO20191 cited

From DNF compression to sunflower theorems via regularity

Shachar Lovett, Noam Solomon, Jiapeng Zhang

The sunflower conjecture is one of the most well-known open problems in combinatorics. It has several applications in theoretical computer science, one of which is DNF compression,…