Related papers: Cyclotomic System and their Arithmetic

The Prime state of $n$ qubits, $|\mathbb{P}_n\rangle$, is defined as the uniform superposition of all the computational-basis states corresponding to prime numbers smaller than $2^n$. This state encodes, quantum mechanically, arithmetic…

Let l be an odd prime. For primes, p \equiv 1 (mod l), Gauss (l = 3) and Dickson (l = 5) considered the Diophantine systems in terms of which cyclotomic numbers of order 3 and 5 were obtained. The aim of this paper is to show how to obtain…

We establish that the sequences formed by logarithms and by "fractional" powers of integers, as well as the sequence of prime numbers, are non-holonomic, thereby answering three open problems of Gerhold [Electronic Journal of Combinatorics…

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

Let $d$ be a positive integer. For a finite set $X \subseteq \mathbb{R}^d$, we define its integer cone as the set $\mathsf{IntCone}(X) := \{ \sum_{x \in X} \lambda_x \cdot x \mid \lambda_x \in \mathbb{Z}_{\geq 0} \} \subseteq \mathbb{R}^d$.…

The Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ asks one to show that if $E \subset \mathbb{Z}_q^d$ is of sufficiently large cardinality, then $\Delta(E) := \{(x_1 - y_1)^2 + \dots + (x_d - y_d)^2 : x, y \in E\}$ satisfies…

Many promising quantum algorithms in economics, medical science, and material science rely on circuits that are parameterized by a large number of angles. To ensure that these algorithms are efficient, these parameterized circuits must be…

Let q be a power of a prime and E be an elliptic curve defined over F_q. In "Combinatorial aspects of elliptic curves" [17], the present author examined a sequence of polynomials which express the N_k's, the number of points on E over the…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

For each prime number $\ell$ and for each imaginary quadratic order of class number one or two, we determine all the possible $\ell$-adic Galois representations that occur for any elliptic curve with complex multiplication by such an order…

In this paper, a new $q$-supercongruence with two free parameters modulo the fourth power of a cyclotomic polynomial is obtained. Our main auxiliary tools are Watson's $_8\phi_7$ transformation formula for basic hypergeometric series, the…

In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…

We give a characterization of the codomain $[\ell]E(k)$ of the multiplication-by-$\ell$ map $[\ell]$ in the case of elliptic curves over a field $k$ of characteristic $\ne 2,3$ with $\ell$-torsion $E[\ell]=\langle W_1,W_2 \rangle$ fully…

We show that any irreducible representation $\rho$ of a finite group $G$ of exponent $n$, realisable over $\mathbb{R}$, is realisable over the field $E:=\mathbb{Q}(\zeta_n)\cap\mathbb{R}$ of real cyclotomic numbers of order $n$, and…

Let p be an odd prime. Let K = \Q(zeta) be the p-cyclotomic number field. Let v be a primitive root mod p and sigma : zeta --> zeta^v be a \Q-isomorphism of the extension K/\Q generating the Galois group G of K/\Q. For n in Z, the notation…

In this study, a distinctive feature of quantum computation (QC) is characterized. To this end, a seemingly-powerful classical computing model, called "stochastic ensemble machine (SEnM)," is considered. The SEnM runs with an ensemble…

Consider an elliptic curve defined over an imaginary quadratic field $K$ with good reduction at the primes above $p\geq 5$ and has complex multiplication by the full ring of integers $\mathcal{O}_K$ of $K$. In this paper, we construct…

Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…

We construct certain elements in the integral motivic cohomology group $H^3_{{\cal M}}(E \times E',\Q(2))_{\ZZ}$, where $E$ and $E'$ are elliptic curves over $\Q$. When $E$ is not isogenous to $E'$ these elements are analogous to…

Let $q$ be a sufficiently large integer, and $a_0\in\{0,\dots,q-1\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their base $q$ expansion. Similar results are obtained for values of a polynomial…