Reconstructing Rational Functions with FireFly\texttt{FireFly}

We present the open-source $\texttt{C++}$ library $\texttt{FireFly}$ for the reconstruction of multivariate rational functions over finite fields. We discuss the involved algorithms and their implementation. As an application, we use $\texttt{FireFly}$ in the context of integration-by-parts reductions and compare runtime and memory consumption to a fully algebraic approach with the program $\texttt{Kira}$.Comment: 46 pages, 3 figures, 6 tables; v2: matches published versio

12 Years of Precision Calculations for LEP. What's Next?

I shortly review time period of twelve years, 1989-2000, which was devoted to a theoretical support of experiments at LEP and SLC at Z resonance and discuss several directions of possible future work in the field of precision theoretical calculations for experiments at future colliders.Comment: 11 Latex, including 1 figures. Updated version as appeared in the Journa

Note on Integer Factoring Methods IV

This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer factorization.Comment: 20 Pages, New Versio

Encoding algebraic power series

Algebraic power series are formal power series which satisfy a univariate polynomial equation over the polynomial ring in n variables. This relation determines the series only up to conjugacy. Via the Artin-Mazur theorem and the implicit function theorem it is possible to describe algebraic series completely by a vector of polynomials in n+p variables. This vector will be the code of the series. In the paper, it is then shown how to manipulate algebraic series through their code. In particular, the Weierstrass division and the Grauert-Hironaka-Galligo division will be performed on the level of codes, thus providing a finite algorithm to compute the quotients and the remainder of the division.Comment: 35 page

Lattice polytopes in coding theory

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations.Comment: 11 pages, 3 figure