3 papers
cs.SC2020
Subquadratic-Time Algorithms for Normal Bases
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
For any finite Galois field extension , with Galois group , there exists an element whose orbit $G…
cs.SC2019
Quadratic Probabilistic Algorithms for Normal Bases
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
It is well known that for any finite Galois extension field , with Galois group , there exists an element whose orbit forms an -ba…
math.AG2018
Algebraic Construction of Quasi-split Algebraic Tori
Armin Jamshidpey, Nicole Lemire, Eric Schost
The main purpose of this work is to give a constructive proof for a particular case of the no-name lemma. Let be a finite group, be a field, be a permutation -lattic…