activity
20202026
collaborators

7 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.

math.CO2023

Cliques of orders three and four in the Paley-type graphs

Anwita Bhowmik, Rupam Barman

Let , where or , , and the distinct primes satisfy for all . Let $\mathbb{Z…

math.CO2022

Hypergeometric functions for Dirichlet characters and Peisert-like graphs on

Anwita Bhowmik, Rupam Barman

For a prime and a positive integer , let . The Peisert graph of order is the graph with vertex set such that is an edge if $…

math.CO2022

Number of complete subgraphs of Peisert graphs and finite field hypergeometric functions

Anwita Bhowmik, Rupam Barman

For a prime and a positive integer , let . Let be a primitive element of the finite field . The Peisert graph is defi…

math.CO2020

On a Paley-type graph on

Anwita Bhowmik, Rupam Barman

Let be a prime power such that . The Paley graph of order is the graph with vertex set as the finite field and edges defined as, is a…