Related papers: Pisot unit generators in number fields
We report on the results of a computer search for primes $p$ which divide an Harmonic number $H_{\lfloor p/N \rfloor}$ with small $N > 1$.
Let $m\in\mathbb{Z}$ be an integer and $L_m=\mathbb{Q}(\alpha)$ be the simplest cubic field with class number $h_m$ and conductor $\mathfrak{f}_m$ where $\alpha$ is a root of $f_m(X)=X^3-mX^2-(m+3)X-1$. Let $\mathcal{O}_{L_m}$ be the ring…
The MinRank problem is a simple linear algebra problem: given matrices with coefficients in a field, find a non trivial linear combination of the matrices that has a small rank. There are several algebraic modeling of the problem. The main…
It is well-known that the quality of random number generators can often be improved by combining several generators, e.g. by summing or subtracting their results. In this paper we investigate the ratio of two random number generators as an…
Two constructed prime number subsets (called prime brother & sisters and prime cousins) lead to a third one (called isolated primes) so that all three disjoint subsets together generate the prime number set. It should be suggested how the…
Denote by $P_k$ the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the prime field of two elements, $\mathbb F_2$, with the degree of each $x_i$ being 1. We study the Peterson hit problem of determining a minimal set of…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
Let $p$ be a prime integer and $n,i$ be positive integers such that \linebreak $S=\{-1, \ \theta, \ \mu_i=1+\theta+... + \theta^{i-1} \ \mid 1 < i < \frac{p^n}{2}, \ gcd(p^n,i)=1 \}$ generates the group of units of $\mathbb{Z}[\theta],$…
We present a heuristic algorithm to compute the ideal class group, and a generator of a principal ideal in $\mathbb{Q}(\zeta_{p^s})$ in time $2^{O(n^{1/2+\varepsilon})}$ for $n:= deg(K)$ and arbitrarily small $\varepsilon$. This yields an…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…
An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…
The simplest cubic fields $\mathbb{Q}(\rho)$ are generated by a root $\rho$ of the polynomial $x^3-ax^2-(a+3)x-1$ where $a\geq -1$. In this paper, we will show that the Pythagoras number of the order $\mathbb{Z}[\rho]$ is equal to $6$ for…
We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…
A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems…
It is a classical problem in algebraic number theory to decide if a number field is monogeneous, that is if it admits power integral bases. It is especially interesting to consider this question in an infinite parametric familiy of number…
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
CNOT gates are fundamental to quantum computing, as they facilitate entanglement, a crucial resource for quantum algorithms. Certain classes of quantum circuits are constructed exclusively from CNOT gates. Given their widespread use, it is…
Ising machines are a form of quantum-inspired processing-in-memory computer which has shown great promise for overcoming the limitations of traditional computing paradigms while operating at a fraction of the energy use. The process of…
We obtain lower bound of caliber number of real quadratic field $K=\FQ(\sqrt{d})$ using splitting primes in $K$. We find all real quadratic fields of caliber number 1 and find all real quadratic fields of caliber number 2 if $d$ is not 5…