Zeta functions and Blow-Nash equivalence

We propose a refinement of the notion of blow-Nash equivalence between Nash function germs, which is an analog in the Nash setting of the blow-analytic equivalence defined by T.-C. Kuo. The new definition is more natural and geometric. Moreover, this equivalence relation still does not admit moduli for a Nash family of isolated singularities. Some previous invariants are no longer invariants for this new relation, however, thanks to a Denef & Loeser formula coming from motivic integration in a Nash setting, we managed to derive new invariants for this equivalence relation.Comment: 12 page

Computing Linear Matrix Representations of Helton-Vinnikov Curves

Helton and Vinnikov showed that every rigidly convex curve in the real plane bounds a spectrahedron. This leads to the computational problem of explicitly producing a symmetric (positive definite) linear determinantal representation for a given curve. We study three approaches to this problem: an algebraic approach via solving polynomial equations, a geometric approach via contact curves, and an analytic approach via theta functions. These are explained, compared, and tested experimentally for low degree instances.Comment: 19 pages, 3 figures, minor revisions; Mathematical Methods in Systems, Optimization and Control, Birkhauser, Base

New and Old Results in Resultant Theory

Resultants are getting increasingly important in modern theoretical physics: they appear whenever one deals with non-linear (polynomial) equations, with non-quadratic forms or with non-Gaussian integrals. Being a subject of more than three-hundred-year research, resultants are of course rather well studied: a lot of explicit formulas, beautiful properties and intriguing relationships are known in this field. We present a brief overview of these results, including both recent and already classical. Emphasis is made on explicit formulas for resultants, which could be practically useful in a future physics research.Comment: 50 pages, 15 figure

Computing functions on Jacobians and their quotients

We show how to efficiently compute functions on jacobian varieties and their quotients. We deduce a quasi-optimal algorithm to compute $(l,l)$ isogenies between jacobians of genus two curves

The geometry of efficient arithmetic on elliptic curves

The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$ in $\mathbb{P}^r$. By means of a study of the finite dimensional vector spaces of global sections, we reduce the problem of constructing and finding efficiently computable polynomial maps defining the addition morphism or isogenies to linear algebra. We demonstrate the effectiveness of the method by improving the best known complexity for doubling and tripling, by considering families of elliptic curves admiting a $2$-torsion or $3$-torsion point

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic

An excursion from enumerative goemetry to solving systems of polynomial equations with Macaulay 2

Solving a system of polynomial equations is a ubiquitous problem in the applications of mathematics. Until recently, it has been hopeless to find explicit solutions to such systems, and mathematics has instead developed deep and powerful theories about the solutions to polynomial equations. Enumerative Geometry is concerned with counting the number of solutions when the polynomials come from a geometric situation and Intersection Theory gives methods to accomplish the enumeration. We use Macaulay 2 to investigate some problems from enumerative geometry, illustrating some applications of symbolic computation to this important problem of solving systems of polynomial equations. Besides enumerating solutions to the resulting polynomial systems, which include overdetermined, deficient, and improper systems, we address the important question of real solutions to these geometric problems. The text contains evaluated Macaulay 2 code to illuminate the discussion. This is a chapter in the forthcoming book "Computations in Algebraic Geometry with Macaulay 2", edited by D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels. While this chapter is largely expository, the results in the last section concerning lines tangent to quadrics are new.Comment: LaTeX 2e, 22 pages, 1 .eps figure. Source file (.tar.gz) includes Macaulay 2 code in article, as well as Macaulay 2 package realroots.m2 Macaulay 2 available at http://www.math.uiuc.edu/Macaulay2 Revised with improved exposition, references updated, Macaulay 2 code rewritten and commente