Related papers: Computing class groups and unit groups in Magma

Let $F$ be a finite field of characteristic $p>0$ with $q = p^{n}$ elements. In this paper, a complete characterization of the unit groups $U(FG)$ of group algebras $FG$ for the abelian groups of order $32$, over finite field of…

[Abridged] Galaxy clusters are the most massive gravitationally-bound systems in the universe and are widely considered to be an effective cosmological probe. We propose the first Machine Learning method using galaxy cluster properties to…

Based on the concepts of $\mathbb{R}$-factorizable topological groups and $\mathcal{M}$-factorizable topological groups, we introduce four classes of factorizabilities on topological groups, named $P\mathcal{M}$-factorizabilities,…

This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much…

We estimate the proportion of several classes of elements in finite classical groups which are readily recognised algorithmically, and for which some power has a large fixed point subspace and acts irreducibly on a complement of it. The…

We present efficient algorithms to calculate the color factors for the $SU(N)$ gauge group and to evaluate $\gamma$ traces. The aim of these notes is to give a self-contained, proved account of the basic results with particular emphasis on…

Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…

Based on the general strategy described by Borel and Serre and the Voronoi algorithm for computing unit groups of orders we present an algorithm for finding presentations of $S$-unit groups of orders. The algorithm is then used for some…

Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…

This thesis contains a collection of algorithms for working with the twisted groups of Lie type known as Suzuki groups, and small and large Ree groups. The two main problems under consideration are constructive recognition and constructive…

In this paper we describe all group gradings by a finite abelian group $\Gamma$ of a simple Lie algebra of type $G_2$ over an algebraically closed field $F$ of characteristic 0.

We describe quantizations on monoidal categories of modules over finite groups. They are given by quantizers which are elements of a group algebra. Over the complex numbers we find these explicitly. For modules over S3 and A4 we are given…

We introduce a fast and explainable clustering method called CLASSIX. It consists of two phases, namely a greedy aggregation phase of the sorted data into groups of nearby data points, followed by the merging of groups into clusters. The…

A Hopf Galois structure on a finite field extension $L/K$ is a pair $(H,\mu)$, where $H$ is a finite cocommutative $K$-Hopf algebra and $\mu$ a Hopf action. In this paper we present a program written in the computational algebra system…

We investigate the language classes recognized by group automata over matrix groups. For the case of $2 \times 2 $ matrices, we prove that the corresponding group automata for rational matrix groups are more powerful than the corresponding…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Automata learning is a technique that has successfully been applied in verification, with the automaton type varying depending on the application domain. Adaptations of automata learning algorithms for increasingly complex types of automata…

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

An analytical-numeric calculation method of extremely complicated integrals is presented. These integrals appear often in magnet soliton theory. The appropriate analytical continuation and a corresponding integration contour allow to reduce…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…