We study the logarithm of the least common multiple of the sequence of integers given by 12 + 1, 2 2 + 1, . . . , n2 + 1. Using a result of Homma [4] on the distribution of roots of quadratic polynomials modulo primes we ...

We present a unified general method for the asymptotic study of graphs from the so-called subcritical graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general ...

We give various results about the distribution of the sequence {a n/n}n=1 modulo 1, where a = 2 is a fixed integer. In particular, we find and infinite subsequence A such that {a n/n}n¿A is well distributed. Also we show ...

We solve the twisted conjugacy problem on Thompson’s group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut+(F) are orbit decidable provided a certain conjecture on Thompson’s ...

We prove that, in a finitely generated residually finite group of subexponential growth, the proportion of commuting pairs is positive if and only if the group is virtually abelian. In particular, this covers the case where ...

Constructible sets are needed in many algorithms of Computer Algebra, particularly in the GröbnerCover and other algorithms for parametric polynomial systems. In this paper we review the canonical form ofconstructible sets ...