Related papers: Multiple polylogarithms, cyclotomy and modular com…
The polylogarithm function is one of the constellation of important mathematical functions. It has a long history, and many connections to other special functions and series, and many applications, for instance in statistical physics.…
This paper has been withdrawn by the author; a revised version is part of the author's phd-thesis "Quasi-logarithmic structures" (Zurich, 2007).
This is an overview of math.AG/0310186, math.AG/0309290, math.AG/0501247, math.AG/0401002 and math.AG/0504584 written for the Proceedings of the AMS Meeting on Algebraic Geometry, Seattle, 2005.
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…
This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…
This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…
The paper studies modular reduction techniques for abstract regular and chiral polytopes, with two purposes in mind: first, to survey the literature about modular reduction in polytopes; and second, to apply modular reduction, with moduli…
This is a revised version of the preprint which has been available electronically for a while. The paper will now appear in J. Ramanujan Math. Soc.
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
By computing all cyclotomic points on some algebraic varieties, we get an independent and efficient way to find all rational $a^3b$-monotiles for the sphere, thereby completing the classification of edge-to-edge monohedral quadrilateral…
Studying degenerate versions of various special polynomials have become an active area of research and yielded many interesting arithmetic and combinatorial results. Here we introduce a degenerate version of polylogarithm function, called…
We introduce an iterated integral version of (generalized) log-sine integrals (iterated log-sine integrals) and prove a relation between a multiple polylogarithm and iterated log-sine integrals. We also give a new method for obtaining…
We continue the analysis of higher and multiple Mahler measures using log-sine integrals as started in "Log-sine evaluations of Mahler measures" and "Special values of generalized log-sine integrals" by two of the authors. This motivates a…
I present a construction of permutation polynomials based on cyclotomy, an additive analogue of this construction, and a generalization of this additive analogue which appears to have no multiplicative analogue. These constructions…
We summarize recent computations with a class of elliptic generalizations of polylogarithms, arising from the massive sunrise integral. For the case of arbitrary masses we obtain results in two and four space-time dimensions. The iterated…
In this series of seven papers, predominantly by means of elementary analysis, we establish a number of identities related to the Riemann zeta function. Whilst this paper is mainly expository, some of the formulae reported in it are…
This is an expository article for Elsevier's Encyclopedia of Mathematical Physics on the subject in the title. Comments/corrections welcome.
This is an English translation of the following paper, published several years ago: Nikonorov Yu.G. On the geodesic diameter of surfaces with involutive isometry (Russian), Tr. Rubtsovsk. Ind. Inst., 2001, V. 9, 62-65, Zbl. 1015.53041. All…
We shall define the q-analogs of multiple zeta functions and multiple polylogarithms in this paper and study their properties, based on the work of Kaneko et al. and Schlesinger, respectively.
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…