Related papers: Subquadratic-Time Algorithms for Normal Bases

This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…

Constructing a classical potential suited to simulate a given atomic system is a remarkably difficult task. This chapter presents a framework under which this problem can be tackled, based on the Bayesian construction of nonparametric force…

Let f(x) = x^n + (a[n-1] t + b[n-1]) x^(n-1) + ... + (a[0] t + b[0]) be of constant degree n in x and degree <= 1 in t, where all a[i],b[i] are randomly and uniformly selected from a finite field GF(q) of q elements. Then the probability…

Let L be a finite Galois extension of K with Galois group G. We decompose any idempotent 2-cocycle f using finite sequences of descending two-sided ideals of the corresponding weak crossed product algebra A:= (L/k, G, f). We specialise the…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

In the framework of started in Ref.[1] construction procedure of the general superfield quantization method for gauge theories in Lagrangian formalism the rules for Hamiltonian formulation of general superfield theory of fields (GSTF) are…

We classify skew braces that are the semidirect product of an ideal and a left ideal. As a consequence, given a Galois extension of fields $ L/K $ whose Galois group is the semidirect product of a normal subgroup $ A $ and a subgroup $ B $,…

For a Galois extension $K/\mathbb{F}_q(t)$ of Galois group $\Gamma$ with $\gcd(q,|\Gamma|)=1$, we define an invariant $\omega_K$, and show that it determines the Weil pairing of the curve corresponding to $K$ and it descends to the…

For a finite field $\mathbb{F}$, it is a basic result of Galois theory that the fixed field $E$ of $\text{Aut}(\mathbb{F}(x)/\mathbb{F})$ is a proper extension of $\mathbb{F}$. In this expository paper we construct, for all finite fields,…

In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

Given a number field $k$, we show that, for many finite groups $G$, all the Galois extensions of $k$ with Galois group $G$ cannot be obtained by specializing any given finitely many Galois extensions $E/k(T)$ with Galois group $G$ and $E/k$…

Let $K$ be a field whose characteristic is prime to a fixed integer $n$ with $\mu_n \subset K$, and choose $\omega \in \mu_n$ a primitive $n$th root of unity. Denote the absolute Galois group of $K$ by $\operatorname{Gal}(K)$, and the…

Let $q$ be a prime power and, for each positive integer $n\ge 1$, let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements. Motivated by the well known concept of normal elements over finite fields, Huczynska et al (2013) introduced…

Complex functions $\chi (m)$ where $m$ belongs to a Galois field $GF(p^ \ell)$, are considered. Fourier transforms, displacements in the $GF(p^ \ell) \times GF(p^ \ell)$ phase space and symplectic $Sp(2,GF(p^ \ell))$ transforms of these…

Systems of free particles in a quantum theory based on a Galois field (GFQT) are discussed in detail. In this approach infinities cannot exist, the cosmological constant problem does not arise and one irreducible representation of the…

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

We consider families of quasiplatonic Riemann surfaces characterised by the fact that -- as in the case of Fermat curves of exponent $n$ -- their underlying regular (Walsh) hypermap is the complete bipartite graph $ K_{n,n} $, where $ n $…

The \emph{Fast Gaussian Transform} (FGT) enables subquadratic-time multiplication of an $n\times n$ Gaussian kernel matrix $\mathsf{K}_{i,j}= \exp ( - \| x_i - x_j \|_2^2 ) $ with an arbitrary vector $h \in \mathbb{R}^n$, where $x_1,\dots,…

An element w of the extension E of degree n over the finite field F=GF(q) is called free over F if {w, w^q,...,w^{q^{n-1}}} is a (normal) basis of E/F. The Primitive Normal Basis Theorem, first established in full by Lenstra and Schoof…