14 citations · 42 across the 19 of their papers we have counts for
5 papers · 1 filter
Fast robbers on abelian Cayley graphs and digraphs
Arindam Biswas
We study the fast-robber version of the Cops and Robbers game on finite strongly connected abelian Cayley digraphs, including undirected Cayley graphs as the symmetric case. For bo…
Lattice point sumsets and asymptotic approximate groups
Arindam Biswas, Pavlo Yatsyna
We establish new quantitative bounds for asymptotic approximate groups arising from finite subsets of lattices and, more generally, semi-linear subsets of abelian groups. Our appro…
On asymptotic approximate groups in nilpotent groups
Arindam Biswas
Let be a group and let be non-empty. We call an asymptotic -approximate group if, for a fixed dilation factor , the larger product sets ca…
Uniform two-generator presentations for with polynomial complexity bounds
Arindam Biswas
We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds o…
On Chromatic Asymptotic Approximate Groups
Arindam Biswas
We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering idea…