Affiliation:
1. Department of Mathematics , Indian Institute of Technology Roorkee , Roorkee , Uttarakhand , India
Abstract
Abstract
For a given set M of positive integers, a well-known problem of Motzkin asks to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers in which no two elements differ by an element in M. In 1973, Cantor and Gordon find μ(M) for |M| ≤ 2. Partial results are known in the case |M| ≥ 3 including some results in the case when M is an infinite set. Motivated by some 3 and 4-element families already discussed by Liu and Zhu in 2004, we study μ(M) for two families namely, M = {a, b,a + b, n(a + b)} and M = {a, b, b − a, n(b − a)}. For both of these families, we find some exact values and some bounds on μ(M). This number theory problem is also related to various types of coloring problems of the distance graphs generated by M. So, as an application, we also study these coloring parameters associated with these families.
Reference23 articles.
1. Barajas, J.—Serra, O.: Distance graphs with maximum chromatic number, Disc. Math. 308 (2008), 1355–1365.
2. Cantor, D. G.—Gordon, B.: Sequences of integers with missing differences, J. Combin. Theory Ser. A 14 (1973), 281–287.
3. Chang, G.—Liu, D. D.-F.—Zhu, X.: Distance graphs and T-colorings, J. Combin. Theory Ser. B75 (1999), 159–169.
4. Collister, D.—Liu, D. D.-F.: Study of κ(D) for D = {2, 3, x, y}. In: Combinatorial Algorithms. Lecture Notes in Comput. Sci. 8986, Springer, Berlin, 2015, pp. 250–261.
5. Cusick, T. W.: View-obstruction problems in n-dimensional geometry, J. Combin. Theory Ser. A 16 (1974), 1–11.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献