Related papers: Hypergeometric $L$-functions in average polynomial…

We present a new general method for performing basic arithmetic in the finite field~$\mathbb{F}_p$ for any prime $p>2$ by using traditional binary operations over~$\mathbb{F}_2$. Our new approach is efficient and competitive with current…

Based on the observation that $\mathbb{Q}^{(p-1) \times (p-1)}$ is isomorphic to a quotient skew polynomial ring, we propose a new method for $(p-1)\times (p-1)$ matrix multiplication over $\mathbb{Q}$, where $p$ is a prime number. The main…

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

We introduce a new collection of partially global Galois cohomology classes subsuming both plectic Heegner points and mock plectic invariants. The former are recovered as localizations of plectic Heegner classes, while the latter arise as…

We analyse and drastically improve the running time of the algorithm of Mazur, Stein and Tate for computing the canonical cyclotomic p-adic height of a point on an elliptic curve E/Q, where E has good ordinary reduction at p >= 5.

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

Let $g \geq 1$ be an integer and let $A/\mathbb{Q}$ be an abelian variety that is isogenous over $\mathbb{Q}$ to %the product $E_1 \times \ldots \times E_g$ of elliptic curves $E_1/\mathbb{Q}$, $\ldots$, $E_g/\mathbb{Q}$, without complex…

We identify the $p$-adic unit roots of the zeta function of a projective hypersurface over a finite field of characteristic $p$ as the eigenvalues of a product of special values of a certain matrix of $p$-adic series. That matrix is a…

In this note, we construct explicit bases for spaces of overconvergent $p$-adic modular forms when $p=2,3$ and study their stability under the Atkin operator. The resulting extension of the algorithms of Lauder is illustrated with…

Let E be an elliptic curve with complex multiplication by R, where R is an order of discriminant D<-4 of an imaginary quadratic field K . If a prime number p is decomposed completely in the ring class field associated with R, then E has…

We study the sequence of zeta functions $Z(C_p,T)$ of a generic Picard curve $C:y^3=f(x)$ defined over $\mathbb{Q}$ at primes $p$ of good reduction for $C$. We define a degree 9 polynomial $\psi_f\in \mathbb{Q}[x]$ such that the splitting…

Generalized trigonometric functions are applied to the Legendre-Jacobi standard form of complete elliptic integrals, and a new form of the generalized complete elliptic integrals of the Borweins is presented. According to the form, it can…

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…

Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…

Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an…

Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…

We study the question of when the coefficients of a hypergeometric series are p-adically unbounded for a given rational prime p. Our first main result is a necessary and sufficient criterion (applicable to all but finitely many primes) for…

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

In the combinatorial method proving of $L^p$-improving estimates for averages along curves pioneered by Christ (IMRN, 1998), it is desirable to estimate the average modulus (with respect to some uniform measure on a set) of a…