On Sets of Distances of n Points
From MaRDI portal
Publication:5836902
DOI10.2307/2305092zbMath0060.34805OpenAlexW4211205179WikidataQ57382213 ScholiaQ57382213MaRDI QIDQ5836902
Publication date: 1946
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2305092
Related Items
On some metric and combinatorial geometric problems, Distinct distances with \(\ell_p\) metrics, Some geometric applications of Dilworth's theorem, Erdős type problems in modules over cyclic rings, On the geometric structures with \(n\) points and \(k\) distances, Geometric achromatic and pseudoachromatic indices, Combinatorial reconstruction problems, Bisector energy and few distinct distances, Subtended angles, Multiplicities of interpoint distances in finite planar sets, Intervertex distances in convex polygons, Areas of triangles and Beck's theorem in planes over finite fields, On the maximum number of translates in a point set, On the diameter of separated point sets with many nearly equal distances, Upper bounds for \(s\)-distance sets and equiangular lines, Convex polygons with few intervertex distances, A crossing lemma for Jordan curves, Turán type results for distance graphs, On the distance and multidistance graph embeddability problem, On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture, Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs, Extremal theory for convex matchings in convex geometric graphs, Furthest neighbours in space, Erdös distance problems in normed spaces, The exact fitting problem in higher dimensions, Distinct distances in finite planar sets, Applications of the crossing number, On Falconer's distance set conjecture, Maximum planar sets that determine \(k\) distances, New bounds for the distance Ramsey number, On the Minkowski distances and products of sum sets, On complexity of multidistance graph recognition in \(\mathbb{R}^1\), Ball polytopes and the Vázsonyi problem, The number of unit distances is almost linear for most norms, Sets with many pairs of orthogonal vectors over finite fields, Remarks on Schur's conjecture, The small hexagon and heptagon with maximum sum of distances between vertices, Large simplices determined by finite point sets, Tangencies between families of disjoint regions in the plane, Distinct distances between points and lines, Incidences between points and lines on two- and three-dimensional varieties, On the graph of large distances, On distinct sums and distinct distances., On the Erdős-Falconer distance problem for two sets of different size in vector spaces over finite fields, Combinatorial complexity bounds for arrangements of curves and spheres, The generalized Erdős-Falconer distance problems in vector spaces over finite fields, Covering lattice points by subspaces and counting point-hyperplane incidences, The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets, A lower bound on the number of unit distances between the vertices of a convex polygon, Distinct distances and arithmetic progressions, Lattices with few distances, On unit distances in a convex polygon, Working session: Additive combinatorics, entropy, and fractal geometry. Abstracts from the working session held October 8--13, 2017, Drawing outerplanar graphs using three edge lengths, On the Erdős distinct distances problem in the plane, Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces, Repeated angles in the plane and related problems, The number of different distances determined by a set of points in the Euclidean plane, A new proof of Vázsonyi's conjecture, The inverse problem in electrocardiography on a spherical model, On locally Gabriel geometric graphs, Cayley digraphs associated to arithmetic groups, The maximum number of second smallest distances in finite planar sets, On convex geometric graphs with no \(k+1\) pairwise disjoint edges, Minimum planar sets with maximum equidistance counts, On the number of similar instances of a pattern in a finite set, Near optimal bounds for the Erdős distinct distances problem in high dimensions, The achromatic number of Kneser graphs, Planar unit-distance graphs having planar unit-distance complement, The grid revisited, A note on the number of different inner products generated by a finite set of vectors, A bipartite strengthening of the crossing Lemma, The largest small hexagon, Antipodality properties of finite sets in Euclidean space, The Borsuk partition problem: the seventieth anniversary, Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, Incidences with curves in \(\mathbb{R}^d\), On distinct distances and \(\lambda \)-free point sets, Approximate input sensitive algorithms for point pattern matching, Computational geometric aspects of rhythm, melody, and voice-leading, Unit distances and diameters in Euclidean spaces, A note on distinct distances in rectangular lattices, Diameter graphs in \({\mathbb R}^4\), Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges, Double-normal pairs in the plane and on the sphere, The maximum number of unit distances in a convex \(n\)-gon, New lower bounds for Hopcroft's problem, Variations on the theme of repeated distances, Distinct distances in planar point sets with forbidden 4-point patterns, Extremal problems on triangle areas in two and three dimensions, Cardinalities of \(k\)-distance sets in Minkowski spaces, On distinct distances among points in general position and other related problems, The multiplicity of the two smallest distances among points, The symmetric all-furthest-neighbor problem, The number of different distances determined by n points in the plane, Popular distances in 3-space, On computing the diameter of a point set in high dimensional Euclidean space., Unit distances, Finding squares and rectangles in sets of points, A postscript on distances in convex \(n\)-gons, Approximation of quadrilaterals by rational quadrilaterals in the plane, Configured polytopes and extremal configurations, A semi-algebraic version of Zarankiewicz's problem, Finite point configurations and the regular value theorem in a fractal setting, On computational complexity of length embeddability of graphs, Bounds on Point Configurations Determined by Distances and Dot Products, RATIONAL DISTANCES WITH RATIONAL ANGLES, Distance Ramsey numbers, Incidences with Curves in ℝ d, Turán-type results for distance graphs in an infinitesimal plane layer, An example related to the Erdos-Falconer question over arbitrary finite fields, On prescribing total orders and preorders to pairwise distances of points in Euclidean space, Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space, Unit Distances in Three Dimensions, Distance sets of well-distributed planar sets for polygonal norms, The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields, 2-systems of arcs on spheres with prescribed endpoints, Distinct distances on hyperbolic surfaces, The odd-distance plane graph, A question from a famous paper of Erdős, Nearly Equal Distances in the Plane, On distinct distances between a variety and a point set, Distinct Distances Between a Circle and a Generic Set, Three conjectures in extremal spectral graph theory, Note on the number of hinges defined by a point set in \(\mathbb{R}^2\), Distance Sets on Circles, The \(k\)-resultant modulus set problem on algebraic varieties over finite fields, Self-Dual Maps I: Antipodality, HARDNESS RESULTS FOR COMPUTING OPTIMAL LOCALLY GABRIEL GRAPHS, On bipartite distinct distances in the plane, Distinct distances between a collinear set and an arbitrary set of points, Turán-type bounds for distance graphs, Unnamed Item, Falconer-type estimates for dot products, Unnamed Item, The generalized \(k\)-resultant modulus set problem in finite fields, Drawing outerplanar graphs using thirteen edge lengths, A refined energy bound for distinct perpendicular bisectors, A construction for difference sets with local properties, Pinned algebraic distances determined by Cartesian products in 𝔽_{𝕡}², Finite point configurations in the plane, rigidity and Erdős problems, Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances, Distinct angles in general position, Additive groups with many unimodular elements, Angle chains and pinned variants, On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space, Odd wheels are not odd-distance graphs, Distinct distances on non-ruled surfaces and between circles, Improved Bounds for Incidences Between Points and Circles, On the number of dot product chains in finite fields and rings, Bisectors and pinned distances, A note on distinct distance subsets, Unnamed Item, A combinatorial problem on polynomials and rational functions, On the Approximate Unit Distance Problem, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Distribution of distances in positive characteristic, Extremal problems for convex polygons, Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture, On incidences of lines in regular complexes, Schwartz-Zippel bounds for two-dimensional products, On the number of discrete chains, Distinct distances on curves via rigidity, Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory, Trapezoids and deltoids in wide planar point sets, A reduction for the distinct distances problem in \(\mathbb{R}^d\), Triangle areas in line arrangements, One problem on geometric Ramsey numbers, On sets containing an affine copy of bounded decreasing sequences, New bounds on the dimensions of planar distance sets, Nearly equal distances and Szemerédi's regularity lemma, Distance sets of two subsets of vector spaces over finite fields, Erdös distance problem in vector spaces over finite fields, Incidences in Three Dimensions and Distinct Distances in the Plane, Unit distance graphs and algebraic integers, Distribution of the determinants of sums of matrices, On Falconer's distance set problem in the plane, Avoiding Multiple Repetitions in Euclidean Spaces, Degenerate drawing of outerplanar graphs with two edge lengths, Around Borsuk's hypothesis, A point set puzzle revisited, FREIMAN THEOREM, FOURIER TRANSFORM AND ADDITIVE STRUCTURE OF MEASURES, Characterizing optimal point sets determining one distinct triangle, Lattice Configurations Determining Few Distances, Crescent configurations in normed spaces, Twenty years of progress of \(\mathrm{JCDCG}^3\), Difference sets are not multiplicatively closed, On incidence bounds with Möbius hyperbolae in positive characteristic, A note on distinct distances, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Distinct Volume Subsets, Great-circle tree thrackles, Distinct distances in the complex plane, Distinct distance estimates and low degree polynomial partitioning, Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm, Achromatic numbers of Kneser graphs, Sets with few distinct distances do not have heavy lines, Odd Wheels Are Not Odd-distance Graphs, Arcs intersecting at most once, Reviews, On Erd\H{o}s Chains in the Plane, Nearly \(k\)-distance sets, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Classification of maps sending lines into translates of a curve, A note on the distinct distances problem in the hyperbolic plane, On the pinned distances problem in positive characteristic, Distinct angle problems and variants, Arrangements of pseudocircles: on digons and triangles, Additive structure in convex translates, On the number of tangencies among 1-intersecting \(x\)-monotone curves, On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves, Distinct Distances on Algebraic Curves in the Plane, Unnamed Item, Unnamed Item, Disjoint edges in geometric graphs, Paul Erdős, 1913-1996, Disjoint edges in geometric graphs, Reconstructing finite sets of points in \(R^n\) up to groups of isometries, Thrackles containing a standard musquash, Some extremal problems in geometry, A Bipartite Strengthening of the Crossing Lemma, Optimal point sets determining few distinct triangles, Some extremal problems in geometry, From harmonic analysis to arithmetic combinatorics
