An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)

Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and conjectures are available for n < 28. Minimum solutions for the side length of the triangle: A closely related problem is to cover the equilateral triangle with a fixed number of equal circles, having as small a radius as possible.

AttributesValues
rdfs:label
• Circle packing in an equilateral triangle
rdfs:comment
• Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and conjectures are available for n < 28. Minimum solutions for the side length of the triangle: A closely related problem is to cover the equilateral triangle with a fixed number of equal circles, having as small a radius as possible.
foaf:depiction
foaf:isPrimaryTopicOf
thumbnail
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
• Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and conjectures are available for n < 28. A conjecture of Paul Erdős and Norman Oler states that, if n is a triangular number, then the optimal packings of n − 1 and of n circles have the same side length: that is, according to the conjecture, an optimal packing for n − 1 circles can be found by removing any single circle from the optimal hexagonal packing of n circles. This conjecture is now known to be true for n ≤ 15. Minimum solutions for the side length of the triangle: A closely related problem is to cover the equilateral triangle with a fixed number of equal circles, having as small a radius as possible.
prov:wasDerivedFrom
page length (characters) of wiki page
is foaf:primaryTopic of
is Link from a Wikipage to another Wikipage of
Faceted Search & Find service v1.17_git51 as of Sep 16 2020

Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About

OpenLink Virtuoso version 08.03.3319 as of Dec 29 2020, on Linux (x86_64-centos_6-linux-glibc2.12), Single-Server Edition (61 GB total memory)