Related papers: The Euclidean algorithm in quintic and septic cycl…

This article focuses on some rings of integers of number fields which are known to be norm-Euclidean domains, but for which no explicit algorithm computing the Euclidean division has yet been studied or implemented. The rings of integers we…

Surprisingly, the class numbers of cyclotomic fields have only been determined for fields of small conductor, e.g. for prime conductors up to 67, due to the problem of finding the "plus part," i.e. the class number of the maximal real…

We show that assuming the generalized Riemann hypothesis there are no normal CM-fields with class number one of degree 64 and 96. This is done by constructing complete tables of normal CM-fields using discriminant bounds of Lee--Kwon. This…

In this paper we study the structure of the $3-$part of the ideal class group of a certain family of real cyclotomic fields with $3-$class number exactly $9$ and conductor equal to the product of two distinct odd primes. We employ known…

We classify all quadratic imaginary number fields that have a Euclidean ideal class. There are seven of them, they are of class number at most two, and in each case the unique class that generates the class-group is moreover norm-Euclidean.

In this paper we study number fields which are Euclidean with respect to a function different from the absolute value of the norm. We also show that the Euclidean minimum with respect to weighted norms may be irrational and not isolated.

The renowned theorem of Dirac states that if $G$ is a graph with minimum degree at least $n/2$ then $G$ has a Hamilton cycle. A natural generalisation asks what properties of an edge-colouring of $G$ guarantee the existence of a properly…

Heilbronn gave a sufficient condition for a number field with a totally ramified prime to fail to be norm-Euclidean. We say that Heilbronn's criterion applies to a polynomial $f$ if it applies to the number field $K=\mathbb{Q}[x]/(f)$…

In this paper, we continue the study of unit reducible fields as introduced in \cite{LPL23} for the special case of cyclotomic fields. Specifically, we deduce that the cyclotomic fields of conductors $2,3,5,7,8,9,12,15$ are all unit…

In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…

A conditional bound is given for the average analytic rank of elliptic curves over an arbitrary number field. In particular, under the assumptions that all elliptic curves over a number field $K$ are modular and have $L$-functions which…

Substantial efforts have been made to compute or estimate the minimum number $c(G)$ of cycles needed to partition the edges of an Eulerian graph. We give an equivalent characterization of Eulerian graphs of treewidth $2$ and with maximum…

We prove that the acyclic chromatic number of a graph with maximum degree $\Delta$ is less than $2.835\Delta^{4/3}+\Delta$. This improves the previous upper bound, which was $50\Delta^{4/3}$. To do so, we draw inspiration from works by…

The size function for a number field is an analogue of the dimension of the Riemann-Roch spaces of divisors on an algebraic curve. It was conjectured to attain its maximum at the trivial class of Arakelov divisors. This conjecture was…

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…

Let $\Gamma \,=\, \mathbb{Q}(\sqrt[5]{n})$ be a pure quintic field, where $n$ is a natural number $5^{th}$ power-free. Let $k = \mathbb{Q}(\sqrt[5]{n}, \zeta_5)$, with $\zeta_5$ is a primitive $5^{th}$ root of unit, be the normal closure of…

In this paper, we show several bounds for the numerical radius of a Hilbert space operator in terms of the Euclidean operator norm. The obtained forms will enable us to find interesting refinements of celebrated results in the literature.…

In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…

We prove the following form of the Clemens conjecture in low degree. Let $d\le9$, and let $F$ be a general quintic threefold in $\IP^4$. Then (1)~the Hilbert scheme of rational, smooth and irreducible curves of degree $d$ on $F$ is finite,…

The usual division algorithms on $\mathbb{Z}$ and $\mathbb{Z}[i]$ measure the size of remainders using the norm function. These rings are Euclidean with respect to several functions. The pointwise minimum of all Euclidean functions $f: R…