Constructing 7-clusters

MaRDI QIDQ3187633zbMATH OpenFDO

Authors Sascha Kurz, Landon Curt Noll, Randall L. Rathbun, Chuck Simmons

Publication date 2 September 2016

Full work available at URL https://arxiv.org/abs/1312.2318

zbMATH Keywords

Erdős problemsexhaustive enumerationHeron trianglesintegral point sets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice points in specified regions (11P21)

Abstract: A set of $n$-lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and all coordinates are integral is called an $n$-cluster (in $mathbb{R}^2$). We determine the smallest existent $7$-cluster with respect to its diameter. Additionally we provide a toolbox of algorithms which allowed us to computationally locate over 1000 different $7$-clusters, some of them having huge integer edge lengths. On the way, we exhaustively determined all Heronian triangles with largest edge length up to $6cdot10^6$.

Recommendations

• n-clusters for 1 < n < 7
• Percolation cluster numbers in seven dimensions
• scientific article; zbMATH DE number 6861937
• On the number of clusters
• Cluster algebras and the subalgebra constructibility of the seven-particle remainder function
• Heptagons from the Steinmann cluster bootstrap
• scientific article; zbMATH DE number 6683488
• Constructing Clustering Transformations
• On the Theory of Clusters
• Constructing combinatorial objects via cliques

Cited in

(5)

• Lattice embeddings of planar point sets
• n-clusters for 1 < n < 7
• On the characteristic and diameter of planar integral point sets
• What propositions need not be
• Particular examples of planar integral point sets and their classification

This page was built for publication: Constructing $7$-clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187633)