Home Maximal Density and the Kappa Values for the Families {a, a + 1, 2a + 1, n} and {a, a + 1, 2a + 1, 3a + 1, n}
Article
Licensed
Unlicensed Requires Authentication

Maximal Density and the Kappa Values for the Families {a, a + 1, 2a + 1, n} and {a, a + 1, 2a + 1, 3a + 1, n}

  • Ram Krishna Pandey EMAIL logo and Neha Rai
Published/Copyright: June 15, 2023
Become an author with De Gruyter Brill

ABSTRACT

Let M be a set of positive integers. We study the maximal density μ(M) of the sets of nonnegative integers S whose elements do not differ by an element in M. In 1973, Cantor and Gordon established a formula for μ(M) for |M| ≤ 2. Since then, many researchers have worked upon the problem and found several partial results in the case |M| ≥ 3, including some results in the case when M is an infinite set. In this paper, we study the maximal density problem for the families M = {a, a+1, 2a+1, n} and M = {a, a+1, 2a+1, 3a+1, n}, where a and n are positive integers and n is sufficiently large. In most of the cases, we find bounds for the parameter kappa, denoted by κ(M), which actually serves as a lower bound for μ(M). The parameter κ(M) has already got its importance due to its rich connection with problems such as the “lonely runner conjecture” in Diophantine approximation and coloring parameters such as “circular coloring” and “fractional coloring” in graph theory. We also give some partial results for the general family M = {a, a +1, 2a + 1,…, (s – 2)a + 1, n}, where s ≥ 5 and mention related problems in the remaining cases for future work.

2020 Mathematics Subject Classification: Primary 11B05; Secondary 05C15

(Communicated by Marco Cantarini)


Funding statement: The first author is thankful to the Council of Scientific and Industrial Research (CSIR) for providing the research grant no. 25(0314)/20/EMR-II.

Acknowledgement

The authors thank the referees for their very useful suggestions which considerably improved the paper.

REFERENCES

[1] Cantor, D. G.—Gordon, B.: Sequences of integers with missing differences, J. Combin. Theory Ser. A 14 (1973), 281–287.10.1016/0097-3165(73)90003-4Search in Google Scholar

[2] Chang, G.—Liu, D. D.-F.—Zhu, X.: Distance graphs and T-colorings, J. Combin. Theory Ser. B 75 (1999), 159–169.10.1006/jctb.1998.1881Search in Google Scholar

[3] 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.10.1007/978-3-319-19315-1_22Search in Google Scholar

[4] Cusick, T. W.: View-obstruction problems in n-dimensional geometry, J. Combin. Theory Ser. A 16 (1974), 1–11.10.1016/0097-3165(74)90066-1Search in Google Scholar

[5] Griggs, J. R.—Liu, D. D.-F.: The channel assignment problem for mutually adjacent sites, J. Combin. Theory Ser. A 68 (1994), 169–183.10.1016/0097-3165(94)90096-5Search in Google Scholar

[6] Gupta, S.: Sets of integers with missing differences, J. Combin. Theory Ser. A 89 (2000), 55–69.10.1006/jcta.1999.3003Search in Google Scholar

[7] Gupta, S.—Tripathi, A.: Density of M-sets in arithmetic progression, Acta Arith. 89 (1999), 255–257.10.4064/aa-89-3-255-257Search in Google Scholar

[8] Haralambis, N. M.: Sets of integers with missing differences, J. Combin. Theory Ser. A 23 (1977), 22–23.10.1016/0097-3165(77)90076-0Search in Google Scholar

[9] Liu, D. D.-F.: From rainbow to the lonely runner: A survey on coloring parameters of distance graphs, Taiwanese J. Math. 12 (2008), 851–871.10.11650/twjm/1500404981Search in Google Scholar

[10] Liu, D. D.-F.—Robinson, G.: Sequences of integers with three missing separations, European J. Combin. 85 (2020), Art. ID 103056.10.1016/j.ejc.2019.103056Search in Google Scholar

[11] Liu, D. D.-F.—Sutedja, A.: Chromatic number of distance graphs generated by the sets {2, 3, x, y}, J. Comb. Optim. 25 (2013), 680–693.10.1007/s10878-012-9509-4Search in Google Scholar

[12] Liu, D. D.-F.—Zhu, X.: Fractional chromatic number for distance graphs with large clique size, J. Graph Theory 47 (2004), 129–146.10.1002/jgt.20020Search in Google Scholar

