Nikola Kuzmanovski

Nikola Kuzmanovski

Kenna Postdoctoral Research Associate

Department: Department of Mathematics

Institution: University of Notre Dame

Office: 138 Hayes-Healy, Notre Dame, IN 46556, USA

Email: nkuzmano@nd.edu

About & Research Interests

My recent research focuses on the Eisenbud-Green-Harris (EGH) conjecture, Lefschetz properties, and the structure of generic initial spaces in the presence of regular sequences.


Previously, I worked on discrete isoperimetric problems. I remain very interested in discrete isoperimetric problems and continue to use them extensively in my current research.

Isoperimetric / Lexicographic Animation

Publications & Preprints

You can also find my preprints and papers listed directly on arXiv.

  1. Kuzmanovski, N. (2026). "On the Structure of Generic Initial Spaces". In preparation.
  2. Beall, P., Boyali, E., Chen, N., Chlachidze, E., Dao, T. T., Garvey, F., Johnson, M., Li, Y. O., Kuzmanovski, N., Ma, K., Mal, T., Marasinghe Mudiyanselage, R., Mayo, Q., Minsky-Primus, N., Seceleanu, A., & Veerapaneni, S. (2026). "Constructions of Macaulay posets and Macaulay rings". Electronic Journal of Combinatorics, 33.2, Paper No. 2.52, 40 pp.
  3. Beall, P., Kuzmanovski, N., Li, Y. O., & Seceleanu, A. (2025). "The Macaulay Posets package for Macaulay2". Accepted to Journal of Software for Algebra and Geometry.
  4. Kuzmanovski, N. (2025). "Towards a Complete Local-Global Principle". Order.
  5. Kuzmanovski, N. (2025). "Macaulay posets and rings". Journal of Algebraic Combinatorics, 62.4, Paper No. 54, 42 pp.
  6. Kuzmanovski, N., & Radcliffe, J. (2024). "Reflect-push methods part I: two dimensional techniques". Electronic Journal of Combinatorics, 31.1, Paper No. 1.55, 47 pp.
  7. Bezrukov, S. L., Kuzmanovski, N., & Lim, J. (2023). "Pull-push method: a new approach to edge-isoperimetric problems". Discrete Mathematics, 346.12, Paper No. 113632, 21 pp.
  8. Bezrukov, S., Bulatovic, P., & Kuzmanovski, N. (2018). "New infinite family of regular edge-isoperimetric graphs". Theoretical Computer Science, 721, pp. 42–53.