{"entities":{"Q1104554":{"pageid":1115303,"ns":120,"title":"Item:Q1104554","lastrevid":66994965,"modified":"2026-04-12T14:12:59Z","type":"item","id":"Q1104554","labels":{"en":{"language":"en","value":"Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4056441"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1104554$AD9506ED-C02F-4E8E-8D0D-45015EF16805","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ad2419f1d91365fa26197acadd389fd1c3e4b41a","datavalue":{"value":{"text":"Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1104554$4A8C0830-69D1-4CF5-A354-C9AB73AE3EF6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a7efab6fbebba273f98733b684928db92e007e40","datavalue":{"value":"0647.52002","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1104554$7646CA86-0514-4D45-B705-BF8887862410","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c7f8b60c5c48a8f6445e8dbf92c67e4dfdc1e067","datavalue":{"value":{"entity-type":"item","numeric-id":1104553,"id":"Q1104553"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1104554$F7CAC133-4B5B-41D0-9C52-32FD88102DAB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e41d9bee1966da9cce221d03fd74e1bcb086cc18","datavalue":{"value":{"entity-type":"item","numeric-id":1104551,"id":"Q1104551"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1104554$BE2E4CA5-D57D-4F8A-8586-F0D5EDCEA11D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"fcf622d4faaaf9eb501926768589cf6bc6e37689","datavalue":{"value":{"entity-type":"item","numeric-id":213743,"id":"Q213743"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1104554$3E2BAB3E-B938-4974-90C9-A1FC9DDED92E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1104554$1603FCFA-052C-4696-909F-1C54EDC22A72","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2836650cf1f0670560aff73dff8af48a3798919b","datavalue":{"value":"https://eudml.org/doc/138383","type":"string"},"datatype":"url"},"type":"statement","id":"Q1104554$C9F979D4-1F29-4C96-A53B-103D6C475F91","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"043f78e6eb806cd03fc1be035424c2098c198ed8","datavalue":{"value":"Die beiden folgenden Probleme sind zueinander \u00e4quivalent: Bestimmung der dichtesten Packung von n kongruenten Kreisen in einem abgeschlossenen Quadrat und Bestimmung jener Verteilung von n Punkten in einem abgeschlossenen Quadrat, bei der der Mindestabstand zweier Punkte maximal ist. Diese Probleme wurden bisher f\u00fcr die F\u00e4lle \\(n=2,3,...,9,14,16,25\\) gel\u00f6st. Der Fall \\(n=36\\) wird hier erledigt durch den folgenden Satz: Wenn \\(d(P_ 1,P_ j)\\) den Abstand der Punkte \\(P_ 1\\), \\(P_ j\\) bezeichnet, dann gilt f\u00fcr beliebige 36 Punkte \\(P_ i\\), die in einem abgeschlossenen Einheitsquadrat Q liegen,  \\[  \\min_{1\\leq i<j\\leq 36}d(P_ i,P_ j)\\leq 1/5,  \\]  mit Gleichheit genau dann, wenn die 36 Punkte in den Eckpunkten der 25 Quadrate der Seitenl\u00e4nge 1/5 liegen, die Q genau ausf\u00fcllen.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1104554$1945AC7E-E1B8-441D-87EC-0F209404B03E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4e1df7ba929664ba7b91d5a816f05411516abc3","datavalue":{"value":"52C17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1104554$DA36EDD6-1922-4BE3-BCB6-05E48CD31728","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7ff537d9f5ff73371788c7e1580c0955b0d09248","datavalue":{"value":"4056441","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1104554$2C0F1523-CB3A-4658-9266-2194AFB6DAE3","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4099e262c5bb409f4f47500a9c483d35c673fd54","datavalue":{"value":"densest packing of circles","type":"string"},"datatype":"string"},"type":"statement","id":"Q1104554$DAF53B0E-5CFF-4392-9FEC-C63BAF691AD1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d975767c563e94477c3d9334e88b36b66e780de","datavalue":{"value":"distribution of points in a square","type":"string"},"datatype":"string"},"type":"statement","id":"Q1104554$1DCB0BCF-A468-40B6-B9FA-FEA09AE788CF","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1104554$6B91C49C-89C5-46BD-8121-683FD91A6D71","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Die_dichteste_Packung_von_36_Kreisen_in_einem_Quadrat._(On_the_denest_packing_of_36_circles_in_a_square)"}}}}}