arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1908.00057math.NT
收藏

关于积大于商的集合

On Sets with More Products than Quotients

Hung Viet Chu

摘要:

给定一个有限集合$A\subset \mathbb{R}\backslash \{0\}$,定义\begin{align*}&A\cdot A \ =\ \{a_i\cdot a_j\,|\, a_i,a_j\in A\},\\ &A/A \ =\ \{a_i/a_j\,|\,a_i,a_j\in A\},\\ &A + A \ =\ \{a_i + a_j\,|\, a_i,a_j\in A\},\\ &A - A \ =\ \{a_i - a_j\,|\,a_i,a_j\in A\}.\end{align*}如果$|A\cdot A|>|A/A|$,则集合$A$称为MPTQ(积大于商),如果$|A + A|>|A - A|$,则称为MSTD(和大于差)。由于乘法和加法是可交换的,而除法和减法不是,因此很自然地认为MPTQ和MSTD集合非常罕见。然而,它们确实存在。本文首先给出了$\{1,2,\ldots,n\}$的MPTQ子集的有效搜索,并证明了作为$n\rightarrow \infty$,MPTQ子集的比例逼近$0$ .其次,我们证明了正数的MPTQ集必须至少有$8$元素,而负数和正数的MPTQ集必须至少有$5$元素。最后,我们研究了几个序列,没有MPTQ子集。

英文摘要:

Given a finite set $A\subset \mathbb{R}\backslash \{0\}$, define \begin{align*}&A\cdot A \ =\ \{a_i\cdot a_j\,|\, a_i,a_j\in A\},\\ &A/A \ =\ \{a_i/a_j\,|\,a_i,a_j\in A\},\\ &A + A \ =\ \{a_i + a_j\,|\, a_i,a_j\in A\},\\ &A - A \ =\ \{a_i - a_j\,|\,a_i,a_j\in A\}.\end{align*} 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\rightarrow \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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