A nonstandard technique in combinatorial number theory
نویسندگان
چکیده
منابع مشابه
A nonstandard technique in combinatorial number theory
In the last few years many results in combinatorial number theory have been proved by means of nonstandard techniques. The aim of our talk is to present some of these techniques by means of some selected examples of applications. A particular attention will be given to the study of the following kind of problems: given a diophantine equation P (x1, ..., xn) = 0 we say that this equation is part...
متن کاملApplications of Nonstandard Analysis in Additive Number Theory (a) = Inf
This paper reports recent progress in applying nonstandard analysis to additive number theory, especially to problems involving upper Banach density. 1 Prologue In this paper we use N for the set of all natural numbers. For any two integers a and b, a; b] denotes the interval of all integers x between a and b (a 6 x 6 b). If S is an internal set, jSj denotes the internal cardinality of S. The l...
متن کاملCombinatorial Number Theory
Background. The integer distance graph G(Z, D) with distance set D = {d1, d2, . . .} has the set of integers Z as the vertex set and two vertices x, y ∈ Z are adjacent if and only if |x − y| ∈ D. The integer distance graphs (under Euclidean norm) were first systematically studied by Eggleton–Erdős–Skilton in 1985 [12, 13], and have been investigated in many ways [50, 56, 57, 61]. One of main go...
متن کاملGroups in Combinatorial Number Theory
In combinatorial number theory, there are many topics related to group structure. Even for abelian or cyclic groups, there are some very challenging unsolved conjectures. In this talk we give a survey of problems, results and methods in several fields of combinatorial number theory. The topics include sumsets in additive combinatorics, Snevily’s conjecture and Latin transversals, covers of the ...
متن کاملOn a Combinatorial Problem in Number Theory
1. Introduction One of the problems mentioned injl] (on p. 187) concerns the estimation of the magnitude of the largest number g(N) such that, from every sequence of N distinct natural numbers, one can always select a subsequence of g{N) integers with the property that no sum of two distinct integers of this subsequence belongs to the original sequence. It should be mentioned that the function ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2015
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.02.010