{"entities":{"Q801909":{"pageid":803757,"ns":120,"title":"Item:Q801909","lastrevid":64445856,"modified":"2026-04-11T19:55:07Z","type":"item","id":"Q801909","labels":{"en":{"language":"en","value":"On the number of bishop arrangements on an \\(n\\times n\\) chessboard"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3880707"}},"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":"Q801909$BAF73547-A4C1-4F2B-B011-1858792C3810","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f25b21a710d34d696826ffdd19f64f6af5ee594b","datavalue":{"value":{"text":"On the number of bishop arrangements on an \\(n\\times n\\) chessboard","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q801909$8DE57F00-5459-4210-84C3-5EE93C1D64E6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"446cafb1f6324dd0f1fed828b629af86a4a98dde","datavalue":{"value":"0553.05005","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801909$315FBCA3-104B-42A6-8455-D2B20EC3413F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a47a60cbc2aea3f9f71b3712334f7177f8e6596b","datavalue":{"value":{"entity-type":"item","numeric-id":801908,"id":"Q801908"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q801909$E0FC0B37-C428-44BF-82D1-7B26EA93F921","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"255223deab9a614645300983eff9e9b445f432d0","datavalue":{"value":{"entity-type":"item","numeric-id":207920,"id":"Q207920"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q801909$259A60C9-D617-4189-AA34-40AF75CD0057","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2ee0f220147ae8bc749a64db56839865dbc4f127","datavalue":{"value":{"time":"+1984-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":"Q801909$79B2BB27-212B-41EF-9169-3D12B1330A4D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3747f7731728376ebbc7d72be6df6502fed3c644","datavalue":{"value":"https://eudml.org/doc/141344","type":"string"},"datatype":"url"},"type":"statement","id":"Q801909$A2006B76-4093-4E9B-8833-A7F07EF85B96","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9c062024ba0933860a45d66ca89968fab0c0e019","datavalue":{"value":"Es wird eine explizite L\u00f6sung des folgenden Problems gegeben: Auf wie viele Arten kann man \\(k\\) L\u00e4ufer auf einem \\(n\\times n\\)-Schachbrett so verteilen, da\u00df sie sich gegenseitig nicht schlagen?","type":"string"},"datatype":"string"},"type":"statement","id":"Q801909$1640352E-4C8B-45C2-A568-D535E50A6363","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"e9122aa15a25ba72a67be7a8a99301d664d2b00c","datavalue":{"value":{"entity-type":"item","numeric-id":457080,"id":"Q457080"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q801909$9EECE8BE-EE8D-4D09-A64A-5D6F4A6C63E6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b6a686fef1013593a32f9e8e67eecdd50e96866a","datavalue":{"value":"05A15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801909$94959A5A-5AA0-4112-A2C4-AD5E788BCF6D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fe20c11270a022ced6b6a582d87c0ca73a689567","datavalue":{"value":"05A19","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801909$5E5C3D48-E058-4C24-9E7C-D3769313350D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d5cdf99df1042ffc89a59fddaa9039b0ec36396c","datavalue":{"value":"3880707","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801909$DB3C2EA3-9721-4622-B463-80AF57CA8717","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e1bad7c02eff87f1e7580f4a03ef1c935523c1f1","datavalue":{"value":"rook polynomials","type":"string"},"datatype":"string"},"type":"statement","id":"Q801909$5E40568E-877A-4BC3-BBDE-A21BEAAD1197","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ba1c9c1c90ef78d797954f5f56a6c13f281387c5","datavalue":{"value":"number of bishop arrangements","type":"string"},"datatype":"string"},"type":"statement","id":"Q801909$874D9885-A8EC-42E4-BA3B-3D15A55B796F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ec07e6cacc38f0e525eeb1678b46d1e0637c2cd1","datavalue":{"value":"\\(n\\times n\\) chessboard","type":"string"},"datatype":"string"},"type":"statement","id":"Q801909$81DC5AEE-3432-4BC4-947F-3E8CABF3863C","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":"Q801909$3DFDFBBA-D83B-4B00-B6D4-1DC4209BA61A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the number of bishop arrangements on an \\(n\\times n\\) chessboard","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_number_of_bishop_arrangements_on_an_%5C(n%5Ctimes_n%5C)_chessboard"}}}}}