5 citations · 6 across the 9 of their papers we have counts for
11 papers
On the Turán number of the directed path
Daniel P. Johnston, Cory Palmer, Amites Sarkar
In this note we determine the maximum number of arcs in a digraph on vertices that does not contain a length- directed path for . Th…
On the spectral radius of some linear hypergraphs
Anirban Banerjee, Amitesh Sarkar
Here we study the spectral radii of some linear hypergraphs, that is, the maximum moduli of the eigenvalues of their corresponding adjacency matrices. We determine the hypertrees h…
Sums of Two Squares Visualized
Ishan Banerjee, Amites Sarkar
We provide a geometric interpretation of Brillhart's celebrated algorithm for expressing a prime as the sum of two squares.
Bootstrap percolation in random geometric graphs
Victor Falgas-Ravry, Amites Sarkar
Following Bradonjić and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the -dimensional torus. In this model, the expected number of…
Intersections of random sets
Jacob Richey, Amites Sarkar
We consider a variant of a classical coverage process, the boolean model in . Previous efforts have focused on convergence of the unoccupied region containing the ori…
Joins of Hypergraphs and Their Spectra
Amitesh Sarkar, Anirban Banerjee
Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to…