Continued Fractions and Unique Additive Partitions

A partition of the positive integers into sets A and B avoids a set S N if no two distinct elements in the same part have a sum in S. If the partition is unique, S is uniquely avoidable. For any irrational > 1, Chow and Long constructed a partition which avoids the numerators of all convergents of the continued fraction for , and conjectured that the set S which this partition avoids is uniquely avoidable. We prove that the set of numerators of convergents is uniquely avoidable if and only if the continued fraction for has infinitely many partial quotients equal to 1. We also construct the set S and show that it is always uniquely avoidable.     

Linear Forms in Finite Sets of Integers

Let A_1, ..., A_r be finite, nonempty sets of integers, and let h_1,..., h_r be positive integers. The linear formh_1A_1 + ··· + h_rA_r is the set of all integers of the form b_1 + ··· + b_r, where b_i is an integer that can be represented as the sum ofh_i elements of the set A_i. In this paper, the structure of the linear form h_1A_1 + ··· + h_rA_r is completely determined for all sufficiently large integersh_i .     

Additive and multiplicative Sidon sets

Summary Inspired by a paper of Sárk?zy [4] we study sets of integers and sets of residues with the property that all sums and all products are distinct.     

LCM矩阵的可逆性与不定方程ayz+bzx+cxy=xyz+1的解

设S＝{x1,x2,…xn}是不同正整数的集合。已经知道当n≤7时在最大公因数封闭集S上的LCM矩阵是可逆的；也知道当n≥9时有无限多个包含整数1的最大公因数封闭集它们的LCM矩阵是奇异的；这篇文章的主要结果是证明当n=8且包含整数1时，除了20个最大公因数封闭集外，其余所有最大公因数封闭集上的LCM矩阵都是可逆的，而这归结为解一个不定方程。     

On sums and products of integers

Erdos and Szemerédi conjectured that if is a set of positive integers, then there must be at least integers that can be written as the sum or product of two elements of . Erdos and Szemerédi proved that this number must be at least for some and . In this paper it is proved that the result holds for .

     

Path spectra for trees

The path spectrum of a graph is the set of lengths of all maximal paths in the graph. A set S of positive integers is spectral if it is the path spectrum of a tree. We characterize the spectral sets containing at most two odd integers (and arbitrarily many even ones) and obtain several necessary conditions for a set to be spectral. We show that for each even integer s≥2 at least 1/4 of all subsets of the set {2,3,…,s} are spectral and conjecture that all the subsets with at least 3s/4 integers are spectral.     

Sumsets contained in infinite sets of integers

If the positive integers are partitioned into a finite number of cells, then Hindman proved that there exists an infinite set B such that all finite, nonempty sums of distinct elements of B all belong to one cell of the partition. Erdös conjectured that if A is a set of integers with positive asymptotic density, then there exist infinite sets B and C such that B + C ? A. This conjecture is still unproved. This paper contains several results on sumsets contained in finite sets of integers. For example, if A is a set of integers of positive upper density, then for any n there exist sets B and F such that B has positive upper density, F has cardinality n, and B + F ? A.     

Sequences of integers with missing differences

This paper deals with the following problem posed by Professor T. S. Motzkin: Suppose M is a given set of positive integers. How dense can a set S of positive integers be, if no two elements of S are allowed to differ by an element of M? The problem is solved for |M| ? 2, and some partial results are obtained in the general case.     

On sums and products of integers

Erdös and Szemerédi proved that if is a set of positive integers, then there must be at least integers that can be written as the sum or product of two elements of , where is a constant and . Nathanson proved that the result holds for . In this paper it is proved that the result holds for and .

     

Fractional chromatic number and circular chromatic number for distance graphs with large clique size

