Related papers: Pisot unit generators in number fields
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
This paper studies tilings related to the beta-transformation when beta is a Pisot number (that is not supposed to be a unit). Then it applies the obtained results to study the set of rational numbers having a purely periodic…
We prove that the ring of integers in the totally real cubic subfield $K^{(49)}$ of the cyclotomic field $\mathbb{Q}(\zeta_7)$ has Pythagoras number equal to $4$. This is the smallest possible value for a totally real number field of odd…
We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if the…
An index coding problem is called unicast-uniprior when each receiver demands a unique subset of messages while knowing another unique subset of messages apriori as side-information. In this work, we give an algorithm to compute the minrank…
We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate…
In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all norm-Euclidean cubic number fields with discriminants -999 < d < 10000.
Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In the classical case, the maps can be given analytically. However, in the Shimura…
The number theoretic analogue of a net in metric geometry suggests new problems and results in combinatorial and additive number theory. For example, for a fixed integer g > 1, the study of h-nets in the additive group of integers with…
A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…
In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…
We begin a systematic study of unitary representations of minimal $W$-algebras. In particular, we classify unitary minimal $W$-algebras and make substantial progress in classification of their unitary irreducible highest weight modules. We…
In this paper, we study the minimal generating system of the canonical module of a Hibi ring. Using the results, we state a characterization of a Hibi ring to be level. We also give a characterization of a Hibi ring to be of type 2.…
In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms…
Let $a\in \mathbb{Z}$ and $\rho$ be a root of $f_a(x)=x^3-ax^2-(a+3)x-1$, then the number field $K_a=\mathbb{Q}(\rho)$ is called a simplest cubic field. In this paper we consider the family of unit equations $u_1+u_2=n$ where $u_1,u_2\in…
Following earlier work by E.Maillet 100 years ago, we introduce the definition of a Liouville set, which extends the definition of a Liouville number. We also define a Liouville field, which is a field generated by a Liouville set. Any…
We study the arithmetic complexity of hitting set generators, which are pseudorandom objects used for derandomization of the polynomial identity testing problem. We give new explicit constructions of hitting set generators whose outputs are…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that…
Many Random Number Generators (RNG) are available nowadays; they are divided in two categories, hardware RNG, that provide "true" random numbers, and algorithmic RNG, that generate pseudo random numbers (PRNG). Both types usually generate…