Sums and products along sparse graphs

Noga Alon, Omer Angel, Itai Benjamini, Eyal Lubetzky

Research output: Contribution to journalArticle

Abstract

In their seminal paper from 1983, Erdo{double acute}s and Szemerédi showed that any n distinct integers induce either n1+e{open} distinct sums of pairs or that many distinct products, and conjectured a lower bound of n2-o(1). They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph G on n labeled vertices. They conjectured a version of the sum-product theorem for general graphs that have at least n1+e{open} edges. In this work, we consider sum-product theorems for sparse graphs, and show that this problem has important consequences already when G is a matching (i. e., n/2 disjoint edges): Any lower bound of the form n1/2+δ for its sum-product over the integers implies a lower bound of n1+δ for the original Erdo{double acute}s-Szemerédi problem. In contrast, over the reals the minimal sum-product for the matching is {circled dash}(√n), hence this approach has the potential of achieving lower bounds specialized to the integers. We proceed to give lower and upper bounds for this problem in different settings. In addition, we provide tight bounds for sums along expanders. A key element in our proofs is a reduction from the sum-product of a matching to the maximum number of translates of a set of integers into the perfect squares. This problem was originally studied by Euler, and we obtain a stronger form of Euler's result using elliptic curve analysis.

Original languageEnglish (US)
Pages (from-to)353-384
Number of pages32
JournalIsrael Journal of Mathematics
Volume188
Issue number1
DOIs
StatePublished - Mar 2012

Fingerprint

Product Graph
Sparse Graphs
Lower bound
Integer
Distinct
Acute
Euler
Square number
Expander
Graph in graph theory
Theorem
Elliptic Curves
Upper and Lower Bounds
Disjoint
Imply

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Sums and products along sparse graphs. / Alon, Noga; Angel, Omer; Benjamini, Itai; Lubetzky, Eyal.

In: Israel Journal of Mathematics, Vol. 188, No. 1, 03.2012, p. 353-384.

Research output: Contribution to journalArticle

Alon, Noga ; Angel, Omer ; Benjamini, Itai ; Lubetzky, Eyal. / Sums and products along sparse graphs. In: Israel Journal of Mathematics. 2012 ; Vol. 188, No. 1. pp. 353-384.
@article{339fe3027620422c8a3a492705aa5a6c,
title = "Sums and products along sparse graphs",
abstract = "In their seminal paper from 1983, Erdo{double acute}s and Szemer{\'e}di showed that any n distinct integers induce either n1+e{open} distinct sums of pairs or that many distinct products, and conjectured a lower bound of n2-o(1). They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph G on n labeled vertices. They conjectured a version of the sum-product theorem for general graphs that have at least n1+e{open} edges. In this work, we consider sum-product theorems for sparse graphs, and show that this problem has important consequences already when G is a matching (i. e., n/2 disjoint edges): Any lower bound of the form n1/2+δ for its sum-product over the integers implies a lower bound of n1+δ for the original Erdo{double acute}s-Szemer{\'e}di problem. In contrast, over the reals the minimal sum-product for the matching is {circled dash}(√n), hence this approach has the potential of achieving lower bounds specialized to the integers. We proceed to give lower and upper bounds for this problem in different settings. In addition, we provide tight bounds for sums along expanders. A key element in our proofs is a reduction from the sum-product of a matching to the maximum number of translates of a set of integers into the perfect squares. This problem was originally studied by Euler, and we obtain a stronger form of Euler's result using elliptic curve analysis.",
author = "Noga Alon and Omer Angel and Itai Benjamini and Eyal Lubetzky",
year = "2012",
month = "3",
doi = "10.1007/s11856-011-0170-x",
language = "English (US)",
volume = "188",
pages = "353--384",
journal = "Israel Journal of Mathematics",
issn = "0021-2172",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Sums and products along sparse graphs

AU - Alon, Noga

AU - Angel, Omer

AU - Benjamini, Itai

AU - Lubetzky, Eyal

PY - 2012/3

Y1 - 2012/3

N2 - In their seminal paper from 1983, Erdo{double acute}s and Szemerédi showed that any n distinct integers induce either n1+e{open} distinct sums of pairs or that many distinct products, and conjectured a lower bound of n2-o(1). They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph G on n labeled vertices. They conjectured a version of the sum-product theorem for general graphs that have at least n1+e{open} edges. In this work, we consider sum-product theorems for sparse graphs, and show that this problem has important consequences already when G is a matching (i. e., n/2 disjoint edges): Any lower bound of the form n1/2+δ for its sum-product over the integers implies a lower bound of n1+δ for the original Erdo{double acute}s-Szemerédi problem. In contrast, over the reals the minimal sum-product for the matching is {circled dash}(√n), hence this approach has the potential of achieving lower bounds specialized to the integers. We proceed to give lower and upper bounds for this problem in different settings. In addition, we provide tight bounds for sums along expanders. A key element in our proofs is a reduction from the sum-product of a matching to the maximum number of translates of a set of integers into the perfect squares. This problem was originally studied by Euler, and we obtain a stronger form of Euler's result using elliptic curve analysis.

AB - In their seminal paper from 1983, Erdo{double acute}s and Szemerédi showed that any n distinct integers induce either n1+e{open} distinct sums of pairs or that many distinct products, and conjectured a lower bound of n2-o(1). They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph G on n labeled vertices. They conjectured a version of the sum-product theorem for general graphs that have at least n1+e{open} edges. In this work, we consider sum-product theorems for sparse graphs, and show that this problem has important consequences already when G is a matching (i. e., n/2 disjoint edges): Any lower bound of the form n1/2+δ for its sum-product over the integers implies a lower bound of n1+δ for the original Erdo{double acute}s-Szemerédi problem. In contrast, over the reals the minimal sum-product for the matching is {circled dash}(√n), hence this approach has the potential of achieving lower bounds specialized to the integers. We proceed to give lower and upper bounds for this problem in different settings. In addition, we provide tight bounds for sums along expanders. A key element in our proofs is a reduction from the sum-product of a matching to the maximum number of translates of a set of integers into the perfect squares. This problem was originally studied by Euler, and we obtain a stronger form of Euler's result using elliptic curve analysis.

UR - http://www.scopus.com/inward/record.url?scp=84858451111&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858451111&partnerID=8YFLogxK

U2 - 10.1007/s11856-011-0170-x

DO - 10.1007/s11856-011-0170-x

M3 - Article

VL - 188

SP - 353

EP - 384

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

SN - 0021-2172

IS - 1

ER -