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

In this paper, we use the theory of genus fields to study the Euclidean ideals of certain real biquadratic fields $K.$ Comparing with the previous works, our methods yield a new larger family of real biquadratic fields $K$ having Euclidean…

We prove that any $3$-uniform hypergraph whose minimum vertex degree is at least $\left(\frac{5}{9} + o(1) \right)\binom{n}{2}$ admits an almost-spanning tight cycle, that is, a tight cycle leaving $o(n)$ vertices uncovered. The bound on…

Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.

We calculate an explicit lower bound on the proportion of elliptic curves that are modular over any Galois CM field not containing $\zeta_5$. Applied to imaginary quadratic fields, this proportion is at least $2/5$. Applied to cyclotomic…

Let $\mathds{k}$ be a real quadratic number field. Denote by $\mathrm{Cl}_2(\mathds{k})$ its $2$-class group and by $\mathds{k}_2^{(1)}$ (resp. $\mathds{k}_2^{(2)}$) its first (resp. second) Hilbert $2$-class field. The aim of this paper is…

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p^r, where p is an odd…

Let $\Delta \ge 3$ be fixed, $n \ge n_\Delta$ be a large integer. It is a classical result that $\Delta$--regular expanders on $n$ vertices are not embeddable as geometric (distance) graphs into Euclidean space of dimension less than $c…

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…

A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent…

For a natural number $n\ge2$ which is co-prime to Char$(\mathbb{F}_q)$, let $\mathcal{C}_n$ and $\mathcal{C}_{n,1}$ denote the cyclic codes of length $n$ over $\mathbb{F}_q$ generated by the $n$-th cyclotomic polynomial $Q_n(x)$ and the…

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…

We verify a conjecture of Emil Artin, for the case of a Cubic and Quadratic form over any $p$-adic field, provided the cardinality of the residue class field exceeds 293. That is any Cubic and Quadratic form with at least 14 variables has a…

H. W. Lenstra \cite{lenstra} introduced the notion of an Euclidean ideal class, which is a generalization of norm-Euclidean ideals in number fields. Later, families of number fields of small degree were obtained with an Euclidean ideal…

We prove that the clique graph operator $k$ is divergent on a locally cyclic graph $G$ (i.e. $N_G(v)$ is a circle) with minimum degree $\delta(G)=6$ if and only if $G$ is $6$-regular. The clique graph $kG$ of a graph $G$ has the maximal…

Lenstra's concept of Euclidean ideals generalizes the Euclidean algorithm; a domain with a Euclidean ideal has cyclic class group, while a domain with a Euclidean algorithm has trivial class group. This paper generalizes Harper's variation…

Kelly, Kuehn and Osthus conjectured that for any l>3 and the smallest number k>2 that does not divide l, any large enough oriented graph G with minimum indegree and minimum outdegree at least \lfloor |V(G)|/k\rfloor +1 contains a directed…

For a fixed number field and an elliptic curve defined and semi-stable over this number field, we consider the set of prime numbers p such that the Galois representation attached to the p-torsion points of the elliptic curve is reducible.…

Lenstra introduced the notion of a Euclidean ideal class, which is a generalization of the Euclidean domain. Lenstra also proved that the Euclidean ideal in a number field $K$ implies that the class group of $K$ is cyclic. We construct a…

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…