相关论文: On the g.c.d. of an infinite number of integers

Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation…

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

We prove that every arithmetic progression either contains infinitely many Carmichael numbers or none at all. Furthermore, there is a simple criterion for determining which category a given arithmetic progression falls into. In particular,…

We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient…

We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…

Given an infinite group G, we consider the finitely additive measure defined on finite unions of cosets of finite index subgroups. We show that this shares many properties with the size of subsets of a finite group, for instance we can…

We prove limit theorems for the greatest common divisor and the least common multiple of random integers. While the case of integers uniformly distributed on a hypercube with growing size is classical, we look at the uniform distribution on…

If $a$ and $b$ are integers with $b>a>1$, we completely characterize ``long'' arithmetic progressions in the sumsets of the geometric progressions $1, a, a^2, a^3, \ldots$ and $1, b, b^2, b^3, \ldots$. Our proofs utilize recent applications…

Consider the congruence class R_m(a)={a+im:i\in Z} and the infinite arithmetic progression P_m(a)={a+im:i\in N_0}. For positive integers a,b,c,d,m the sum of products set R_m(a)R_m(b)+R_m(c)R_m(d) consists of all integers of the form…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

Given an infinite, compact, monothetic group $G$ we study decompositions and structure of unbounded derivations in a crossed product C$^*$-algebra $C(G)\rtimes\Z$ obtained from a translation on $G$ by a generator of a dense cyclic subgroup.…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

We prove that the palindromic width of HNN extension of a group by proper associated subgroups is infinite. We also prove that the palindromic width of the amalgamated free product of two groups via a proper subgroup is infinite (except…

We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the…

There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a…

We show that, for any $r\geq 1$, if $g_1,\ldots,g_r$ are distinct coprime integers, sufficiently large depending only on $r$, then for any $\epsilon>0$ there are infinitely many integers $n$ such that all but $\epsilon \log n$ of the digits…

Let $\{U_n\}_{n \geqslant 0}$ and $\{G_m\}_{m \geqslant 0}$ be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.