相关论文: Computation of the Kummer ratio of the class numbe…

Let $p$ be a prime. The $2$-primary part of the class group of the pure quartic field $\mathbb{Q}(\sqrt[4]{p})$ has been determined by Parry and Lemmermeyer when $p \not\equiv \pm 1\bmod 16$. In this paper, we improve the known results in…

For any $\epsilon>0$, there exists $q_0(\epsilon)$ such for any $q\ge q_0(\epsilon)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three…

Let $P$ be the set of all prime numbers, ${q_1},{q_2}, \cdots ,{q_m} \in P$, $P_k$ be the k-th $(k = 1,2, \cdots m)$ element of $P$ in ascending order of size, ${\alpha _1},{\alpha _2}, \cdots ,{\alpha _m}$ be positive integers, and ${\beta…

We present a randomized algorithm that on input a finite field $K$ with $q$ elements and a positive integer $d$ outputs a degree $d$ irreducible polynomial in $K[x]$. The running time is $d^{1+\epsilon(d)} \times (\log q)^{5+\epsilon(q)}$…

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

It is shown that the sum of class numbers of orders in totally complex quartic fields with no real quadratic subfield obeys an asymptotic law similar to the prime numbers, as the bound on the regulators tends to infinity. Here only orders…

Let $p>1$ be a large prime number, let $q=O(\log\log p)$ and let $1\leq a<q$ be a pair of relatively prime integers. It is proved that there is a prime primitive root $u\ll (\log p)(\log \log p)^5$ such that $u\equiv a\bmod q$ in the prime…

It is commonly known that $\zeta(2k) = q_{k}\frac{\zeta(2k + 2)}{\pi^2}$ with known rational numbers $q_{k}$. In this work we construct recurrence relations of the form $\sum_{k = 1}^{\infty}r_{k}\frac{\zeta(2k + 1)}{\pi^{2k}} = 0$ and show…

Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\M$ the maximal ideal of $A$. The first main result of this paper is a…

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…

For any positive integer $q\geq 2$ and any real number $\delta\in(0,1)$, let $\alpha_q(n,\delta n)$ denote the maximum size of a subset of $\mathbb{Z}_q^n$ with minimum Hamming distance at least $\delta n$, where…

For any integer $\rho \geq 1$ and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=3 and with covering radius $\rho$ is given. The intersection array…

This note is a stripped down version of a published paper on the Potts partition function, where we concentrate solely on the linear coding aspect of our approach. It is meant as a resource for people interested in coding theory but who do…

We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…

In this paper, we compute the unit groups and the $2$-class numbers of the Fr\"ohlich's triquadratic fields $\KK=\mathbb{Q}(\sqrt{2},\sqrt{p},\sqrt{q})$, where $p$ and $q$ are two prime numbers such that ($p\equiv 1 \pmod8$ and $q\equiv 3…

Under the assumption that the quantum parameter $q$ is an $l$-th primitive root of unity with $l$ odd in a field $F$ of characteristic 0 and $m+n\geq r$, we obtained a complete classification of irreducible modules of the $q$-Schur…

We give an algorithm to explicitly determine all elements of the $q$-torsion (for $q$ an odd prime) of the Brauer group of an elliptic curve over any base field of characteristic different from $q$, containing a primitive $q$-th root of…

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field…

Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\vars$. Our first result is a reformulation of the classical Hensel's…