Related papers: Monogenity in totally complex sextic fields, revis…
A number field $K$ is called \emph{monogenic} if its ring of integers $\mathbb{Z}_K$ can be expressed as a simple ring extension $\mathbb{Z}[\alpha]$ for some $\alpha \in \mathbb{Z}_K$. A monic irreducible polynomial $f(x)\in\mathbb{Z}[x]$…
Consider the integral polynomials $f_{a,b}(x)=x^4+ax+b$ and $g_{c,d}(x)=x^4+cx^3+d$. Suppose $f_{a,b}(x)$ and $g_{c,d}(x)$ are irreducible, $b\mid a$, and the integers $b$, $d$, $256d-27c^4$, and $\dfrac{256b^3-27a^4}{\gcd(256b^3,27a^4)}$…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
Let $K$ be a pure number field generated by a complex root of a monic irreducible polynomial $F(x)=x^{60}-m\in \mathbb{Z}[x]$, with $m\neq \pm1$ a square free integer. In this paper, we study the monogeneity of $K$. We prove that if…
For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…
We remark on pseudo-elliptic integrals and on exceptional function fields, namely function fields defined over an infinite base field but nonetheless containing non-trivial units. Our emphasis is on some elementary criteria that must be…
We give a precise description of how the class group of a number field measures the failure of unique factorization in its ring of integers. Specifically, following ideas of Kummer, we determine the structure of all irreducible…
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
We construct an infinite family of imaginary quadratic number fields with 2-class groups of type (2,2,2) whose Hilbert 2-class fields are finite.
We exhibit a method to numerically compute power series expansions of modular forms on a cocompact Fuchsian group, using the explicit computation a fundamental domain and linear algebra.
We prove an asymptotic formula for the number of multi-quadratic number fields of bounded discriminant with a power-saving error term. Furthermore, we explicitly calculate the leading coefficient and extend our result to totally real…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We analyse the algebras generated by free component quantum fields together with the susy generators $Q,\bar Q$. Restricting to hermitian fields we first construct the scalar field algebra from which various scalar superfields can be…
We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…
Invariant theory provides more efficient tools, such as Molien generating functions and integrity bases, than basic group theory, that relies on projector techniques for the construction of symmetry--adapted polynomials in the symmetry…
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…