Related papers: Efficient computation of the Euler-Kronecker const…

We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$ up to factors of size $e^{O(q^2)}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, for all real $1 \leq q \leq \frac{c\log x}{\log\log…

We prove a strengthening of the "reciprocity conjecture" of Khare and Wintenberger. The input to the original conjecture is an odd prime p, a CM number field F containing the pth roots of unity, and a pair of primes of the maximal totally…

In this paper we use techniques first introduced by Florea to improve the asymptotic formula for the first moment of the quadratic Dirichlet L-functions over the rational function field, running over all monic, square-free polynomials of…

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N \alpha \le x} \mathfrak{t}_k(\alpha)$, where $N$ stands for the norm of a…

In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…

This paper introduces a novel class of prime-generating quadratic polynomials defined by $f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + \frac{(2Zk - 1)^2 + H}{4}$, where $Zk \in \mathbb{Z}_{\geq 0}$ and $H$ belongs to the set of Heegner numbers. This…

By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…

This paper has two parts. The first part surveys Euler's work on the constant gamma=0.57721... bearing his name, together with some of his related work on the gamma function, values of the zeta function and divergent series. The second part…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

In this paper, we study the quantum virtual Grothendieck ring, denoted by $\frakK_q(\g)$, which was introduced in [39], and further investigated in [26, 25]. Our approach involves examining this ring from two perspectives: first, by…

Let $\UT_n(q)$ denote the unitriangular group of unipotent $n\times n$ upper triangular matrices over a finite field with cardinality $q$ and prime characteristic $p$. It has been known for some time that when $p$ is fixed and $n$ is…

Let $K$ be an imaginary quadratic field and $p$ a prime split in $K$. In this paper we construct an anticyclotomic Euler system for the adjoint representation attached to elliptic modular forms base changed to $K$. We also relate our Euler…

The main goal of this paper is to prove a formula that expresses the limit behaviour of Dedekind zeta functions for $\Re s > 1/2$ in families of number fields, assuming that the Generalized Riemann Hypothesis holds. This result can be…

Kinematics of rigid bodies can be analyzed in many different ways. The advantage of using Euler parameters is that the resulting equations are polynomials and hence computational algebra, in particular Gr\"obner bases, can be used to study…

This paper proves the RLWE-PLWE equivalence for the maximal real subfields of the cyclotomic fields with conductor $n = 2^r p^s$, where $p$ is an odd prime, and $r \geq 0$ and $s \geq 1$ are integers. In particular, we show that the…

The second generalized GK function fields $K_n$ are a recently found family of maximal function fields over the finite field with $q^{2n}$ elements, where $q$ is a prime power and $n \ge 1$ an odd integer. In this paper we construct many…

Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…

Graph Neural Networks (GNNs) are promising surrogates for quantum mechanical calculations as they establish unprecedented low errors on collections of molecular dynamics (MD) trajectories. Thanks to their fast inference times they promise…

Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…