Related papers: Minimal Polynomials of Singular Moduli
We give a complete characterization of degree two rational maps with potential good reduction over local fields. We show this happens exactly when the map corresponds to an integral point in the moduli space. We detail an algorithm by which…
We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…
In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.
The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…
Let $p$ be an odd prime number and let $X_0^+(p)$ be the quotient of the classical modular curve $X_0(p)$ by the action of the Atkin-Lehner operator $w_p$. In this paper we show how to compute explicit equations for the canonical model of…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…
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…
We develop in this article an algorithm that, given a projective curve $C$, computes a \textit{gonal map}, that is, a finite morphism from $C$ to the projective line of minimal degree. Our method is based on the computation of scrollar…
We study the noncommutative modular curve (which was already studied by Connes, Manin and Marcolli), and the space of geodesics on the usual modular curve, from the viewpoint of algebraic groups, linear algebra and class field theory. This…
We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…
This is the first in a projected series of three papers in which we construct the second flip in the log minimal model program for $\bar{M}_g$. We introduce the notion of a weakly proper algebraic stack, which may be considered as an…
When are two germs of analytic systems conjugate or orbitally equivalent under an analytic change of coordinates in the neighborhood of a singular point? A way to answer is to use normal forms. But there are large classes of dynamical…
The motivation for this paper are computer calculations of complete lists of weight systems of quasihomogeneous polynomials with isolated singularity at 0 up to rather large Milnor numbers. We review combinatorial characterizations of such…
For a curve which admits an abelian cover of the projective line branched at three points, we study when its reduction to positive characteristic is supersingular. Using the method of Shimura and Taniyama, we give a complete classification…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots. These spaces are indexed by number partitions. A standard reformulation in terms of quotients of orbit arrangements…
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…