Related papers: Efficient computation of the Euler-Kronecker const…
This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…
Given a prime q and a negative discriminant D, the CM method constructs an elliptic curve E/\Fq by obtaining a root of the Hilbert class polynomial H_D(X) modulo q. We consider an approach based on a decomposition of the ring class field…
We construct a new Euler system (anticyclotomic, in the sense of Jetchev-Nekovar-Skinner) for the Galois representation $V_{f,\chi}$ attached to a newform $f$ of weight $k\geq 2$ twisted by an anticyclotomic Hecke character $\chi$ defined…
Let $E(X)$ denote the number of even integers below $X$ which are not a sum of two primes. We prove the bound $E(X)=O(X^{\frac{7}{10}})$, where the implicit constant is ineffective. The method applied here also leads to $P(q)=O(q^5)$, where…
In this work, we consider the generating function of Kim's q-Euler polynomials and introduce new generalization of q-Genocchi polynomials and numbers of higher order. Also, we give surprising identities for studying in Analytic Numbers…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…
In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…
The Kronecker coefficients are the structure constants for the restriction of irreducible representations of the general linear group $GL(n m)$ into irreducibles for the subgroup $GL(n)\times GL(m)$. In this work we study the…
In this paper we establish a connection between the Gauss factorials and Iwasawa's cyclotomic $\lambda$-invariant for an imaginary quadratic field $K$. As a result, we will explain a corespondance between the 1-exceptional primes of…
Let $H= \mathbb{Q}(\zeta_{n} + {\zeta_{n}}^{-1})$ and $\ell$ be an odd prime such that $q \equiv 1 \pmod \ell$ for some prime factor $q$ of $n$. We get a bound on the $\ell$-rank of the class group of $H$(under some conditions) in terms of…
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…
In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…
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…
The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta…
Auger electron spectroscopy, a way of characterizing electronic structure through core-level decay processes, is widely used in materials characterization; however direct calculation from molecular geometry requires accurate treatment of…
Let $\mathcal{A}_n$ be the $2$-part of the ideal class group of the $n$-th layer of the cyclotomic $\mathbb{Z}_2$-extension of a real quadratic number field $F$. The cardinality of $\mathcal{A}_n$ is related to the index of cyclotomic units…
A general and fast method is conceived for computing the cyclic convolution of n points, where n is a prime number. This method fully exploits the internal structure of the cyclic matrix, and hence leads to significant reduction of the…
We define the generalized-Euler-constant function $\gamma(z)=\sum_{n=1}^{\infty} z^{n-1} (\frac{1}{n}-\log \frac{n+1}{n})$ when $|z|\leq 1$. Its values include both Euler's constant $\gamma=\gamma(1)$ and the "alternating Euler constant"…
We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than 2^n, where n is the number of qubits of the register. This Prime state can be built using Grover's algorithm,…