arXiv subjects
Publications and source records attributed to Piotr Maciak.
The aim of this paper is to survey and extend results concerning bounds of the Euclidean minima of abelian number fields. In particular, we give upper bounds for the Euclidean minima of abelian number fields of prime power conductor.
In this paper, we define Euclidean minima for function fields and give some bound for this invariant. We furthermore show that the results are analogous to those obtained in the number field case.
The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p^r, where p is an odd prime and r is at least 2.
Let D be a square-free polynomial in F_q[t], where q is odd, and let G be a genus of definite ternary lattices over F_q[t] of determinant D. In this paper we give self-contained and relatively elementary proofs of Siegel's formulas for the weighted sum of primitive representations numbers over the classes of G and for the mass of G. Our proof of the mass formula shows an interesting relation with certain averages of Dirichlet L-functions.
Let n be a square-free polynomial over F_q, where q is an odd prime power. In this paper, we determine which irreducible polynomials p in F_q[x] can be represented in the form X^2+nY^2 with X, Y in F_q[x]. We restrict ourselves to the case where X^2+nY^2 is anisotropic at infinity. As in the classical case over Z, the representability of p by the quadratic form X^2+nY^2 is governed by conditions coming from class field theory. A necessary (and almost sufficient) condition is that the ideal generated by p splits completely in the Hilbert class field H of K = F_q(x,sqrt{-n}) (for the appropriate notion of Hilbert class field in this context). In order to get explicit conditions for p to be of the form X^2+nY^2, we use the theory of sgn-normalized rank-one Drinfeld modules. We present an algorithm to construct a generating polynomial for H/K. This algorithm generalizes to all situations an algorithm of D.S. Dummit and D.Hayes for the case where -n is monic of odd degree.