Related papers: Pisot unit generators in number fields

We study Pisot numbers $\beta \in (1, 2)$ which are univoque, i.e., such that there exists only one representation of 1 as $1 = \sum_{n \geq 1} s_n\beta^{-n}$, with $s_n \in \{0, 1\}$. We prove in particular that there exists a smallest…

A well-known result, due to Meyer, states that the set P of Pisot numbers, generating a real algebraic number field K, is uniformly discrete and relatively dense in the set of positive real number. In the present paper, we show that P is…

This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…

We show that the number $\alpha=(1+\sqrt{3+2\sqrt{5}})/2$ with minimal polynomial $x^4-2x^3+x-1$ is the only Pisot number whose four distinct conjugates $\alpha_1,\alpha_2,\alpha_3,\alpha_4$ satisfy the additive relation…

We give an overview on recent results concerning additive unit representations. Furthermore the solutions of some open questions are included. The central problem is whether and how certain rings are (additively) generated by their units.…

In the study of Fuchsian groups, it is a nontrivial problem to determine a set of generators. Using a dynamical approach we construct for any cocompact arithmetic Fuchsian group a fundamental region in $\mathbf{SL}_2(\mathbb{R})$ from which…

We discuss the problem of calculating generators of power integral bases in sextic fields, especially focusing on the case of sextic fields with real quadratic subfields. Our main purpose is to describe an efficient algorithm for…

Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…

Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…

For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of finding representations with minimal weight has been solved…

We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with…

We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically…

In this paper, we present two main results. Let $K$ be a number field that is Galois over $\mathbb{Q}$ with degree $r+2s$, where $r$ is the number of real embeddings and $s$ is the number of pairs of complex embeddings. The first result…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

Unit-generated orders of a quadratic field are orders of the form $\mathcal{O} = \mathbb{Z}[\varepsilon]$, where $\varepsilon$ is a unit in the quadratic field. If the order $\mathcal{O}$ is a maximal order of a real quadratic field, then…

Let $\beta >1$ be an integer or generally a Pisot number. Put $T(x) = \{ \beta x \}$ on $[0,1]$ and let $S: [0,1]\to [0,1]$ be a piecewise linear transformation whose slopes have the form $\pm \beta^m$ with positive integers $m$. We give…

This article is the first in a series devoted to computing the class groups of real quadratic fields. We present a new relation between the class number and the index of unit groups. This relation generalizes Hilbert class field theory for…

Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic…

We study real numbers $\beta$ with the curious property that the $\beta$-expansion of all sufficiently small positive rational numbers is purely periodic. It is known that such real numbers have to be Pisot numbers which are units of the…

We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.