Related papers: Computing the Hilbert Class Fields of Quartic CM F…

A new class of bivariate poly-analytic Hermite polynomials is considered. We show that they are realizable as the Fourier-Wigner transform of the univariate complex Hermite functions and form a nontrivial orthogonal basis of the classical…

Quantum machine learning is the field that aims to integrate machine learning with quantum computation. In recent years, the field has emerged as an active research area with the potential to bring new insights to classical machine learning…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

We introduce the projective Hermite constant for positive definite binary hermitian forms associated with an imaginary quadratic number field $K$. It is a lower bound for the classical Hermite constant, and these two constants coincide when…

Let $\ell$ and $p$ be odd primes. For a positive integer $\mu$ let $k_\mu$ be the ray class field of $k=\mathbb{Q}(e^{2\pi i/\ell})$ modulo $2p^\mu$. We present certain class fields $K_\mu$ of $k$ such that $k_\mu\leq K_\mu\leq k_{\mu+1}$,…

We compute the minimal polynomials of the Ramanujan values $t_n$, where $n\equiv 11 \mod 24$, using Shimura reciprocity law. These polynomials can be used for defining the Hilbert class field of the imaginary quadratic field…

By introducing a class of meromorphic functions with certain ramification structures on $\Bbb{CP}^1$, a new method for the determination of the Legendre representation of elliptic curves with complex multiplication is introduced. These…

We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…

This is an English translation of the monograph "Die Klassenk\"orper der komplexen Multiplikation" by Max Deuring, published in 1958 as Enzyklop\"adie der Mathematischen Wissenschaften, Band I-2, Heft 10, Teil II by B.G. Teuber…

We propose a mathematical framework that we call quantum, higher-order Fourier analysis. This generalizes the classical theory of higher-order Fourier analysis, which led to many advances in number theory and combinatorics. We define a…

We consider families of special cycles, as introduced by Kudla, on Shimura varieties attached to anisotropic quadratic spaces over totally real fields. By augmenting these cycles with Green currents, we obtain classes in the arithmetic Chow…

Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…

We consider generalized $\Lambda$-structures on algebras and schemes over the ring of integers $\mathit{O}_K$ of a number field $K$. When $K=\mathbb{Q}$, these agree with the $\lambda$-ring structures of algebraic K-theory. We then study…

Machine learning and quantum computing are two technologies that are causing a paradigm shift in the performance and behavior of certain algorithms, achieving previously unattainable results. Machine learning (kernel classification) has…

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…

In this article we mainly consider the positively Z-graded polynomial ring R=F[X,Y] over an arbitrary field F and Hilbert series of finitely generated graded R-modules. The central result is an arithmetic criterion for such a series to be…

Let $q$ be a power of a prime number $p$, $k=\mathbb{F}_{q}(t)$ be the rational function field over finite field $\mathbb{F}_{q}$ and $K/k$ be a multi-cyclic extension of prime degree. In this paper we will give an exact formula for the…

This article extends the study of cyclic ramified covers of the projective line defined by Kummer equations. We consider the most general case of such covers, allowing arbitrary orders in the roots of the generating radicant. The primary…