3 papers
math.NT2026
On the automorphisms of numerical power monoids
Anwita Bhowmik, Salvatore Tringali
Let be a numerical monoid, that is, a cofinite submonoid of (the non-negative integers under addition). Denote by the monoid obtained…
math.CO2025
Divisible design graphs with selfloops
Anwita Bhowmik, Bart De Bruyn, Sergey Goryainov
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical…
math.CO2024
Divisible design graphs from symplectic graphs over rings with precisely three ideals
Anwita Bhowmik, Sergey Goryainov
In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.