Searcharxiv⌕ Search

arXiv subjects

Allechar Serrano López

Publications and source records attributed to Allechar Serrano López.

3 recordsLinked to original sources

Counting number fields of fixed degree by their smallest defining polynomial

When do two irreducible polynomials with integer coefficients define the same number field? One can define an action of $\mathrm{GL}_2 \times \mathrm{GL}_1$ on the space of polynomials of degree $n$ so that for any two polynomials $f$ and $g$ in the same orbit, the roots of $f$ may be expressed as rational linear transformations of the roots of $g$; thus, they generate the same field. In this article, we show that almost all polynomials of degree $n$ with size at most $X$ can only define the same number field as another polynomial of degree $n$ with size at most $X$ if they lie in the same orbit for this group action. (Here we measure the size of polynomials by the greatest absolute value of their coefficients.) This improves on work of Bhargava, Shankar, and Wang, who proved a similar statement for a positive proportion of polynomials. Using this result, we prove that the number of degree $n$ fields such that the smallest polynomial defining the field has size at most $X$ is asymptotic to a constant times $X^{n+1}$ as long as $n\geq 3$. For $n = 2$, we obtain a precise asymptotic of the form $\frac{27}{π^2} X^2$.

math.NT↗

Replicable functions arising from code-lattice VOAs fixed by automorphisms

We ascertain properties of the algebraic structures in towers of codes, lattices, and vertex operator algebras (VOAs) by studying the associated subobjects fixed by lifts of code automorphisms. In the case of sublattices fixed by subgroups of code automorphisms, we identify replicable functions that occur as quotients of the associated theta functions by suitable eta products. We show that these lattice theta quotients can produce replicable functions not associated to any individual automorphisms. Moreover, we show that the structure of the fixed subcode can induce certain replicable lattice theta quotients and we provide a general code theoretic characterization of order doubling for lifts of code automorphisms to the lattice-VOA. Finally, we prove results on the decompositions of characters of fixed subVOAs.

math.NT↗

Power-saving error terms for the number of $D_4$-quartic extensions over a number field ordered by discriminant

We study the asymptotic count of dihedral quartic extensions over a fixed number field with bounded norm of the relative discriminant. The main term of this count (including a summation formula for the constant) can be found in the literature (see Cohen--Diaz y Diaz--Olivier for the statement without proof and see Klüners for a proof), but a power-saving for the error term has not been explicitly determined except in the case that the base field is $\mathbb{Q}$. In this article, we describe the argument for obtaining both the explicit main term and a power-saving error term for the number of $D_4$-quartic extensions over a general base number field ordered by the norms of their relative discriminants. We also give an extensive overview of the history and development of number field asymptotics.

math.NT↗