Arindam Biswas

activity

20182026

most citedAsymptotic behaviour of minimal complements

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

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

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…

math.CO2026

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…

math.CO2020

Spectrum of twists of Cayley and Cayley sum graphs

Arindam Biswas, Jyoti Prakash Saha

Let $G$ be a finite group with $∣ G ∣ \geq 4$ and $S$ be a subset of $G$ . Given an automorphism $σ$ of $G$ , the twisted Cayley graph $C (G, S)^{σ}$ (resp. the twisted Cayley sum graph $C…

math.CO2020★ 1 cited

Asymptotic behaviour of minimal complements

Arindam Biswas, Jyoti Prakash Saha

The notion of minimal complements was introduced by Nathanson in 2011 as a natural group-theoretic analogue of the metric concept of nets. Given two non-empty subsets $W, W^{'}$ in a g…

math.CO2019

Flexibility and movability in Cayley graphs

Arindam Biswas

Let $Γ = (V, E)$ be a (non-trivial) finite graph with $λ : E \to R_{+}$ , an edge labelling of $Γ$ . Let $ρ : V \to R^{2}$ be a map which…

math.CO2019

A Cheeger type inequality in finite Cayley sum graphs

Arindam Biswas, Jyoti Prakash Saha

Let $G$ be a finite group and $S$ be a symmetric generating set of $G$ with $∣ S ∣ = d$ . We show that if the undirected Cayley sum graph $C_{Σ} (G, S)$ is an expander graph and is non-bi…