On the public citation graph

On the Maximum Number of Equilateral Triangles, I

https://doi.org/10.1007/pl00009486
0 signed · 32 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-0963-8openalex-snapshot
Unsolved problems in geometry: unsolved problems in intuitive mathematics
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187897openalex-snapshot
Repeated Angles inE 4
inferredcites →https://doi.org/10.1007/bf02414146openalex-snapshot
On some problems of elementary and combinatorial geometry
inferredcites →https://doi.org/10.1007/pl00009352openalex-snapshot
On Point Sets with Many Unit Distances in Few Directions
inferredcites →https://doi.org/10.1007/pl00009388openalex-snapshot
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets
inferredcites →https://doi.org/10.1016/0097-3165(71)90028-8openalex-snapshot
Some extremal problems in geometry
inferredcites →https://doi.org/10.1016/0898-1221(96)87331-7openalex-snapshot
Combinatorial geometry
inferredcites →https://doi.org/10.1016/s0012-365x(74)80007-5openalex-snapshot
Some extremal problems in geometry
inferredcites →https://doi.org/10.1080/00029890.1970.11992573openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1145/262839.262989openalex-snapshot
Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
inferredcites →https://doi.org/10.2307/2305092openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.5860/choice.29-2156openalex-snapshot
Unsolved problems in geometry
inferredcites →https://doi.org/10.5860/choice.33-5161openalex-snapshot
Combinatorial geometry

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-25592-3_2openalex-snapshot
Problems and Results on Geometric Patterns
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_7openalex-snapshot
Problems on Repeated Subconfigurations
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_36openalex-snapshot
On the Number of Maximal Regular Simplices Determined by n Points in Rd
inferred← citeshttps://doi.org/10.1007/s00454-001-0010-6openalex-snapshot
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set
inferred← citeshttps://doi.org/10.1007/s00454-002-0727-xopenalex-snapshot
The Number of Congruent Simplices in a Point Set
inferred← citeshttps://doi.org/10.1007/s00454-002-2884-3openalex-snapshot
Combinatorial Geometry Problems in Pattern Recognition
inferred← citeshttps://doi.org/10.1007/s00454-021-00324-1openalex-snapshot
Geometric Pattern Matching Reduces to k -SUM
inferred← citeshttps://doi.org/10.1007/s00454-023-00623-9openalex-snapshot
Almost Congruent Triangles
inferred← citeshttps://doi.org/10.1007/s00493-004-0033-8openalex-snapshot
Structural Results For Planar Sets With Many Similar Subsets
inferred← citeshttps://doi.org/10.1080/00029890.2003.11919977openalex-snapshot
How Many Unit Equilateral Triangles Can Be Generated byNPoints in Convex Position?
inferred← citeshttps://doi.org/10.1112/blms.70452openalex-snapshot
The number of regular simplices in higher dimensions
inferred← citeshttps://doi.org/10.1145/1247069.1247112openalex-snapshot
Similar simplices in a d-dimensional point set
inferred← citeshttps://doi.org/10.1145/378583.378587openalex-snapshot
On the number of congruent simplices in a point
inferred← citeshttps://doi.org/10.2140/involve.2011.4-1openalex-snapshot
inferred← citeshttps://doi.org/10.2140/involve.2011.4.27openalex-snapshot
On the maximum number of isosceles right triangles in a finite point set
inferred← citeshttps://doi.org/10.2307/3647826openalex-snapshot
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?
inferred← citeshttps://doi.org/10.37236/4972openalex-snapshot
On the Number of Similar Instances of a Pattern in a Finite Set
inferred← citeshttps://doi.org/10.48550/arxiv.0905.0298openalex-snapshot
Point-sets in general position with many similar copies of a pattern
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.