Related papers: Minimal Polynomials of Singular Moduli
McMullen proved the moduli space of complex rational maps can be parametrized by the spectrum of all periodic-point multipliers up to a finite amount of data, with the well-understood exception of Latt\`{e}s maps. We generalize his method…
Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…
In the present paper MAPLE subroutines computing Milnor and Tyurina numbers of an isolated algebraic hypersurface singularity are presented and described in detail. They represents examples, and perhaps the first ones, of a MAPLE…
In this article we consider rational functions on algebraic curves, which have one zero and one pole (and call pair of such function and curve Abel pair). We investigate moduli spaces of such functions on curves of genus one; the number of…
The maximal minors of a matrix of indeterminates are a universal Gr\"obner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
The aim of this manuscript is to derive bounds on the moduli of eigenvalues of special type of rational matrices of the form $T(\lambda) = \displaystyle -B_0 +I\lambda +\frac{B_1}{\lambda-\alpha_1}+ \dots+ \frac{B_m}{\lambda-\alpha_m}$,…
In this article we provide examples, methods and algorithms to determine conditions on the parameters of certain type of parametric optimization problems, such that among the resulting local minima and maxima there is at least one which…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We present several new algorithms to evaluate modular polynomials of level $\ell$ modulo a prime $p$ on an input $j$. More precisely, we introduce two new generic algorithms, sharing the following similarities: they are based on a CRT…
We discuss some examples of geometrically meaningful rational self-maps of moduli space of curves of low genus and homogeneous forms.
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…
A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…
In this paper, we consider interpolation by \textit{completely monotonous} polynomials (CMPs for short), that is, polynomials with non-negative real coefficients. In particular, given a finite set $S\subset \mathbb{R}_{>0} \times…
We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the…
Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…
We determine the splitting (isomorphism) type of the normal bundle of a generic genus-0 curve with 1 or 2 components in any projective space, as well as the (sometimes nontrivial) way the bundle deforms locally with a general deformation of…
Our aim is to explain instances in which the value of the logarithmic Mahler measure of a polynomial can be written in an unexpectedly neat manner. To this end we examine polynomials defining rational curves, which allows their zero-locus…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
Studying degenerations of moduli spaces of semistable principal bundles on smooth curves leads to the problem of constructing and studying moduli spaces on singular curves. In this note, we will see that the moduli spaces of…