7 research outputs found
On conjectures and problems of Ruzsa concerning difference graphs of S-units
Given a finite nonempty set of primes S, we build a graph with
vertex set by connecting x and y if the prime divisors of both the
numerator and denominator of x-y are from S. In this paper we resolve two
conjectures posed by Ruzsa concerning the possible sizes of induced
nondegenerate cycles of , and also a problem of Ruzsa concerning
the existence of subgraphs of which are not induced subgraphs.Comment: 15 page
30 years of collaboration
We highlight some of the most important cornerstones of the long standing and very fruitful collaboration of the Austrian Diophantine Number Theory research group and the Number Theory and Cryptography School of Debrecen. However, we do not plan to be complete in any sense but give some interesting data and selected results that we find particularly nice. At the end we focus on two topics in more details, namely a problem that origins from a conjecture of Rényi and Erdős (on the number of terms of the square of a polynomial) and another one that origins from a question of Zelinsky (on the unit sum number problem). This paper evolved from a plenary invited talk that the authors gaveat the Joint Austrian-Hungarian Mathematical Conference 2015, August 25-27, 2015 in Győr (Hungary)