Related papers: On abelian cubic fields with large class number

Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…

The determination of the class number of totally real fields of large discriminant is known to be a difficult problem. The Minkowski bound is too large to be useful, and the root discriminant of the field can be too large to be treated by…

We prove an asymptotic formula for class numbers of totlally imaginary quartic number fields, ie for number fields of degree 4 over Q with only complex embeddings. After previous work for real quadratic fields (Sarnak) and complex cubic…

We adapt a known technique for searching for ideal classes of arbitrary order and then apply it to three families of number fields. We show that a family of cyclic sextic number fields has infinitely many fields in it that contain a…

We describe the two-generated limits of abelian-by-(infinite cyclic) groups in the space of marked groups using number theoretic methods. We also discuss universal equivalence of these limits.

This paper gives a method to find all imaginary multiquadratic fields of class number dividing $2^{m},$ provided the list of all imaginary quadratic fields of class number dividing $2^{m+1}$ is known. We give a bound on the degree of such…

Murty proved that for all sufficiently large $X$ there exist at least ${c(\ell,\eps) X^{1/{4\ell}-\eps}}$ real quadratic fields with class number divisible by $\ell$ and discriminant not exceeding $X$ in absolute value. We extend this this…

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

In this note we show that any basic abelian variety with additional structures over an arbitrary algebraically closed field of characteristic $p>0$ is isogenous to another one defined over a finite field. We also show that the category of…

In this paper, we investigate the multiplicities and the log canonical thresholds of abelian quotient complete intersection singularities in term of the special datum. Moreover we give bounds of the multiplicity of abelian quotient complete…

The investigation of the ideal class group $Cl_K$ of an algebraic number field $K$ is one of the key subjects of inquiry in algebraic number theory since it encodes a lot of arithmetic information about K. There is a considerable amount of…

We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the…

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…

In a recent work I developed a formula for efficiently calculating the number of abelian squares of length $t+t$ over an alphabet of size $d$, where $d$ may be very large. Here I show how the expressiveness of a certain class of…

We describe a deterministic process to associate a practical, permanent label to isomorphism classes of abelian varieties defined over finite fields with commutative endomorphism algebra as long as they are ordinary or defined over a prime…

It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all $\Delta\geq3$ and for all sufficiently large $n$, there is a simple $\Delta$-regular $n$-vertex graph with queue-number at…

It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.

We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…