Related papers: Plane quartics over $\mathbb{Q}$ with complex mult…
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
We give some methods for computing equations for certain Shimura curves, natural maps between them, and special points on them. We then illustrate these methods by working out several examples in varying degrees of detail. For instance, we…
We construct 9-parameter and 13-parameter dynamical systems of the plane which map bi-quadratic curves to other bi-quadratic curves and return to the original curve after two iterations. These generalize the QRT maps which map each such…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
We study the relation between the type of a double point of a plane curve and the curvilinear 0-dimensional subschemes of the curve at the point. An Algorithm related to a classical procedure for the study of double points via osculating…
A $\mathbb{Z}_2 \times \mathbb{Z}_2$-graded generalisation of the quantum superplane is proposed and studied. We construct a bicovariant calculus on what we shall refer to as the \emph{double-graded quantum superplane}. The commutation…
We give practical numerical methods to compute the period matrix of a plane algebraic curve (not necessarily smooth). We show how automorphisms and isomorphisms of such curves, as well as the decomposition of their Jacobians up to isogeny,…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
We present a new class of particle methods with deformable shapes that converge in the uniform norm without requiring remappings, extended overlapping or vanishing moments for the particles. The crux of the method is to use polynomial…
This paper gives a conjectural characterization of those elliptic curves over the field of complex numbers which "should" be covered by standard modular curves. The elliptic curves in question all have algebraic j-invariant, so they can be…
We present a simple way of separating the overlap between the soft and collinear factorization formulae of QCD squared matrix elements. We check its validity explicitly for single and double unresolved emissions of tree-level processes. The…
Let $A$ be the path algebra of a finite acyclic quiver $Q$ over a finite field. We realize the quantum cluster algebra with principal coefficients associated to $Q$ as a sub-quotient of a certain Hall algebra involving the category of…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
Symmetry is the essential element of lifted inference that has recently demon- strated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether…
We describe an algorithm for computing a $\Q$-rational model for the quotient of a modular curve by an automorphism group, under mild assumptions on the curve and the automorphisms, by determining $q$-expansions for a basis of the…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most…
We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…
This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…
A formula for the irregularity of a cyclic multiple plane associated to a branch curve that has arbitrary singularities and is transverse to the line at infinity is established. The irregularity is expressed as a sum of superabundances of…