Dr. rer. nat. Anna-Maurin Graner

Group 'Discrete Mathematics'

Contact Details

E-Mail 

anna-maurin.graner(at)uni-rostock.de

Phone

   +49 (381) 498-6603

Address

 Room 225, House 3
Ulmenstraße 69
18057 Rostock
Germany

Publications

Closed formulas for the generators of all constacyclic codes and for the factorization of X^n − 1, the n-th cyclotomic polynomial and every composition of the form f(X^n) over a finite field for arbitrary positive integers n

Graner, Anna-Maurin.
Finite Fields and Their Applications, Volume 109, p. 102695 (2026).
https://doi.org/10.1016/j.ffa.2025.102695
https://www.sciencedirect.com/science/article/pii/S107157972500125X

The factorization of X^n-a and f(X^n) over Fq

Graner, Anna-Maurin.
arXiv 2306.11183 (2023)
https://doi.org/10.48550/arXiv.2306.11183

Constructing irreducible polynomials recursively with a reverse composition method

Talks

Code

This is my GitHub-Page: https://github.com/amg-code

In the repository

https://github.com/amg-code/PolynomialsOverFiniteFields

you can find implementations of results of my mathematical research in SageMath or Python. These implementations make use of the two new Python classes RichFiniteField and RichPolynomial which are meant for working with univariate polynomials over different finite fields and their extensions.

There also is an implementation of the new factorization algorihm as presented in my paper The factorization of X^n-a and f(X^n). This new algorithm runs much faster and much more stable than the existing SageMath function .factor() which is based on PARI.