Higher congruence companion forms
We prove formulas for the k-higher Mahler measure of a family of rational functions with an arbitrary number of variables. Our formulas reveal relations with multiple polylogarithms evaluated at certain roots of unity.
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a -adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good.
We present the theory of higher order invariants and higher order automorphic forms in the simplest case, that of a compact quotient. In this case, many things simplify and we are thus able to prove a more precise structure theorem than in the general case.
We establish “higher depth” analogues of regularized determinants due to Milnor for zeros of cuspidal automorphic -functions of over a general number field. This is a generalization of the result of Deninger about the regularized determinant for zeros of the Riemann zeta function.