On the public citation graph
Point sets with distinct distances
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4899-3585-4openalex-snapshot
Unsolved Problems in Number Theory
inferredcites →https://doi.org/10.1007/bf01191203openalex-snapshot
Bounds for arrays of dots with distinct slopes or lengths
inferredcites →https://doi.org/10.1007/bf01742852openalex-snapshot
Handbuch der Lehre von der Verteilung der Primzahlen
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02414146openalex-snapshot
On some problems of elementary and combinatorial geometry
inferredcites →https://doi.org/10.1016/0097-3165(82)90049-8openalex-snapshot
Extremal uncrowded hypergraphs
inferredcites →https://doi.org/10.1016/0097-3165(90)90074-7openalex-snapshot
The maximum number of unit distances in a convex n-gon
inferredcites →https://doi.org/10.1016/0097-3165(92)90094-bopenalex-snapshot
Repeated angles in the plane and related problems
inferredcites →https://doi.org/10.1016/0166-218x(94)00046-gopenalex-snapshot
Multiplicities of interpoint distances in finite planar sets
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/0925-7721(91)90009-4openalex-snapshot
Distinct distances determined by subsets of a point set in space
inferredcites →https://doi.org/10.1016/s0195-6698(85)80027-5openalex-snapshot
An Application of Graph Theory to Additive Number Theory
inferredcites →https://doi.org/10.1017/cbo9780511542893openalex-snapshot
Analytic Methods for Diophantine Equations and Diophantine Inequalities
inferredcites →https://doi.org/10.1017/cbo9780511666216openalex-snapshot
Surveys in Combinatorics, 1991
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1109/tit.1982.1056526openalex-snapshot
Two-dimensional synchronization patterns for minimum ambiguity
inferredcites →https://doi.org/10.1112/plms/s2-21.1.235openalex-snapshot
Proofs of Some Formulae Enunciated by Ramanujan
inferredcites →https://doi.org/10.5169/seals-27359openalex-snapshot
Distinct distances between lattice points
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-01877-0_6openalex-snapshot
Problems on Two-Dimensional Synchronization Patterns
inferred← citeshttps://doi.org/10.1007/s00022-013-0176-0openalex-snapshot
A note on distinct distance subsets
inferred← citeshttps://doi.org/10.1007/s00454-022-00466-wopenalex-snapshot
Distinct Angle Problems and Variants
inferred← citeshttps://doi.org/10.1007/s10474-025-01562-yopenalex-snapshot
On multiplicities of interpoint distances
inferred← citeshttps://doi.org/10.1007/s10998-008-8165-4openalex-snapshot
On distinct distances among points in general position and other related problems
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00015-9openalex-snapshot
Two-dimensional arrays
inferred← citeshttps://doi.org/10.1016/j.ejc.2026.104443openalex-snapshot
On the largest Sidon subset in a finite subset of RN
inferred← citeshttps://doi.org/10.1090/crmp/043/12openalex-snapshot
Lattice points on circles, squares in arithmetic progressions and sumsets of squares
inferred← citeshttps://doi.org/10.1109/itw.2009.5351265openalex-snapshot
Folding, tiling, and multidimensional coding
inferred← citeshttps://doi.org/10.1109/tit.2009.2039046openalex-snapshot
Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
inferred← citeshttps://doi.org/10.1109/tit.2011.2146010openalex-snapshot
Sequence Folding, Lattice Tiling, and Multidimensional Coding
inferred← citeshttps://doi.org/10.1137/s0097539797323716openalex-snapshot
The Algorithmic Aspects of Uncrowded Hypergraphs
inferred← citeshttps://doi.org/10.1515/forum-2015-0024openalex-snapshot
Incidences between points and generalized spheres over finite fields and related problems
inferred← citeshttps://doi.org/10.2298/aadm121212026vopenalex-snapshot
On the sum of the squared multiplicities of the distances in a point set over finite spaces
inferred← citeshttps://doi.org/10.48550/arxiv.1102.5727openalex-snapshot
Open problems in Costas arrays
inferred← citeshttps://doi.org/10.48550/arxiv.1406.1949openalex-snapshot
Distinct Distances: Open Problems and Current Bounds
inferred← citeshttps://doi.org/10.5555/314161.314311openalex-snapshot
The algorithmic aspects of uncrowded hypergraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.