Related papers: Computing class groups by induction with generalis…
This paper studies Galois extensions over real quadratic number fields or cyclotomic number fields ramified only at one prime. In both cases, the ray class groups are computed, and they give restrictions on the finite groups that can occur…
In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher…
This paper describes the classification of analytic $q$-difference equations. The difference Galois groups are computed. A tentative description of the universal difference Galois group is given.
We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…
This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…
There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
We classify the finite groups $G$ which satisfies the condition that every complex irreducible character,whose degree's square doesn't divide the index of its kernel in $G$, lies in the same Galois conjugacy class.
By applying interpretable machine learning methods such as decision trees, we study how simple models can classify the Galois groups of Galois extensions over $\mathbb{Q}$ of degrees 4, 6, 8, 9, and 10, using Dedekind zeta coefficients. Our…
We develop a computational framework for the statistical characterization of Galois characters with finite image, with application to characterizing Galois groups and establishing equivalence of characters of finite images of…
We generalize the notion of semi-normalized classes of systems of differential equations, study properties of such classes and extend the algebraic method of group classification to them. In particular, we prove the important theorems on…
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…
We apply the differential Galois theory for difference equations developed by Hardouin and Singer to compute the differential Galois group for a second-order linear $q$-difference equation with rational function coefficients. This Galois…
In this paper we introduce and study the concept of normality degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be normal. Explicit formulas are obtained for some particular classes of…
This note presents Galois theory for finite fields. It was written as a handout for the MAT401 course ``Polynomial equations and fields'' taught at the University of Toronto in Spring 2026. We use without proofs some basic properties of…
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…
For any finite group G and integer i, let $\mathcal{H}^i(G)$ be the set of all the isomorphism classes of the Galois cohomology groups $\hat{H}^i(K/k,E_K)$, where K/k runs over all the unramified G-extension of number fields and E_K denotes…