Koustav Banerjee

Koustav Banerjee is a Researcher at the Research Institute for Symbolic Computation (RISC) of Johannes Kepler University (JKU Linz). He holds a PhD in Mathematics (2022) from RISC, JKU, focusing on analytic number theory and partition function analysis. His primary research areas include Theory of Partitions, Modular Forms, q-Series, Combinatorics, and Mathematical Analysis.

His work addresses asymptotic expansions, inequalities, and combinatorial proofs related to partitions, Bessel functions, and modular forms. Notable contributions include error bounds for partition function asymptotics, proofs of Chen's conjectures on partition inequalities, and applications of the localization method to congruence families.

Publications highlight his expertise in bridging analytic methods with symbolic computation. Recent articles explore partition function inequalities, Bessel function properties, and combinatorial structures like plane partitions and hook-type tableaux. His research often intersects algebraic geometry and discrete mathematics, yielding results with implications in theoretical physics and computer algebra systems.

Affiliated with RISC since his PostDoc tenure, he collaborates on technical reports and publishes in journals like Rocky Mountain Journal of Mathematics, European Journal of Combinatorics, and Annals of Combinatorics. His work emphasizes rigorous mathematical proofs and computational verification in number theory.