Related papers: Quadratic Probabilistic Algorithms for Normal Base…

Let $K$ be an imaginary quadratic field with discriminant $d_K\leq-7$. We deal with problems of constructing normal bases between abelian extensions of $K$ by making use of singular values of Siegel functions. First, we show that a…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

For $q=3^r$ ($r>0$), denote by $\mathbb{F}_q$ the finite field of order $q$ and for a positive integer $m\geq2$, let $\mathbb{F}_{q^m}$ be its extension field of degree $m$. We establish a sufficient condition for existence of a primitive…

All finite simple groups are determined with the property that every Galois orbit on conjugacy classes has size at most 4. From this we list all finite simple groups $G$ for which the normalized group of central units of the integral group…

We present a semiclassical calculation of the generalized form factor which characterizes the fluctuations of matrix elements of the quantum operators in the eigenbasis of the Hamiltonian of a chaotic system. Our approach is based on some…

For a finite group $G$, we study the probability $sp(G)$ that, given two elements $x,y \in G$, the cyclic subgroup $\langle x \rangle$ is subnormal in the subgroup $\langle x, y \rangle$. This can be seen as an intermediate invariant…

Fix a number field $K$. For each nonzero $\alpha \in \mathbb{Z}_K$, let $\nu(\alpha)$ denote the number of distinct, nonassociate irreducible divisors of $\alpha$. We show that $\nu(\alpha)$ is normally distributed with mean proportional to…

We describe a simple algorithm for estimating the $k$-th normalized Betti number of a simplicial complex over $n$ elements using the path integral Monte Carlo method. For a general simplicial complex, the running time of our algorithm is…

Let $V$ be a finite-dimensional vector space over a finite field, and suppose $G \leq \Gamma \mathrm{L}(V)$ is a group with a unique subnormal quasisimple subgroup $E(G)$ that is absolutely irreducible on $V$. A base for $G$ is a set of…

In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…

Unstructured search remains as one of the significant challenges in computer science, as classical search algorithms become increasingly impractical for large-scale systems due to their linear time complexity. Quantum algorithms, notably…

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

Let $L/K$ be a finite Galois extension whose Galois group $G$ is non-abelian and characteristically simple. Using tools from graph theory, we shall give a closed formula for the number of Hopf-Galois structures on $L/K$ with associated…

Given a number field $K$ that is a subfield of the real numbers, we generalize the notion of the classical Frobenius problem to the ring of integers $\mathfrak{O}_K$ of $K$ by describing certain Frobenius semigroups,…

Let k be a field of characteristic 2 and let L/k be a finite Galois extension with Galois group G. We show the equivalence of the following two properties: (*) The group G is generated by elements of order 2 and by elements of odd order.…

There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or…

We consider the problem of search of an unstructured list for a marked element, when one is given advice as to where this element might be located, in the form of a probability distribution. The goal is to minimise the expected number of…

Estimating the normalizing constant of an unnormalized probability distribution has important applications in computer science, statistical physics, machine learning, and statistics. In this work, we consider the problem of estimating the…

An element $\alpha \in \mathbb F_{q^n}$ is \emph{normal} if $\mathcal{B} = \{\alpha, \alpha^q, \ldots, \alpha^{q^{n-1}}\}$ forms a basis of $\mathbb F_{q^n}$ as a vector space over $\mathbb F_{q}$; in this case, $\mathcal{B}$ is a normal…

Let G be a simply connected semisimple algebraic group over an algebraically closed field k of characteristic 0 and let V be a rational simple G-module of finite dimension. If G/H \subset P(V) is a spherical orbit and if X is its closure,…