Related papers: Computation of the Kummer ratio of the class numbe…

In this article we give a modern interpretation of Kummer's ideal numbers and show how they developed from Jacobi's work on cyclotomy, in particular the methods for studying "Jacobi sums" which he presented in his lectures on number theory…

We provide rapidly converging formulae for the Riemann zeta function at odd integers using the Lambert series $\mathscr{L}_q(s) = \sum_{n=1}^\infty n^{s} q^{n}/(1-q^n)$, $s=-(4k\pm 1)$. Our main formula for $\zeta(4k-1)$ converges at rate…

In this article, we derive a Euler prime product formula for the magnitude of the Riemann zeta function $\zeta(s)$ valid for $\Re(s)>1$, as well as similar formulas for $\zeta(s)$ valid for an even and odd $k$th positive integer argument.…

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…

The class numbers $h^{+}$ of the real cyclotomic fields are very hard to compute. Methods based on discriminant bounds become useless as the conductor of the field grows and methods employing Leopoldt's decomposition of the class number…

Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the…

Fix a modulus $q$. One would expect the number of primes in each invertible residue class mod $q$ to be multinomially distributed, i.e. for each $p \,\mathrm{mod}\, q$ to behave like an independent random variable uniform on…

Determining the maximum number of unit vectors in $\mathbb{R}^r$ with no pairwise inner product exceeding $\alpha$ is a fundamental problem in geometry and coding theory. In 1955, Rankin resolved this problem for all $\alpha \leq 0$ and in…

Let $K$ be a totally real number field of degree $r=[K:\mathbb{Q}]$ and let $p$ be an odd rational prime. Let $K_{\infty}$ denote the cyclotomic $\mathbb{Z}_{p}$-extension of $K$ and let $L_{\infty}$ be a finite extension of $K_{\infty}$,…

Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…

Let $p\equiv -q \equiv 5\pmod 8$ be two prime integers. In this paper, we investigate the unit groups of the fields $ L_1 =\mathbb{Q}(\sqrt 2, \sqrt{p}, \sqrt{q}, \sqrt{-1} )$ and $ L_1^+=\mathbb{Q}(\sqrt 2, \sqrt{p}, \sqrt{q} )$.…

There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

In this work, we study the computational complexity of quantum determinants, a $q$-deformation of matrix permanents: Given a complex number $q$ on the unit circle in the complex plane and an $n\times n$ matrix $X$, the $q$-permanent of $X$…

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…

Let $d$ be an odd square-free integer, $m\geq 3$ any integer and $L_{m, d}:=\mathbb{Q}(\zeta_{2^m},\sqrt{d})$. In this paper, we shall determine all the fields $L_{m, d}$ having an odd class number. Furthermore, using the cyclotomic…

Let $\UT_n(q)$ denote the group of unipotent $n\times n$ upper triangular matrices over a field with $q$ elements. The degrees of the complex irreducible characters of $\UT_n(q)$ are precisely the integers $q^e$ with $0\leq e\leq \lfloor…

An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark that some…