Related papers: Quadratic Probabilistic Algorithms for Normal Base…

Let $F$ be a non--Archimedean local field of characteristic $\geq 0$, and let $G=GL(N,F)$, $N\geq 1$. An element $\gamma\in G$ is said to be quasi--regular if the centralizer of $\gamma$ in $M(N,F)$ is a product of field extensions of $F$.…

Let $G$ be a classical group of dimension $d$ and let $\boldsymbol{a}=(a_1,\dots,a_d)$ be differential indeterminates over a differential field $F$ of characteristic zero with algebraically closed field of constants $C$. Further let…

Grover's algorithm is one of the pioneering demonstrations of the advantages of quantum computing over its classical counterpart, providing - at most - a quadratic speed-up over the classical solution for unstructured database search. The…

Let $K$ be a complete local field of characteristic $p$ with perfect residue field. Let $L/K$ be a finite, fully ramified, Galois $p$-extension. If $\pi_L\in L$ is a prime element, and $p'(x)$ is the derivative of $\pi_L$'s minimal…

We present computational results which strongly support a conjecture of Morgan and Mullen (1996), which states that for every extension $E/F$ of Galois fields there exists a primitive element of $E$ which is completely normal over $F$.

This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…

A primitive completely normal element for an extension $\mathbb{F}_{q^n}/\mathbb{F}_{q}$ of Galois fields is a generator of the multiplicative group of $\mathbb{F}_{q^n}$, which simultaneously is normal over every intermediate field of that…

Given a number field $K$, a finite abelian group $G$ and finitely many elements $\alpha_1,\ldots,\alpha_t\in K$, we construct abelian extensions $L/K$ with Galois group $G$ that realise all of the elements $\alpha_1,\ldots,\alpha_t$ as…

Normal bases and self-dual normal bases over finite fields have been found to be very useful in many fast arithmetic computations. It is well-known that there exists a self-dual normal basis of $\mathbb{F}_{2^n}$ over $\mathbb{F}_2$ if and…

Andrews and Petsche proposed in 2020 a conjectural characterization of all pairs $(f,\alpha)$, where $f$ is a polynomial over a number field $K$ and $\alpha\in K$, such that the dynamical Galois group of the pair $(f,\alpha)$ is abelian. In…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…

In this paper we present an algorithm to compute a Standard Basis for a fractional ideal $\mathcal{I}$ of the local ring $\mathcal{O}$ of an $n$-space algebroid curve with several branches. This allows us to determine the semimodule of…

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…

Assume $F$ is a finite field of order $p^f$ and $q$ is an odd prime for which $p^f-1=sq^m$, where $m \ge 1$ and $(s,q)=1$. In this article, we obtain the order of symmetric and unitary subgroup of the semisimple group algebra $FC_q.$…

It has been a well-known problem in the $G$-framework that it is hard to compute the sublinear expectation of the $G$-normal distribution $\hat{\mathbb{E}}[\varphi(X)]$ when $\varphi$ is neither convex nor concave, if not involving any PDE…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…

Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant…

We study the normal subgroup <f> generated by a non trivial element f in the group G of complex plane polynomial automorphisms having Jacobian determinant 1. On one hand if f has length at most 8 relatively to the classical amalgamated…

In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…