Related papers: A note on Euclidean cyclic cubic fields

A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…

For any positive integers $m$ and $k$, existing literature only determines the number of all Euclidean self-dual cyclic codes of length $2^k$ over the Galois ring ${\rm GR}(4,m)$, such as in [Des. Codes Cryptogr. (2012) 63:105--112]. Using…

Given a smooth and separated K(pi,1) variety X over a field k, we associate a "cycle class" in etale cohomology with compact supports to any continuous section of the natural map from the arithmetic fundamental group of X to the absolute…

Let $H$ be obtained from a cyclically $4$-edge-connected cubic planar graph $Y$ other than $K_4$ by deleting two adjacent vertices. We provide a short proof that if $H$ has circumference at least $k$ for some even integer $k \ge 4$, then…

We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…

This article is a contribution to the study of superintegrable Hamiltonian systems with magnetic fields on the three-dimensional Euclidean space $\mathbb{E}_3$ in quantum mechanics. In contrast to the growing interest in complex…

A class number formula is proved for extended ring class fields $L_{\mathcal{O},9}$ over imaginary quadratic fields $K_d = \mathbb{Q}(\sqrt{-d})$, in which the prime $p = 3$ splits, by determining the fields generated by the periodic points…

We prove that all elliptic curves defined over real quadratic fields are modular.

An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. In 1972, Erd\H{o}s conjectured that every Hamiltonian graph with…

We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…

We explore a framework for complex classical fields, appropriate for describing quantum field theories. Our fields are linear transformations on a Hilbert space, so they are more general than random variables for a probability measure. Our…

In this article, we consider the order $\mathcal{O}_{f}={x+yf\sqrt{d}:x,\ y \in \Z}$ with conductor $f\in\N$ in a real quadratic field $K=\mathbb{Q}(\sqrt{d})$ where $d>0$ is square-free and $d\equiv2,3\pmod 4$. We obtain numerical…

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

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…

Let $F$ be a totally real number field of class number one, and let $K$ be a CM-field with $F$ as its maximal real subfield. For each positive integer $N$, we construct a class group of certain binary quadratic forms over $F$ which is…

Let F be a real quadratic field, and let R be an order in F. Suppose given a polarized abelian surface (A,\lambda) defined over a number field k with a symmetric action of R defined over k. This paper considers varying A within the…

In this work methods of construction of cubic graphs are analyzed and a theorem of existence of a colored disc traversing each pair of linked edges belonging to an elementary cycle of a planar cubic graph is proved.

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…

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…