An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005 . Let M be a set of positive integers. The distance graph generated by M, denoted by G(Z, M), has the set Z of all integers as the vertex set, and edges ij whenever |i?j| ∈ M. We investigate the fractional chromatic number and the circular chromatic number for distance graphs, and discuss their close connections with some number theory problems. In particular, we determine the fractional chromatic number and the circular chromatic number for all distance graphs G(Z, M) with clique size at least |M|, except for one case of such graphs. For the exceptional case, a lower bound for the fractional chromatic number and an upper bound for the circular chromatic number are presented; these bounds are sharp enough to determine the chromatic number for such graphs. Our results confirm a conjecture of Rabinowitz and Proulx 22 on the density of integral sets with missing differences, and generalize some known results on the circular chromatic number of distance graphs and the parameter involved in the Wills' conjecture 26 (also known as the “lonely runner conjecture” 1 ). © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 129–146, 2004     

Arithmetics of the numbers of orbits of the Fermat–Euler dynamical systems

Given positive integers a and n with (a,n)=1, we consider the Fermat–Euler dynamical system defined by the multiplication by a acting on the set of residues modulo n relatively prime to n. Given an integer M>1, the integers n for which the number of orbits of this dynamical system is a multiple of M form an ideal in the multiplicative semigroup of odd integers. We provide new results on the arithmetical properties of these ideals by using the topological properties of some directed graphs (the monads).      

Proportionally modular diophantine inequalities

We study the sets of nonnegative solutions of Diophantine inequalities of the form with a,b and c positive integers. These sets are numerical semigroups, which we study and characterize.     

Approximating the number of integers free of large prime factors

Define to be the number of positive integers such that has no prime divisor larger than . We present a simple algorithm that approximates in floating point operations. This algorithm is based directly on a theorem of Hildebrand and Tenenbaum. We also present data which indicate that this algorithm is more accurate in practice than other known approximations, including the well-known approximation , where is Dickman's function.

     

Remarks on Steinhaus' property and ratio sets of sets of positive integers

This paper is closely related to an earlier paper of the author and W. Narkiewicz (cf. [7]) and to some papers concerning ratio sets of positive integers (cf. [4], [5], [12], [13], [14]). The paper contains some new results completing results of the mentioned papers. Among other things a characterization of the Steinhaus property of sets of positive integers is given here by using the concept of ratio sets of positive integers.     

扇的倍图的邻点可区别边色数

设G(V,E)是阶数至少是3的简单连通图,若f是图G的k-正常边染色,使得对任意的uv∈E(G),C(u)≠C(v),那么称f是图G的k-邻点可区别边染色(k-ASEC),其中C(u)={f(uw)│uw∈E(G)},而χa′s(G)=min{k│存在G的一个k-ASEC},称为G的邻点可区别边色数.本文给出扇的倍图D(Fm)的邻点可区别边色数.     

On some relations between ideals of nowhere dense sets in topologies on positive integers

Periodica Mathematica Hungarica - We examine the ideals of nowhere dense sets in three topologies on the set of positive integers, namely Furstenberg’s, Rizza’s and the common division...     

On an additive property of sequences of nonnegative integers

Periodica Mathematica Hungarica - Let a1&;lt;... be an infinite sequence of positive integers, let k≥2 be a fixed integer and denote by Rk(n) the number of solutions of n=ai1+ai2+...+aik....     

Addendum to J. Cilleruelo,D.S. Ramana,and O. Ramaré’s paper “Quotient and product sets of thin subsets of the positive integers”

The purpose of this note is to prove two results on the quotient sets A/A of finite sets A ? [1, n] of positive integers. They complement the results from the paper by J. Cilleruelo, D.S. Ramana, and O. Ramaré.     

Sums of primes and quadratic linear recurrence sequences

Let u be a sequence of positive integers which grows essentially as a geometric progression. We give a criterion on u in terms of its distribution modulo d, d = 1, 2,..., under which the set of positive integers expressible by the sum of a prime number and an element of u has a positive lower density. This criterion is then checked for some second order linear recurrence sequences. It follows, for instance, that the set of positive integers of the form p ＋ [（2 ＋ √3）n], where p is a prime number and n is a positive integer, has a positive lower density. This generalizes a recent result of Enoch Lee. In passing, we show that the periods of linear recurrence sequences of order m modulo a prime number p cannot be ＂too small＂ for most prime numbers p.     

Finiteness results for F-Diophantine sets

Monatshefte für Mathematik - Diophantine sets, i.e. sets of positive integers A with the property that the product of any two distinct elements of A increased by 1 is a perfect square, have a...