Related papers: Constructing Picard curves with complex multiplica…

We give some new $q$-supercongruences on truncated forms of squares of basic hypergeometric series. Most of them are modulo the cube of a cyclotomic polynomial, and two of them are modulo the fourth power of a cyclotomic polynomial. The…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

Genus 2 curves have been an object of much mathematical interest since eighteenth century and continued interest to date. They have become an important tool in many algorithms in cryptographic applications, such as factoring large numbers,…

For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…

In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…

In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…

We develop a mixed-characteristic version of the Mori-Mukai technique for producing rational curves on K3 surfaces. We reduce modulo p, produce rational curves on the resulting K3 surface over a finite field, and lift to characteristic…

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 present a new algorithm to compute the classical modular polynomial Phi_n in the rings Z[X,Y] and (Z/mZ)[X,Y], for a prime n and any positive integer m. Our approach uses the graph of n-isogenies to efficiently compute Phi_n mod p for…

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

A classical technique to construct polynomial preserving extensions of scalar functions defined on the boundary of an $n$ simplex to the interior is to use so-called rational blending functions. The purpose of this paper is to generalize…

In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

We adapt the CRT approach for computing Hilbert class polynomials to handle a wide range of class invariants. For suitable discriminants D, this improves its performance by a large constant factor, more than 200 in the most favourable…

Classical theory of Complex Multiplication (CM) shows that all abelian extensions of a complex quadratic field $K$ are generated by the values of appropriate modular functions at the points of finite order of elliptic curves whose…

Let $E/\mathbb{Q}$ be an elliptic curve and let $p\ge 5$ be a prime of good supersingular reduction. We generalize results due to Meng Fai Lim proving Kida's formula and integrality results for characteristic elements of signed Selmer…

Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the…

The theory of Q-Cartier divisors on the space of n-pointed, genus 0, stable maps to projective space is considered. Generators and Picard numbers are computed. A recursive algorithm computing all top intersection products of Q-Divisors is…

We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…