##
**On sets with more products than quotients.**
*(English)*
Zbl 1469.11018

Summary: Given a finite set \(A \subset \mathbb{R} \backslash\{0\}\), define \[\begin{aligned} A \cdot A & = \{a_i \cdot a_j \mid a_i, a_j \in A\}, & A / A & = \{a_i / a_j \mid a_i, a_j \in A\}, \\ A + A & = \{a_i + a_j \mid a_i, a_j \in A\}, & A-A & = \{a_i - a_j \mid a_i, a_j \in A\}. \end{aligned}\] The set \(A\) is said to be MPTQ (more product than quotient) if \(|A\cdot A|>|A/ A|\) and MSTD (more sum than difference) if \(|A+A|>|A-A|\). Since multiplication and addition are commutative while division and subtraction are not, it is natural to think that MPTQ and MSTD sets are very rare. However, they do exist. This paper first shows an efficient search for MPTQ subsets of \(\{1,2,\ldots,n\}\) and proves that as \(n\to\infty\), the proportion of MPTQ subsets approaches \(0\). Next, we prove that MPTQ sets of positive numbers must have at least \(8\) elements, while MPTQ sets of both negative and positive numbers must have at least \(5\) elements. Finally, we investigate several sequences that do not have MPTQ subsets.

### MSC:

11B13 | Additive bases, including sumsets |

11B75 | Other combinatorial number theory |

11P70 | Inverse problems of additive number theory, including sumsets |

PDF
BibTeX
XML
Cite

\textit{H. V. Chu}, Rocky Mt. J. Math. 50, No. 2, 499--512 (2020; Zbl 1469.11018)

### References:

[1] | H. V. Chu, “When sets are not sum-dominant”, J. Integer Seq. 22:3 (2019), art. id. 19.3.7, 16 pp. · Zbl 1418.11018 |

[2] | H. V. Chu, N. Luntzlara, S. J. Miller, and L. Shao, “Generalizations of a curious family of MSTD sets hidden by interior blocks”, 2018. · Zbl 1434.11029 |

[3] | H. V. Chu, N. McNew, S. J. Miller, V. Xu, and S. Zhang, “When sets can and cannot have sum-dominant subsets”, J. Integer Seq. 21:8 (2018), Art. 18.8.2, 16. · Zbl 1408.11006 |

[4] | H. V. Chu, N. Luntzlara, S. J. Miller, and L. Shao, “Infinite families of partitions into MSTD subsets”, Integers 19 (2019), art. id. A60, 20 pp. · Zbl 1467.11012 |

[5] | J. Cilleruelo and J. Guijarro-Ordóñez, “Ratio sets of random sets”, Ramanujan J. 43:2 (2017), 327-345. · Zbl 1421.11077 |

[6] | P. Erdős, “An asymptotic inequality in the theory of numbers”, Vestnik Leningrad. Univ. 15:13 (1960), 41-49. · Zbl 0104.26804 |

[7] | G. A. Freĭman, A. M. Rubinov, and E. V. Novoselov (editors), Number theoretic studies in the Markov spectrum and in the structural theory of set addition, Kalinin. Gosudarstv. Univ., Moscow, 1973. · Zbl 0305.00003 |

[8] | P. V. Hegarty, “Some explicit constructions of sets with more sums than differences”, Acta Arith. 130:1 (2007), 61-77. · Zbl 1147.11014 |

[9] | G. Iyer, O. Lazarev, S. J. Miller, and L. Zhang, “Generalized more sums than differences sets”, J. Number Theory 132:5 (2012), 1054-1073. · Zbl 1268.11014 |

[10] | G. Iyer, O. Lazarev, S. J. Miller, and L. Zhang, “Finding and counting MSTD sets”, pp. 79-98 in Combinatorial and additive number theory- CANT 2011 and 2012, edited by M. B. Nathanson, Springer Proc. Math. Stat. 101, Springer, New York, 2014. · Zbl 1360.11023 |

[11] | J. Marica, “On a conjecture of Conway”, Canad. Math. Bull. 12 (1969), 233-234. · Zbl 0316.10034 |

[12] | G. Martin and K. O’Bryant, “Many sets have more sums than differences”, pp. 287-305 in Additive combinatorics, edited by A. Granville et al., CRM Proc. Lecture Notes 43, Amer. Math. Soc., Providence, RI, 2007. · Zbl 1173.11014 |

[13] | S. J. Miller and D. Scheinerman, “Explicit constructions of infinite families of MSTD sets”, pp. 229-248 in Additive number theory, edited by D. Chudnovsky and G. Chudnovsky, Springer, New York, 2010. · Zbl 1251.11070 |

[14] | S. J. Miller and K. Vissuet, “Most subsets are balanced in finite groups”, pp. 147-157 in Combinatorial and additive number theory- CANT 2011 and 2012, edited by M. B. Nathanson, Springer Proc. Math. Stat. 101, Springer, New York, 2014. · Zbl 1371.11021 |

[15] | S. J. Miller, B. Orosz, and D. Scheinerman, “Explicit constructions of infinite families of MSTD sets”, J. Number Theory 130:5 (2010), 1221-1233. · Zbl 1251.11070 |

[16] | J. Nagura, “On the interval containing at least one prime number”, Proc. Japan Acad. 28 (1952), 177-181. · Zbl 0047.04405 |

[17] | M. B. Nathanson, “Problems in additive number theory I”, pp. 263-270 in Additive combinatorics, edited by A. Granville et al., CRM Proc. Lecture Notes 43, Amer. Math. Soc., Providence, RI, 2007. · Zbl 1183.11006 |

[18] | M. B. Nathanson, “Sets with more sums than differences”, Integers 7 (2007), art. id. A5, 24 pp. · Zbl 1107.11017 |

[19] | M. B. Nathanson, “MSTD sets and Freiman isomorphisms”, Funct. Approx. Comment. Math. 58:2 (2018), 187-205. · Zbl 1418.11022 |

[20] | I. Z. Ruzsa, “On the cardinality of \(A+A\) and \(A-A\)”, pp. 933-938 in Combinatorics (Proc. Fifth Hungarian Colloq.), Vol. II (Keszthely, Hungary, 1976), edited by A. Hajna and V. T. Sos, Colloq. Math. Soc. János Bolyai 18, North-Holland, Amsterdam, 1978. · Zbl 0383.04003 |

[21] | I. Z. Ruzsa, “Sets of sums and differences”, pp. 267-273 in Seminar on number theory (Paris, 1982-1983), edited by M.-J. Bertin and C. Goldstein, Progr. Math. 51, Birkhäuser, Boston, 1984. · Zbl 0548.10038 |

[22] | I. Z. Ruzsa, “On the number of sums and differences”, Acta Math. Hungar. 59:3-4 (1992), 439-447. · Zbl 0773.11010 |

[23] | Y. Zhao, “Constructing MSTD sets using bidirectional ballot sequences”, J. Number Theory 130:5 (2010), 1212-1220. · Zbl 1218.11097 |

[24] | Y. Zhao, “Counting MSTD sets in finite abelian groups”, J. Number Theory 130:10 (2010), 2308-2322. · Zbl 1261.11012 |

[25] | Y. · Zbl 1261.11015 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.