λ³Έλ¬Έ λ°”λ‘œκ°€κΈ°
KERD
λ…Όλ¬ΈKCI λ“±μž¬

WHEN SETS CAN OR CANNOT BE PRODUCT-DOMINANT

0

쑰회

0

λ‹€μš΄λ‘œλ“œ

0

인용

0

μ°Έκ³ λ¬Έν—Œ

ν‚€μ›Œλ“œ

μ£Όμ œλΆ„λ₯˜μˆ˜ν•™

초둝

Given a finite set 𝐴 βŠ‚ ℝ, we define 𝐴 + 𝐴 = {a + aβ€² ∣ a, aβ€² ∈ 𝐴}, 𝐴 βˆ’ 𝐴 = {a βˆ’ aβ€² ∣ a, aβ€² ∈ 𝐴}, 𝐴 β‹… 𝐴 = {aaβ€² ∣ a, aβ€² ∈ 𝐴}, 𝐴 βˆ• 𝐴 = {a βˆ• aβ€² ∣ a, aβ€² ∈ 𝐴, aβ€² β‰  0}. A set 𝐴 is said to be sum-dominant or MSTD (More Sums than Differences) if |𝐴 + 𝐴| > |𝐴 βˆ’ 𝐴|, and a set 𝐴 βŠ‚ ℝ βˆ– {0} is said to be product-dominant or MPTQ (More Products than Quotients) if |𝐴 β‹… 𝐴| > |𝐴 βˆ• 𝐴|. In this paper, we shall discuss several properties of MPTQ sets, investigate techniques of generating an infinite family of MPTQ sets, and identify some characterizations under which a finite set of numbers can or cannot be product-dominant. We confirm the existence of MPTQ sets of perfect squares and justify that 𝑛ᡗʰ powers of prime numbers do not contain any MPTQ set. We extend the notion of MPTQ sets to the multiplicative group β„€β‚š* and recognize their correspondence with the MSTD sets in β„€β‚šβ‚‹β‚.

Abstract

Given a finite set 𝐴 βŠ‚ ℝ, we define 𝐴 + 𝐴 = {a + aβ€² ∣ a, aβ€² ∈ 𝐴}, 𝐴 βˆ’ 𝐴 = {a βˆ’ aβ€² ∣ a, aβ€² ∈ 𝐴}, 𝐴 β‹… 𝐴 = {aaβ€² ∣ a, aβ€² ∈ 𝐴}, 𝐴 βˆ• 𝐴 = {a βˆ• aβ€² ∣ a, aβ€² ∈ 𝐴, aβ€² β‰  0}. A set 𝐴 is said to be sum-dominant or MSTD (More Sums than Differences) if |𝐴 + 𝐴| > |𝐴 βˆ’ 𝐴|, and a set 𝐴 βŠ‚ ℝ βˆ– {0} is said to be product-dominant or MPTQ (More Products than Quotients) if |𝐴 β‹… 𝐴| > |𝐴 βˆ• 𝐴|. In this paper, we shall discuss several properties of MPTQ sets, investigate techniques of generating an infinite family of MPTQ sets, and identify some characterizations under which a finite set of numbers can or cannot be product-dominant. We confirm the existence of MPTQ sets of perfect squares and justify that 𝑛ᡗʰ powers of prime numbers do not contain any MPTQ set. We extend the notion of MPTQ sets to the multiplicative group β„€β‚š* and recognize their correspondence with the MSTD sets in β„€β‚šβ‚‹β‚.

μ°Έκ³ λ¬Έν—Œ (21)

  1. M. Asada, "Fringe pairs in generalized MSTD sets", International Journal of Number Theory, 13(10), pp.2653~2675 (2017)
  2. H. V. Chu, "When sets are not sum-dominant", J. Integer Seq, 22(3), pp.16~ (2019)
  3. H. V. Chu, "On sets with more products than quotients", Rocky Mountain Journal of Mathematics, 50(2), pp.499~512 (2020)
  4. H. V. Chu, "Union of two arithmetic progressions with the same common difference is not sumdominant", J. Integer Seq, 20 (2020)
  5. H. V. Chu, "When sets can and cannot have sum-dominant subsets", J. Integer Seq, 21(8), pp.16~ (2018)
  6. G. A. Freiman, "Additive Combinatorics, CRM Proc. Lecture Notes" (1973)
  7. P. Hegarty, "Some explicit constructions of sets with more sums than differences", Acta Arith, 130, pp.61~77 (2007)
  8. G. Iyer, "Generalized more sums than differences sets", Journal of Number Theory, 132(5), pp.1054~1073 (2012)
  9. G. Iyer, "Combinatorial and Additive Number Theory", pp.79~98 (2014), Springer
  10. J. Marica, "On a conjecture of Conway", Canadian Mathematical Bulletin, 12(2), pp.233~234 (1969)
  11. G. Martin, "Additive Combinatorics, CRM Proc. Lecture Notes 43", pp.287~305 (2006)
  12. S. J. Miller, "Additive number theory", pp.229~248 (2010), Springer
  13. M. B. Nathanson, "Additive Number Theory The Classical Bases", pp.164~ (1996), Springer Science & Business Media
  14. Nathanson, Melvyn B, "Problems in Additive Number Theory I", Additive Combinatorics, CRM Proc. Lecture Notes, Amer. Math. Soc, pp.263~270 (2007)
  15. M. B. Nathanson, "Sets with more sums than differences", J. Integer Seq, 7 (2007)
  16. M. B. Nathanson, "Binary linear forms over finite sets of integers", Acta Arith, 129(4), pp.341~361 (2007)
  17. D. B. Penman, "Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups", Acta Arith, 165(4), pp.361~383 (2014)
  18. I. Z. Ruzsa, "On the cardinality of A+A and A-A", Coll. Math. Soc. J. Bolyai, 18, pp.933~938 (1978)
  19. I. Z. Ruzsa, "On the number of sums and differences", Acta Mathematica Hungarica, 59, pp.439~447 (1992)
  20. Y. Zhao, "Constructing mstd sets using bidirectional ballot sequences", Journal of Number Theory, 130(5), pp.1212~1220 (2010)
  21. Y. Zhao, "Counting MSTD sets in finite abelian groups", Journal of Number Theory, 130(10), pp.2308~2322 (2010)

κ΄€λ ¨ λ…Όλ¬ΈAIμΆ”μ²œ

이 κ°„ν–‰λ¬Όμ˜ λ‹€λ₯Έ λ…Όλ¬Έ (31건)