Related papers: Pisot unit generators in number fields

We define and study a transform whose iterates bring to the fore interesting relations between Pisot numbers and primes. Although the relations we describe are general, they take a particular form in the Pisot limit points. We give three…

Current methods for the classification of number fields with small regulator depend mainly on an upper bound for the discriminant, which can be improved by looking for the best possible upper bound of a specific polynomial function over an…

Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…

We study the hit problem, set up by F. Peterson, of finding a minimal set of generators for the polynomial algebra $P_k := \mathbb F_2[x_1,x_2,...,x_k]$ as a module over the mod-2 Steenrod algebra, $\mathcal{A}$. In this paper, we study a…

Let $D>1$ be an integer, and let $b=b(D)>1$ be its smallest divisor. We show that there are infinitely many number fields of degree $D$ whose primitive elements all have relatively large height in terms of $b$, $D$ and the discriminant of…

Denote by $m(G)$ the largest size of a minimal generating set of a finite group $G$. We estimate $m(G)$ in terms of $\sum_{p\in \pi(G)}d_p(G),$ where we are denoting by $d_p(G)$ the minimal number of generators of a Sylow $p$-subgroup of…

To a given Pisot unit $\beta$ we associate a finite abelian group whose size appears to be equal to the discriminant of $\beta$. We call it the Pisot group and find its representation in the two-sided $\beta$-compactum in the case of…

Let $KG$ denote the group algebra of the group $G$ over the field $K$ and let $U(KG)$ denote its group of units. Here without the use of a computer we give presentations for the unit groups of all group algebras $KG$, where the size of $KG$…

For certain real quadratic fields $K$ with sufficiently small discriminant we produce explicit unit generators for specific ray class fields of $K$ using a numerical method that arose in the study of complete sets of equiangular lines in…

The purpose of this article is to give, for any commutative ring A, an explicit minimal set of generators for the ring of multisymmetric functions TS^d_A(A[x_1,...,x_r]) as an A-algebra. In characteristic zero, i.e. when A is an algebra…

A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…

Modular tensor categories are generalizations of the representation categories of quantum groups at roots of unity axiomatizing the properties necessary to produce 3-dimensional TQFTs. Although other constructions have since been found,…

We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also…

We construct the smallest Ree-Tits unital from a group of matrices that is isomorphic to the commutator group of the corresponding Ree group. The matrix description is used to determine configurations in the unital via explicit…

To constitute atoms of a $\sigma$ algebra is not a easy task due to the large number of its elements. However, determining them via generators seems a feasible and simple way since most $\sigma$ algebras are generated by their smaller…

We present a method for computing complete lists of number fields in cases where the Galois group, as an abstract group, appears as a Galois group in smaller degree. We apply this method to find the twenty-five octic fields with Galois…

We present a way to create small yet difficult model counting instances. Our generator is highly parameterizable: the number of variables of the instances it produces, as well as their number of clauses and the number of literals in each…

The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a…

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…