Related papers: Computations in Classical Groups

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

In a previous work, the second-named author gave a complete description of the action of automorphisms on the ordinary irreducible characters of the finite symplectic groups. We generalise this in two directions. Firstly, using work of the…

We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly"…

We give a uniform construction of irreducible polynomial representations of all classical groups, including spin groups, using semistandard domino tableaux. We also give an explicit decomposition of the homogeneous coordinate ring of the…

We prove a series of ``knapsack'' type equalities for irreducible character degrees of symmetric groups. That is, we find disjoint subsets of the partitions of $n$ so that the two corresponding character-degree sums are equal. Our main…

We prove a converse theorem for split even special orthogonal groups over finite fields. This is the only case left on converse theorems of split classical groups and the difficulty is the existence of the outer automorphism. In this paper,…

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…

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

We prove Kim's Assumtion A for the split classical groups in positive characteristic. Actually, we work in the slightly more general setting of groups of classical kind, which includes quasi-split classical groups and generalized spinor…

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

We exhibit an explicit formula for the cardinality of solutions to a class of quadratic matrix equations over finite fields. We prove that the orbits of these solutions under the natural conjugation action of the general linear groups can…

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…

In this paper, we classify the groups of semisimilarities of finite classical polar spaces with exactly two orbits on the singular or isotropic points. As a byproduct, we obtain many highly symmetric regular sets in the point graphs of…

Let $D$ be a totally definite quaternion algebra over a totally real number field $F$, and $\mathcal{O}$ be an $O_F$-order (of full rank) in $D$. The type number $t(\mathcal{O})$ is an important arithmetic invariant of $\mathcal{O}$ that…