[13] Liu, D. D.-F.—Zhu, X.: Fractional chromatic number of distance graphs generated by two-interval sets, European J. Combin. 29 (2008), 1733–1742.10.1016/j.ejc.2007.09.007Search in Google Scholar

[14] Motzkin, T. S.: Problems collection, unpublished.Search in Google Scholar

[15] Pandey, R. K.—Rai, N.: Density of sets with missing differences and applications, Math. Slovaca 71 (2021), 595–614.10.1515/ms-2021-0006Search in Google Scholar

[16] Pandey, R. K.—Rai, N.: Maximal density of sets with missing differences and various coloring parameters of distance graphs, Taiwanese J. Math. 24 (2020), 1383–1397.10.11650/tjm/200403Search in Google Scholar

[17] Pandey, R. K.—Srivastava, A.: Maximal density of integral sets with missing differences and the kappa values, Taiwanese J. Math. 26 (2022), 17–32.10.11650/tjm/210702Search in Google Scholar

[18] Pandey, R. K.—Tripathi, A.: A note on the density of M-sets in geometric sequence, Ars Combin. 119 (2015), 221–224.Search in Google Scholar

[19] Pandey, R. K.—Tripathi, A.: A note on a problem of Motzkin regarding density of integral sets with missing differences, J. Integer Sequences 14 (2011), Art. 11.6.3.Search in Google Scholar

[20] Pandey, R. K.—Tripathi, A.: On the density of integral sets with missing differences from sets related to arithmetic progressions, J. Number Theory 131 (2011), 634–647.10.1016/j.jnt.2010.09.013Search in Google Scholar

[21] Srivastava, A.—Pandey, R. K.—Prakash, O.: On the maximal density of integral sets whose differences avoiding the weighted Fibonacci numbers, Integers 17 (2017), A48.Search in Google Scholar

[22] Srivastava, A.—Pandey, R. K.—Prakash, O.: Motzkin’s maximal density and related chromatic numbers, Unif. Distrib. Theory 13 (2018), 27–45.10.1515/udt-2018-0002Search in Google Scholar

[23] Tao, T.: Some remarks on the lonely runner conjecture, Contrib. Discrete Math. 13 (2018), 1–31.Search in Google Scholar

[24] Wills, J. M.: Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen, Monatsh. Math. 71 (1967), 263–269.10.1007/BF01298332Search in Google Scholar

[25] Zhu, X.: Circular chromatic number: A survey, Discrete Math. 229 (2001), 371–410.10.1016/S0012-365X(00)00217-XSearch in Google Scholar

Received: 2022-04-09
Accepted: 2022-06-30
Published Online: 2023-06-15

© 2023 Mathematical Institute Slovak Academy of Sciences

Articles in the same Issue

  1. Parameters in Inversion Sequences
  2. On the Pecking Order Between Those of Mitsch and Clifford
  3. A Note on Cuts of Lattice-Valued Functions and Concept Lattices
  4. Trigonometric Sums and Riemann Zeta Function
  5. Notes on the Equation d(n) = d(φ(n)) and Related Inequalities
  6. Harmony of Asymmetric Variants of the Filbert and Lilbert Matrices in q-form
  7. Maximal Density and the Kappa Values for the Families {a, a + 1, 2a + 1, n} and {a, a + 1, 2a + 1, 3a + 1, n}
  8. Extensions in Time Scales Integral Inequalities of Jensen’s Type via Fink’s Identity
  9. A Note on Fractional Simpson Type Inequalities for Twice Differentiable Functions
  10. Extended Bromwich-Hansen Series
  11. Iterative Criteria for Oscillation of Third-Order Delay Differential Equations with p-Laplacian Operator
  12. Vallée-Poussin Theorem for Equations with Caputo Fractional Derivative
  13. On Oscillatory Behavior of Third Order Half-Linear Delay Differential Equations
  14. On Existence and Uniqueness of Solutions for Ordinary Differential Equations in Locally Convex Topological Linear Spaces
  15. Bounds on Blow-Up Time for a Higher-Order Non-Newtonian Filtration Equation
  16. On a Solvable System of Difference Equations in Terms of Generalized Fibonacci Numbers
  17. The Smallest and the Largest Families of Some Classes of 𝒜-Continuous Functions
  18. Type II Exponentiated Half-Logistic Gompertz-G Family of Distributions: Properties and Applications
  19. Strong Consistency of Least-Squares Estimators in the Simple Linear Errors-in-Variables Regression Model with Widely Orthant Dependent Random Variables
Downloaded on 23.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ms-2023-0047/html
Scroll to top button