Related papers: Unit-generated orders of real quadratic fields I. …

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Let $l$ be a rational prime greater than or equal to $3$ and $k$ be a given positive integer. Under a conjecture due to Langland and an assumption on upper bound for the regulator of fields of the form $\mathbb{Q}\left(\sqrt[l]a\right)$, we…

Some PARI programs have bringed out a property for the non-genus part of the class number of the imaginary quadratic fields, with respect to $(\sqrt D\,)^{\varepsilon}$, where $D$ is the absolute value of the discriminant and $\varepsilon…

We study the class number one problem for real quadratic fields $\mathbb{Q}(\sqrt{9m^2+ 4m})$, where $m$ is an odd integer. We show that for $m \equiv 1 \pmod 3$ there is only one such field with class number one and only one such field…

We use the polynomials $m_s(t) = t^2 - 4 s$, $s \in \{-1, 1\}$, in an elementary process giving arbitrary large lists of {\it fundamental units} of quadratic fields of discriminants listed in ascending order. More precisely, let $\mathbf{B}…

Let $\LL^+=\mathbb{Q}(\sqrt{2}, \sqrt{pq}, \sqrt{ps})$ and $\LL=\mathbb{Q}(\sqrt{2}, \sqrt{pq}, \sqrt{ps}, \sqrt{-\ell})$ be two fields, where $q$, $p$ and $s$ three different prime integers and $\ell\geq1$ be a positive odd square-free…

Let $a\geq 1$ and $n>1$ be odd integers. For a given prime $p$, we prove under certain conditions that the class groups of imaginary quadratic fields $\mathbb{Q}(\sqrt{a^2-4p^n})$ have a subgroup isomorphic to $\mathbb{Z}/n\mathbb{Z}$. We…

The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…

We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…

We consider families of number fields of degree 4 whose normal closures over $\mathbb{Q}$ have Galois group isomorphic to $D_4$, the symmetries of a square. To any such field $L$, one can associate the Artin conductor of the corresponding…

In this paper we study the (Cohen-Macaulay) type of orders over Dedekind domains in \'etale algebras. We provide a bound for the type, and give formulas to compute it. We relate the type of the overorders of a given order to the size of…

For each real quadratic field we constructively show the existence of infinitely many exceptional quartic number fields containing that quadratic field. On the other hand, another infinite collection of quartic exceptional fields without…

This paper studies Galois extensions over real quadratic number fields or cyclotomic number fields ramified only at one prime. In both cases, the ray class groups are computed, and they give restrictions on the finite groups that can occur…

Kuroda's formula relates the class number of a multi-quadratic number field $K$ to the class numbers of its quadratic subfields $k_i$. A key component in this formula is the unit group index $Q(K) = [\mathcal{O}_{K}^{\times}:…

In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…

Let $\mathcal{O}$ be an order of index $m$ in the maximal order of a quadratic number field $k=\mathbb{Q}(\sqrt{d})$. Let $\underline{\mathbf{O}}_{d,m}$ be the orthogonal $\mathbb{Z}$-group of the associated norm form $q_{d,m}$. We describe…

We prove that approximately $96.23\%$ of cubic fields, ordered by discriminant, have genus number one, and we compute the exact proportion of cubic fields with a given genus number. We also compute the average genus number. Finally, we show…

A classical result in additive combinatorics, which is a combination of Balog-Szemer\'edi-Gowers theorem and a variant of Freiman's theorem due to Ruzsa, says that if a subset $A$ of $\mathbb{F}_p^n$ contains at least $c |A|^3$ additive…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…