Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Large subsets of discrete hypersurfaces in Z^d contain arbitrarily many collinear points
 
research article

Large subsets of discrete hypersurfaces in Z^d contain arbitrarily many collinear points

Moreira, Joel
•
Richter, Florian Karl  
May 1, 2016
European Journal of Combinatorics

In 1977 L.T. Ramsey showed that any sequence in Z 2 with bounded gaps contains arbitrarily many collinear points. Thereafter, in 1980, C. Pomerance provided a density version of this result, relaxing the condition on the sequence from having bounded gaps to having gaps bounded on average.We give a higher dimensional generalization of these results. Our main theorem is the following. Theorem. Let d N , let f : Z d Z d + 1 be a Lipschitz map and let A Z d have positive upper Banach density. Then f ( A ) contains arbitrarily many collinear points.Note that Pomerance's theorem corresponds to the special case d = 1 . In our proof, we transfer the problem from a discrete to a continuous setting, allowing us to take advantage of analytic and measure theoretic tools such as Rademacher's theorem.

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.ejc.2015.12.012
ArXiv ID

1501.07550

Author(s)
Moreira, Joel
•
Richter, Florian Karl  
Date Issued

2016-05-01

Published in
European Journal of Combinatorics
Volume

54

Issue

C

Start page

163

End page

176

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
ERG  
Available on Infoscience
November 26, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/183256
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés