Related papers: Pisot unit generators in number fields
When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…
Halidon rings are rings with a unit element, containing a primitive $m^{th}$ root of unity and $m$ is invertible in the ring. The field of complex numbers is a halidon ring with any index $ m \geq 1$. In this article, the author examines…
Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…
A numerical set $T$ is a subset of $\mathbb N_0$ that contains $0$ and has finite complement. The atom monoid of $T$ is the set of $x \in \mathbb N_0$ such that $x+T \subseteq T$. Marzuola and Miller introduced the anti-atom problem: how…
In some previous works we gave algorithms for determining generators of power integral basis in sextic fields with a quadratic subfield, under certain restrictions. The purpose of the present paper is to extend those methods to the general…
We study the number of generators of ideals in regular rings and ask the question whether $\mu(I)<\mu(I^2)$ if $I$ is not a principal ideal, where $\mu(J)$ denotes the number of generators of an ideal $J$. We provide lower bounds for the…
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with…
Let $p$ be a prime number, $F$ a field of characteristic $p$, and $G$ a cyclic group of order $q =p^a$ for some positive integer $a$. Under these circumstances every indecomposable $F G$-module is cyclic. For indecomposable $F G$-modules…
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To…
A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…
In traditional quantum computing, it has been established that real quantum computation augmented with non-Clifford gates is as powerful as universal quantum computation. Here we investigate this phenomenon in the non-Hermitian setting. We…
In this paper we consider the problem of finding a vector that can be written as a nonnegative integer linear combination of given 0-1 vectors, the generators, such that the l_1-distance between this vector and a given target vector is…
For an odd prime p, we determine a minimal set of topological generators of the pro-p Iwahori subgroup of a split reductive group G over Z\_p. In the simple adjoint case and for any sufficiently large regular prime p, we also construct…
We compute the spinor class field for a genus of orders, in a central simple algebra of higher dimension, that are intersections of two maximal orders. In particular, we compute the number of spinor genera in a genus of such orders, as the…
We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and…
This paper deals with the set of $\alpha\in{\mathbb{R}}$ such that $\alpha \zeta^{n} \bmod 1$ tends to $0$ for a fixed $\zeta\in{\mathbb{R}}$, which we call $\mathscr{M}_{\zeta}$. Predominately the case of Pisot numbers $\zeta$ is studied.…
A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…
We consider numeration systems with base $\beta$ and $-\beta$, for quadratic Pisot numbers $\beta$ and focus on comparing the combinatorial structure of the sets $\Z_\beta$ and $\Z_{-\beta}$ of numbers with integer expansion in base…
Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…
Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…