相关论文: On the tame kernels of imaginary cyclic quartic fi…

Let $O$ be an order of odd discriminant $D$ in an imaginary quadratic field $K$. Let $Cl(O)$ be the group of proper $O$-ideals and $Cl(O)[2]$ the kernel of multiplication by $2$ in $Cl(O)$. We describe explicitly the group $Cl(O)[2]$. In…

We use the polynomials $m_s(t) = t^2 - 4 s$, $s \in \{-1, 1\}$, in an elementary process giving arbitrary large lists of {\it fundamental units} of quadratic fields of discriminants listed in ascending order. More precisely, let $\mathbf{B}…

The theory of continued fractions of functions $ \sqrt D $ is used to give lower bound for class numbers $h(D)$ of general real quadratic function fields $K=k(\sqrt D)$ over $k={\bf F}_q(T)$. For five series of real quadratic function…

We fill the gaps in A. Gica's determination of all the odd positive integers $d$ for which the number of distinct prime divisors of $f_d(x)=d+x^2$ is less than or equal to $2$ for all the positive and odd integers $x\leq\sqrt{d}$. We also…

We determine the squarefree part of the scalar factor that arises when the quartic invariant of the generic binary form $F$ of odd degree $2n+1$ is expressed as the discriminant of the unique quadratic covariant $(F,F)_{2n}$. This…

We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…

Let $n\ge1$, $r\ge0$ and $s\ge0$ be integers satisfying $4+r+3 s\le3^{n+1}$. Given linear polynomials $f_{i}(x)=m_{i} x+n_{i}$ for $1 \le i \le r+s$, where the coefficients $m_{i} , n_{i}$ are positive integers satisfying certain…

Let $K$ be a field of char $K\neq 2$. For $a\in K$, we give an explicit answer to the field isomorphism problem of the simplest quartic polynomial $X^4-aX^3-6X^2+aX+1$ over $K$ as the special case of the field intersection problem via…

Some PARI programs have bringed out a property for the non-genus part of the class number of the imaginary quadratic fields, with respect to $(\sqrt D\,)^{\varepsilon}$, where $D$ is the absolute value of the discriminant and $\varepsilon…

Fix a Galois extension E/F of totally real number fields such that the Galois group G has exponent 2. Let S be a finite set of primes of F containing the infinite primes and all those which ramify in E, let S_E denote the primes of E lying…

Let $C$ be a curve defined over a number field $K$. A point $P\in C(\overline{\mathbb{Q}})$ is called $K$-quadratic if $[K(P):K]=2$. Let $K$ be a number field such that the rank of the elliptic curves $E_1:\,y^2= x^3 + 4x$ and $E_2:\,y^2=…

Let $n$ be a positive square-free integer, where every odd prime factor of $n$ has form $8a\pm 1$. We determine when $n$ is non-congruent with second minimal $2$-primary Shafarevich-Tate group, in terms of the $4$-ranks of class groups and…

We construct an infinite family of pairs of distinct imaginary biquadratic fields and pairs of distinct imaginary cyclic quartic fields with the same discriminant and regulator. We also construct an infinite family of imaginary biquadratic…

Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher…

We prove that, for any $\varepsilon>0$, the number of real quadratic fields $\mathbb{Q}(\sqrt{d})$ of discriminant $d<x$ whose class number is $\ll \sqrt{d}(\log{d})^{-2}(\log\log{d})^{-1}$ is at least $x^{1/2-\varepsilon}$ for $x$ large…

Fix a relative quadratic extension E/F of totally real number rields and let G denote the Galois group of order 2. Let S be a finite set of primes of F containing the infinite primes and all those which ramify in E, let S_E denote the…

We introduce a class of algorithms for constructing Fourier representations of Gaussian processes in $1$ dimension that are valid over ranges of hyperparameter values. The scaling and frequencies of the Fourier basis functions are evaluated…

We explore the implications of restricting the framework of quantum theory and quantum computation to finite fields. The simplest proposed theory is defined over arbitrary finite fields and loses the notion of unitaries. This makes such…

Quantum kernel methods are a promising branch of quantum machine learning, yet their effectiveness on diverse, high-dimensional, real-world data remains unverified. Current research has largely been limited to low-dimensional or synthetic…