arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06405math.COmath.NT
收藏

图的边的和、积与比

Sums, products and ratios along the edges of a graph

Noga Alon, Imre Ruzsa, Jozsef Solymosi

摘要:

在其开创性的文件Erdés和Szemerédi制定的Aktures的大小和积集的整数。他们猜想的最强形式是关于沿着图的边的和与积。在本文中,我们表明,这种强形式的Erdens-Szemerédi猜想不成立。给出了图的边的和集、积集和比集的基数的上界和下界。

英文摘要:

In their seminal paper Erdős and Szemerédi formulated conjectures on the size of sumset and product set of integers. The strongest form of their conjecture is about sums and products along the edges of a graph. In this paper we show that this strong form of the Erdős-Szemerédi conjecture does not hold. We give upper and lower bounds on the cardinalities of sumsets, product sets and ratio sets along the edges of graphs.

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

↑