5 citations · 5 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.HO2018
Infinitely Many Primes Using Generating Functions
Sandeep Silwal
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only use…
cs.DS2018
Spectral methods for testing cluster structure of graphs
Sandeep Silwal, Jonathan Tidor
In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is -clusterable if it can be part…