Related papers: Computing class groups and unit groups in Magma

In this paper, we calculate the unit groups and the $2$-class numbers of the fields $ \mathbb{K}= \mathbb{Q}(\sqrt{2}, \sqrt{p_1}, \sqrt{p_2})$ and $ \mathbb{L}= \mathbb{Q}( \sqrt{-1},\sqrt{2}, \sqrt{p_1}, \sqrt{p_2})$, where $p_1$ and…

Metrics and pseudometrics are defined on the group of unitary operators in a Hilbert space. Several explicit formulas are derived. A special feature of the work is investigation of pseudometrics in unitary groups. The rich classes of…

Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…

In this paper we enumerate nonhyperelliptic superspecial curves of genus $4$ over prime fields of characteristic $p\le 11$. Our algorithm works for nonhyperelliptic curves over an arbitrary finite field in characteristic $p \ge 5$. We…

To identify potential universal cellular automata, a method is developed to measure information processing capacity of elementary cellular automata. We consider two features of cellular automata: Ability to store information, and ability to…

We compute the mapping class group orbits in the homotopy set of framings of a compact connected oriented surface with non-empty boundary. In the case $g > 1$ the computation is some modification of Johnson's results and certain arguments…

This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

Mixed-precision quantization improves the budget--accuracy trade-off for large language models (LLMs) by allocating more bits to sensitive modules. However, automating this allocation at LLM scale faces a unique combination of constraints:…

We propose a modification of the predictions of the Cohen--Lenstra heuristic for class groups of number fields in the case where roots of unity are present in the base field. As evidence for this modified formula we provide a large set of…

Let $K$ be an imaginary quadratic field and $\mathcal{O}$ be an order in $K$. We construct class fields associated with form class groups which are isomorphic to certain $\mathcal{O}$-ideal class groups in terms of the theory of canonical…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

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…

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

Algorithms are presented for calculating the partition function of constrained beta-gamma systems in terms of the generating functions of the individual fields of the theory, the latter obtained as the Hilbert series of the arc space of the…

We give explicit formulae for the logarithmic class group pairing on an elliptic curve defined over a number field. Then we relate it to the descent relative to a suitable cyclic isogeny. This allows us to connect the resulting Selmer group…

Arithmetical properties of a finite group are properties of the group which are defined by its arithmetical parameters such as the order of the group, the element orders and so on. In this paper, we discuss a number of results on…

We describe two new packages ExactpAdics and ExactpAdicsII for the Magma computer algebra system for working with p-adic numbers exactly, in the sense that numbers are represented lazily to infinite p-adic precision. This has the benefits…

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

We compute the rank of the group of central units in the integral group ring $\Z G$ of a finite strongly monomial group $G$. The formula obtained is in terms of the strong Shoda pairs of $G$. Next we construct a virtual basis of the group…