Evasive Properties of Sparse Graphs and Some Linear Equations in Primes
Igor Shparlinski
TL;DR
This paper proves an unconditional result regarding the evasiveness of sparse graphs, extending previous conditional findings based on the Extended Riemann Hypothesis, and explores related linear equations in primes.
Contribution
It provides the first unconditional proof of the evasiveness of sparse graphs, removing reliance on the Extended Riemann Hypothesis.
Findings
Unconditional proof of sparse graph evasiveness
Extension of previous conditional results
Insights into linear equations in primes
Abstract
We give an unconditional version of a conditional, on the Extended Riemann Hypothesis, result of L. Babai, A. Banerjee, R. Kulkarni and V. Naik (2010) on the evasiveness of sparse graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.