Let O be the ring of S-integers in a number field k. We prove that if the group of units O^* is infinite then every matrix in $Γ$ = SL_2(O) is a product of at most 9 elementary matrices. This completes a long line of research in this direction. As a consequence, we obtain that $Γ$ is boundedly generated as an abstract group.
It is known that the Scholz conjecture on addition chains is true for all integers $n$ with $\ell(2n) = \ell(n)+1$. There exists infinitely many integers with $\ell(2n) \leq \ell(n)$ and we don't know if the conjecture still holds for them. The conjecture is also proven to hold for integers $n$ with $v(n) \leq 5$ and for infinitely many integers with $v(n)=6$. There is no specific results on integers with $v(n)=7$. In \cite{thurber}, an infinite list of integers satisfying $\ell(n) = \ell(2n)$ and $v(n) = 7$ is given. In this paper, we prove that the conjecture holds for all of them.
Bounded generation by root elements is a property which has been widely studied for various types of linear algebraic groups defined over rings of integers in algebraic number fields. However, when considering global function fields, there are not many results beyond the treatment of special cases due to Nica and Queen. In this paper, we use model theoretic methods due to Carter, Keller and Paige written up by Morris to prove bounded generation by root elements for simply connected, split Chevalley groups defined over the ring of all integers in a global function field. We further apply this b…
Let $L$ be a primitive Gaussian line, that is, a line in the complex plane that contains two, and hence infinitely many, coprime Gaussian integers. We prove that there exists an integer $G_L$ such that for every integer $n\geq G_L$ there are infinitely many sequences of $n$ consecutive Gaussian integers on $L$ with the property that none of the Gaussian integers in the sequence is coprime to all the others. We also investigate the smallest integer $g_L$ such that $L$ contains a sequence of $g_L$ consecutive Gaussian integers with this property. We show that $g_L\neq G_L$ in general. Also, $g_L…
A positive integer is called an $E_j$-number if it is the product of $j$ distinct primes. We prove that there are infinitely many triples of $E_2$-numbers within a gap size of $32$ and infinitely many triples of $E_3$-numbers within a gap size of $15$. Assuming the Elliot-Halberstam conjecture for primes and $E_2$-numbers, we can improve these gaps to $12$ and $5$, respectively. We can obtain even smaller gaps for almost primes, almost prime powers, or integers having the same exponent pattern in the their prime factorizations. In particular, if $d(x)$ denotes the number of divisors of $x$, we…
In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using covering systems and the theory of cyclotomic polynomials, the following theorem is proved: for any integer $m>1$, there are infinitely many integers $k$ satisfying $k\not\equiv-1\!\pmod{q}$ for any prime number $q|(m-1)$, such that for any positive integer $n$, $km^n+1$ is a composite number. These positive integers $k$ are called "Sierpinski numbers based $m$".…
In this article, we study several probabilistic properties of polynomials defined over the ring of $p$-adic integers under the Haar measure. First, we calculate the probability that a monic polynomial is separable, generalizing a result of Polak. Second, we introduce the notion of two polynomials being strongly coprime and calculate the probability of two monic polynomials {being} strongly coprime. Finally, we explain how our method can be used to extrapolate other probabilistic properties of polynomials over the ring of $p$-adic integers from polynomials defined over the integers modulo power…
In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish upper and lower bounds for integer complexity, investigate the complexity of roots of unity using cyclotomic polynomials, and introduce a concept of "minimality.'' In polynomials over the naturals, we establish bounds on the sizes of complexity classes and establish a trivial but useful upper bound. In the integers mod $m$, we introduce the concepts of "ineffic…
It was shown by M. Bhargava and P. Harron that for $n=3,4,5$, the shapes of rings of integers of $S_n$-number fields of degree $n$ become equidistributed in the space of shapes when the fields are ordered by discriminant. Instead of shapes, we correspond grids to each number field, which preserve more of the number fields' data. The space of grids is a fiber bundle over the space of shapes. We strengthen Bhargava-Harron's result by proving that the grids of rings of integers of $S_n$-number fields become equidistributed in the space of grids.
We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite integers n such that p+1 divides n-1 for each prime p dividing n.
We prove that the ring of integers in the totally real cubic subfield $K^{(49)}$ of the cyclotomic field $\mathbb{Q}(ζ_7)$ has Pythagoras number equal to $4$. This is the smallest possible value for a totally real number field of odd degree. Moreover, we determine which numbers are sums of integral squares in this field, and use this knowledge to construct a diagonal universal quadratic form in five variables.
An Ulam sequence U(1,n) is defined as the sequence starting with integers 1,n such that n > 1, and such that every subsequent term is the smallest integer that can be written as the sum of distinct previous terms in exactly one way. This family of sequences is notable for being the subject of several remarkable rigidity conjectures. We introduce an analogous notion of an Ulam sequence inside the polynomial ring Z[X], and use it both to give new, constructive proofs of old results as well as producing a new conjecture that implies many of the other existing conjectures.
The classical Frobenius problem is to find the largest integer that cannot be written as a linear combination of a given set of positive, coprime integers using nonnegative integer coefficients. Prior work has generalized the classical Frobenius problem from integers to Frobenius problems in other rings. This paper explores Frobenius problems in various rings of (upper) triangular $2 \times 2$ matrices with constant diagonal.
