Arindam Biswas

activity

20182026

most citedOn semilinear sets and asymptotically approximate groups

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

collaborators

Showing math.GRShow all

2 papers · 1 filter

math.GR2026

Uniform two-generator presentations for $S L_{n} (Z)$ 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…

math.GR2018

On a cheeger type inequality in Cayley graphs of finite groups

Arindam Biswas

Let $G$ be a finite group. It was remarked by Breuillard-Green-Guralnick-Tao that if the Cayley graph $C (G, S)$ is an expander graph and is non-bipartite then the spectrum of the ad…

Uniform two-generator presentations for SLn​(Z) with polynomial complexity bounds

On a cheeger type inequality in Cayley graphs of finite groups

Uniform two-generator presentations for $S L_{n} (Z)$ with polynomial complexity bounds