The purpose of life is to conjecture and prove. -- Paul Erdos
BSc Math (University of Calcutta, 2006)
MSc Math (University of Calcutta, 2008)
PhD in Cryptography (University of Calcutta, 2014)
I completed my B.Sc. in Mathematics from St. Xavier's College, Kolkata in 2006 and M.Sc. in Pure Mathematics from University of Calcutta in 2008. I have completed my Ph.D. in Cryptography from Department of Pure Mathematics, University of Calcutta, under the supervision of Dr. Avishek Adhikari in 2014. I was an Assistant Professor in Department of Mathematics, St. Xavier's College, Kolkata from 2011 to 2018.
My current research interests are Algebraic Graph Theory and Domination in Graphs. My Erdos number is 2.
Research / Administrative Experience+
My doctoral thesis was on security notions and constructions of public key encryption schemes and secret sharing schemes. Currently, I am working on Algebraic Graph Theory and Domination in Graphs.
Teaching / Other Experience+
I teach Algebra, Number Theory and Graph Theory to post graduate and under graduate students in Presidency University.
Post Graduate Supervision+
Current PhD students:
1. Manideepa Saha
2. Sucharita Biswas
For Prospective PhD students:
I work broadly on two things: Algebraic Graph Theory and Domination in Graphs.
In AGT, I am interested in and working on vertex-transitive graphs and many open questions related to it e.g., Polycirculant Conjecture, Lovasz's Conjecture and their variants. In graph domination, I mainly focus on different variants of domination and relations between them.
As a prospective student, I expect the following from you:
1. You should enjoy counting. While working with me, I expect research to be your primary intellectual occupation.
2. As prerequisite, you should have a good knowledge of linear algbera and group theory (any standard post-graduate course). Though, it is not absolutely necessary to have done a course on Graph Theory, but a preliminary idea about it would be appreciated. "Introduction to Graph Theory" by D.B. West is a goodbook to start with.
3. If you are interested in AGT, you should read Chapters 1-6 of the book "Algebraic Graph Theory" by Chris Godsil and Gordon Royle, before contacting me. Similarly, for graph domination, the must-read is Chapters 1-10 of the book "Fundamentals of Domination in Graphs" by T. Haynes, S.T. Hedetniemi and P. Slater.
Others: As a general policy, I do not offer reading courses or student internships.
Member, Cryptology Research Society of India, 2008-2013
Selected List of Publications: for complete list, click here
1. Angsuman Das & Wyatt J. Desormeaux. Domination Defect in Graphs: Guarding with fewer Guards, Indian Journal of Pure and Applied Mathematics, Volume 49, Issue 2, pp. 349-364, June, 2018.
2. Angsuman Das. On Subspace Inclusion Graph of a Vector Space. Linear and Multilinear Algebra, Taylor and Francis, Volume 66, Issue 3, 554 -564, 2018.
3. Angsuman Das, Renu C. Laskar & Nader Jafari Rad. On α-Domination in Graphs. Graphs & Combinatorics, Volume 34, Issue 1, 193-205, January, 2018.
4. Angsuman Das. Infinite Graphs with Finite Dominating Sets. Discrete Mathematics, Algorithms and Applications, World Scientific, Volume 9, Issue 4, August 2017.
5. Angsuman Das. Coefficient of Domination in Graph. Discrete Mathematics, Algorithms and Applications, World Scientific, Volume 9, Issue 2, April 2017.
6. Angsuman Das. Non-zero Component Union Graph of a Finite Dimensional Vector Space. Linear and Multilinear Algebra, Volume 65, Issue 6, 1276-1287, 2017, Taylor and Francis.
7. Angsuman Das. On Non-zero Component Graph of Vector Spaces over Finite Fields. Journal of Algebra and its Applications, Volume 16, Issue 01, January 2017, WorldScientific.
8. Angsuman Das. Subspace Inclusion Graph of a Vector Space. Communications in Algebra, Vol. 44, Issue 11, 2016, 4724-4731, Taylor and Francis.
9. Angsuman Das. Non-Zero Component Graph of a Finite Dimensional Vector Space. Communications in Algebra, Vol. 44, Issue 9, 3918-3926, 2016, Taylor and Francis.
10. Angsuman Das, Avishek Adhikari & Kouichi Sakurai. Plaintext Checkable Encryption with Designated Checker. Advances in Mathematics of Communication, Volume 9, Issue 1, pp. 37-53, 2015.
- Dean of Students Corner
- Career Counselling
- International Students
- PhD Students
- Grievance Redressal Cell
- Internal Committee for the Students with Disabilities
- Equal Opportunity Cell
- Internal Complaints Committee (ICC)
- Gender Sensitization and Prevention of Sexual Harassment Cell(GSPSHC)