Please login to be able to save your searches and receive alerts for new content matching your search criteria.
In this work, we present the integral trace form Tr𝕄/ℚ(x2) of a cyclic extension 𝕄/ℚ with degree pq, where 𝕄=𝕂𝕃, p and q are distinct odd primes, the conductor of 𝕄 is a square free integer, and x belongs to the ring of algebraic integers 𝒪𝕄 of 𝕄. The integral trace form of 𝕄/ℚ allows one to calculate the packing radius of lattices constructed via the canonical (or twisted) homomorphism of submodules of 𝒪𝕄.
We explore whether a root lattice may be similar to the lattice 𝒪 of integers of a number field K endowed with the inner product (x,y):=TraceK/ℚ(x⋅𝜃(y)), where 𝜃 is an involution of K. We classify all pairs K, 𝜃 such that 𝒪 is similar to either an even root lattice or the root lattice ℤ[K:ℚ]. We also classify all pairs K, 𝜃 such that 𝒪 is a root lattice. In addition to this, we show that 𝒪 is never similar to a positive-definite even unimodular lattice of rank ≤48, in particular, 𝒪 is not similar to the Leech lattice. In Appendix B, we give a general cyclicity criterion for the primary components of the discriminant group of 𝒪.
We present the first explicitly known polynomials in Z[x] with nonsolvable Galois group and field discriminant of the form ±pA for p ≤ 7 a prime. Our main polynomial has degree 25, Galois group of the form PSL2(5)5.10, and field discriminant 569. A closely related polynomial has degree 120, Galois group of the form SL2(5)5.20, and field discriminant 5311. We completely describe 5-adic behavior, finding in particular that the root discriminant of both splitting fields is 125 · 5-1/12500 ≈ 124.984 and the class number of the latter field is divisible by 54.
We prove a formula for the limit of logarithmic derivatives of zeta functions in families of global fields with an explicit error term. This can be regarded as a rather far reaching generalization of the explicit Brauer–Siegel theorem both for number fields and function fields.
We tabulate polynomials in ℚ[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and ∞. We explain how these polynomials are of particular interest because of their role in the construction of nonsolvable number fields of arbitrarily large degree and bounded ramification.
We prove the Hasse principle and weak approximation for varieties defined by the smooth complete intersection of three quadratics in at least 19 variables, over arbitrary number fields.
Consider a non-split one-dimensional torus defined over a number field K. For a finitely generated group G of rational points and for a prime number ℓ, we investigate for how many primes 𝔭 of K the size of the reduction of G modulo 𝔭 is coprime to ℓ. We provide closed formulas for the corresponding Dirichlet density in terms of finitely many computable parameters. To achieve this, we determine in general which torsion fields and Kummer extensions contain the splitting field.
We give a list of PGL2(𝔽ℓ) number fields for ℓ≥11 which have rational companion forms. Our list has 53 fields and seems likely to be complete. Some of the fields on our list are very lightly ramified for their Galois group.
For all number fields the failure of maximality for the Kummer extensions is bounded in a very strong sense. We give a direct proof (without relying on the Bashmakov–Ribet method) of the fact that if G is a finitely generated and torsion-free multiplicative subgroup of a number field K having rank r, then the ratio between nr and the Kummer degree [K(ζn,n√G):K(ζn)] is bounded independently of n. We then apply this result to generalize to higher rank a theorem of Ziegler from 2006 about the multiplicative order of the reductions of algebraic integers (the multiplicative order must be in a given arithmetic progression, and an additional Frobenius condition may be considered).
Let K be a number field, and let α1,…,αr be elements of K× which generate a subgroup of K× of rank r. Consider the cyclotomic-Kummer extensions of K given by K(ζn,n1√α1,…,nr√αr), where ni divides n for all i. There is an integer x such that these extensions have maximal degree over K(ζg,g1√α1,…,gr√αr), where g=gcd(n,x) and gi=gcd(ni,x). We prove that the constant x is computable. This result reduces to finitely many cases the computation of the degrees of the extensions K(ζn,n1√α1,…,nr√αr) over K.