Chirantan Mukherjee's profile picture

Chirantan Mukherjee

Department of Computer Science
The University of Western Ontario
London, Ontario N6A 5B7
CV [Updated on Nov. 2025] cmukher@uwo.ca Google Scholar ResearchGate arXiv ORCID LinkedIn

2026

Efficient detection of redundancies in systems of linear inequalities [PUBLISHED]
Rui-Juan Jing, Marc Moreno Maza, Chirantan Mukherjee, Yan-Feng Xie and Chun-Ming Yuan
Journal of Symbolic Computation.
@article{JING2026102527, title = {Efficient detection of redundancies in systems of linear inequalities}, journal = {Journal of Symbolic Computation}, volume = {135}, pages = {102527}, year = {2026}, issn = {0747-7171}, doi = {https://doi.org/10.1016/j.jsc.2025.102527}, url = {https://www.sciencedirect.com/science/article/pii/S0747717125001099}, author = {Rui-Juan Jing and Marc {Moreno Maza} and Chirantan Mukherjee and Yan-Feng Xie and Chun-Ming Yuan}, keywords = {Redundancy detection, Minimal projected representation, Saturation matrix, Fourier-Motzkin elimination, Polyhedron}, abstract = {Fourier-Motzkin elimination is a fundamental operation in polyhedral geometry. It can be performed by several equivalent procedures, and can be regarded as an adaptation of Gaussian elimination to systems of linear inequalities. These procedures tend to generate large numbers of redundant inequalities. Efficiently detecting these redundancies is essential for obtaining software implementation of practical interest. In this paper, we propose a novel detection technique. We demonstrate its benefits over alternative approaches. A detailed experimentation is reported.} }

Integer Hulls, Z-Polyhedra and Presburger Arithmetic in Action [PUBLISHED]
Rui-Juan Jing, Yuzhuo Lei, Christopher F. S. Maligec, Marc Moreno Maza, and Chirantan Mukherjee
ACM Communications in Computer Algebra.
@article{10.1145/3787957.3787958, author = {Jing, Rui-Juan and Lei, Yuzhuo and Maligec, Christopher F. S. and Maza, Marc Moreno and Mukherjee, Chirantan}, title = {Integer Hulls, Z-Polyhedra and Presburger Arithmetic in Action}, year = {2026}, issue_date = {September 2025}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, volume = {59}, number = {3}, issn = {1932-2232}, url = {https://doi.org/10.1145/3787957.3787958}, doi = {10.1145/3787957.3787958}, abstract = {When solving systems of polynomial equations and inequalities, the task of computing their solutions with integer coordinates is a much harder problem than that of computing their real solutions or that of computing all their solutions. In fact, in the presence of non-linear constraints, this task may simply become an undecidable problem [12, 15]. However, studying the integer solutions of linear systems of equations and inequalities is of practical importance in various areas of scientific computing. Two such areas are combinatorial optimization (in particular, integer linear programming) and compiler optimization (in particular, the analysis, transformation, and scheduling of nested loops in computer programs), where a variety of algorithms solve questions related to the points with integer coordinates in a given polyhedron. Another area is at the crossroads of computer algebra and polyhedral geometry, with topics such as toric ideals and Hilbert bases, see [16], as well as the manipulation of Laurent series, see [1].}, journal = {ACM Commun. Comput. Algebra}, month = jan, pages = {41–46}, numpages = {6} }

2025

Quantifier Elimination Over the Integers [PUBLISHED]
Rui-Juan Jing, Yuzhuo Lei, Christopher F. S. Maligec, Marc Moreno Maza and Chirantan Mukherjee
ISSAC '25: Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation.
@inproceedings{10.1145/3747199.3747580, author = {Jing, Rui-Juan and Lei, Yuzhuo and Maligec, Christopher Frank Stephan and Moreno Maza, Marc and Mukherjee, Chirantan}, title = {Quantifier Elimination Over the Integers}, year = {2025}, isbn = {9798400720758}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, url = {https://doi.org/10.1145/3747199.3747580}, doi = {10.1145/3747199.3747580}, abstract = {In this paper, we revisit, in a unified presentation, different techniques from polyhedral geometry that can support quantifier elimination over the integers. We propose a few improvements and report on a comparative implementation of these techniques.}, booktitle = {Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation}, pages = {353–362}, series = {ISSAC '25} }

Twisted Arrow Construction for Segal Spaces [ACCEPTED]
Chirantan Mukherjee and Nima Rasekh
To appear in The Graduate Journal of Mathematics.
@article{mukherjee2022twisted, title = {Twisted arrow construction for segal spaces}, author = {Mukherjee, Chirantan and Rasekh, Nima}, journal = {arXiv preprint arXiv:2203.01788}, year = {2022} }

2024

A New Algorithm for Computing Integer Hulls of 2D Polyhedral Set [SUBMITTED]
Chirantan Mukherjee
Lalo 60 Conference, July 2024.
@inproceedings{MukherjeeLALO60, author = {Chirantan Mukherjee}, title = {A New Algorithm for Computing Integer Hulls of 2D Polyhedral Sets}, booktitle = {LALO 60: Matrices and Polynomials in Computer Algebra: Algorithms and Software}, year = {Submitted}, keywords = {submitted} }

2022

Complete Segal Spaces as a model of Higher Categories [DISSERTATION]
Chirantan Mukherjee
Department of Mathematics, University of Trento, March 2022.
@mastersthesis{Muk22, author = {Mukherjee, Chirantan}, year = {2022}, month = {March}, title = {Complete Segal Spaces as a model of Higher Categories}, doi = {10.13140/RG.2.2.13538.20167} }