On the Dimension of Finite Point Sets II. "Das Budapester Programm"

2011/09/03 by György Elekes, Elekes, György
Computer Science · Mathematics · #52C10 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO #msc:52C10

paper · pdf · doi:10.48550/arxiv.1109.0636

Unpublished manuscript of the late Gyuri Elekes. The file was edited on 2007.04.11. last time

arxiv created 2011/09/03 · openalex publication_date 2011/09/03 · arxiv updated 2011/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We are going to use the nickname "Das Budapester Programm" for a large class of finite combinatorial problems to be posed below. Following Klein's original idea, they concern various dimensional Euclidean spaces and several groups of transformations.

Related

• On the Dimension of Finite Point Sets I. An Improved Incidence Bound for Proper 3D sets
• Dimension of a snowflake of a finite Euclidean subspace
• Bounding the Dimension of Points on a Line
• Theory of dimension for large discrete sets and applications
• An example of a doubling "inherently" infinite-dimensional subset of l₂