On sets with more products than quotients

DOI10.1216/RMJ.2020.50.499MaRDI QIDQ2188443zbMATH OpenOpenAlexFDO

Authors Hùng Viẹt Chu

Publication date 11 June 2020

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1908.00057, https://projecteuclid.org/euclid.rmjm/1590739285

zbMATH Keywords

product setMSTDquotient set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)

Abstract: Given a finite set $$, define �egin{align*}&Acdot A = {a_icdot a_j,|, a_i,a_jin A},\ &A/A = {a_i/a_j,|,a_i,a_jin A},\ &A + A = {a_i + a_j,|, a_i,a_jin A},\ &A - A = {a_i - a_j,|,a_i,a_jin A}.end{align*} The set $A$ is said to be MPTQ (more product than quotient) if $|AcdotA|>|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 $nightarrowinfty$, 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.

Recommendations

• Sets with more sums than differences
• Sets characterized by missing sums and differences
• Finding and Counting MSTD Sets
• Some explicit constructions of sets with more sums than differences
• A geometric perspective on the MSTD question

Cites work

• scientific article; zbMATH DE number 3170408 (Why is no real title available?)
• scientific article; zbMATH DE number 3873442 (Why is no real title available?)
• scientific article; zbMATH DE number 3477063 (Why is no real title available?)
• scientific article; zbMATH DE number 3595193 (Why is no real title available?)
• 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
• Generalizations of a curious family of MSTD sets hidden by interior blocks
• Generalized more sums than differences sets
• Infinite Families of Partitions into MSTD Subsets
• MSTD sets and Freiman isomorphisms
• Many sets have more sums than differences
• Most subsets are balanced in finite groups
• On A Conjecture of Conway
• On the interval containing at least one prime number
• On the number of sums and differences
• Problems in additive number theory. I
• Ratio sets of random sets
• Sets characterized by missing sums and differences
• Sets with more sums than differences
• Some explicit constructions of sets with more sums than differences
• When Sets Are Not Sum-dominant
• When sets can and cannot have sum-dominant subsets

Cited in

(4)

• On the minimum cardinality of MPTQ sets
• On product sets of rationals
• On expressible sets of products
• When sets can or cannot be product-dominant

This page was built for publication: On sets with more products than quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188443)