On the minimum cardinality of MPTQ sets
Let \(A\) be a finite subset of \(\mathbb{R}\). We define the \textit{sumset} \(A + A=\{a + b:a, b \in A\}\) and the \textit{difference set} \(A - A=\{a-b: a, b \in A\}\). The set \(A\) is called a \textit{MSTD (More Sums Than Differences) set} if \(|A+A|>|A-A|\). In the paper under review, the authors investigate multiplicative analogues of MSTD sets. For a finite set \(A \subset \mathbb{R} \setminus \{0\}\), similar to the sumset and the difference set of \(A\), we define the \textit{product set} \(A \cdot A = \{ab: a, b \in A\}\) and the \textit{quotient set} \(A/A = \{a/b \mid a, b \in A\}\). \N\NH.~V.~Chu defined the \textit{MPTQ (More Products Than Quotients) set} which is a set \(A\) satisfying the inequality \(|A \cdot A| > |A/A|\). The MPTQ sets is closely related to that of MSTD sets via the logarithmic transformation and exponentiation of sets. The MSTD sets have been investigated in detail by various researchers in recent years. For the history and overview of MSTD sets, the reader may refer [\textit{M. B. Nathanson}, in: Additive combinatorics. Providence, RI: American Mathematical Society (AMS). 263--270 (2007; Zbl 1183.11006); Integers 7, No. 1, Paper A05, 24 p. (2007; Zbl 1107.11017)], and the references given therein. In comparison to the MSTD sets, the MPTQ sets are not well-understood. \textit{M. B. Nathanson} [Zbl 1183.11006)] posed the problem to determine the smallest cardinality of an MSTD set. It is known that MPTQ sets of cardinality \(8\) exist via exponentiation of MSTD sets. In studying the minimal cardinality of an MPTQ set, Chu showed that such a set of real numbers must contain at least \(5\) elements (see [\textit{H. V. Chu}, Rocky Mt. J. Math. 50, No. 2, 499--512 (2020; Zbl 1469.11018)]). \N\NIn the paper under review, the authors prove that no set of real numbers with cardinality \(5\) is an MPTQ set, and consequently any MPTQ set of real numbers must contain at least \(6\) elements. They also identify several classes of sets of cardinality \(6\) that are not MPTQ sets. Furthermore, they construct an infinite family of MPTQ sets that do not arise from exponentiating MSTD sets.
- Constructing MSTD sets using bidirectional ballot sequences
- Counting MSTD sets in finite abelian groups
- Explicit constructions of infinite families of MSTD sets
- Finding and Counting MSTD Sets
- Fringe pairs in generalized MSTD sets
- Generalizations of a curious family of MSTD sets hidden by interior blocks
- Generalized more sums than differences sets
- scientific article; zbMATH DE number 3501622 (Why is no real title available?)
- scientific article; zbMATH DE number 3595193 (Why is no real title available?)
- scientific article; zbMATH DE number 914352 (Why is no real title available?)
- Many sets have more sums than differences
- On A Conjecture of Conway
- On sets with more products than quotients
- On the number of sums and differences
- Problems in additive number theory. I
- Sets characterized by missing sums and differences
- Sets with more sums than differences
- Some explicit constructions of sets with more sums than differences
- The union of two arithmetic progressions with the same common difference is not sum-dominant
- When Sets Are Not Sum-dominant
- When sets can and cannot have sum-dominant subsets
This page was built for publication: On the minimum cardinality of MPTQ sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943852)
