{"entities":{"Q6913068":{"pageid":20980552,"ns":120,"title":"Item:Q6913068","lastrevid":84155972,"modified":"2026-05-12T13:23:36Z","type":"item","id":"Q6913068","labels":{"en":{"language":"en","value":"Greedy capsets"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8108977"}},"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":"Q6913068$4D3DECA4-AB2E-4240-9417-B2352DB07721","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"757c678b55095ce15bce139699338ff3753e8bcf","datavalue":{"value":{"text":"Greedy capsets","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6913068$A410253A-B744-4E87-AEE2-9AD17F299D4F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9474d02f77c8c17489c9beb6135a8424c202174d","datavalue":{"value":{"entity-type":"item","numeric-id":6913066,"id":"Q6913066"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$AE301064-34FC-48E8-AAF9-EDD07DD6FC80","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f95d723dc267c275dddffa85895a68711a3ab39b","datavalue":{"value":{"entity-type":"item","numeric-id":6913067,"id":"Q6913067"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$3F77B0E5-1B0A-4312-B0C2-93E4D61066BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"85a1e7d37fc81c4c60a73dcfc937327377ebbf65","datavalue":{"value":{"entity-type":"item","numeric-id":167141,"id":"Q167141"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$A89D1513-75C6-4468-B766-DD4211B6BECD","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"4475e942e511a8e1762a91638eb522e6040025ba","datavalue":{"value":{"entity-type":"item","numeric-id":6562416,"id":"Q6562416"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$FC4767FE-358A-4A7D-81BE-40936554B8F7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8e99de2160b16674efb8c42c504ced9726f75262","datavalue":{"value":{"time":"+2025-10-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6913068$F88C977B-3D78-4132-841A-AD0E57229380","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8c54a6014c50756ea24edefc01a795fb1f284f4c","datavalue":{"value":"https://ajc.maths.uq.edu.au/pdf/92/ajc_v92_p463.pdf","type":"string"},"datatype":"url"},"type":"statement","id":"Q6913068$AB3F53A6-6DD8-493B-9020-C9A561797D4A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f518a361845c98c8e703f8f535e60608b135fd56","datavalue":{"value":"A \\textit{capset} in an affine space AG\\((n,3)\\) of dimension \\(n\\) over the field \\(\\mathbb{F}_3\\) with three elements is a set of points not containing any line. In different words: it is a set intersecting any line in at most two points. People are interested in the largest possible size of a capset, and this size is denoted by \\(a(n)\\) in the paper under review. For \\(n=8\\), \\textit{M. Balog} et al. [Nature 625, 468--475 (2024; \\url{doi:10.1038/s41586-023-06924-6})] used machine learning to establish \\(a(8)\\geq 512\\). The capsets they produced with the help of a computer all started with the empty set, and then gradually adding points according to certain rules (in particular never add a point on a line that already has two points in the set).\\N\\NThe authors of the paper under review had the original idea to try to go the opposite way: start with the whole affine space and delete points according to rules. The rule they had in mind is: delete a point which is on a maximum number of lines contained in the set. If no point can be deleted, the resulting set is a capset, called a \\textit{greedy capset}. They did not find very large capsets (all of magnitude \\(2^n\\)), and in the paper they explain why. It turns out that each capsets they constructed is the complement of \\(n-1\\) (independent) hyperplanes, and they prove this in the paper.\\N\\NIn Lemma~2.1 of the paper, and in their Remark~3.6, the authors seem to make a big deal of the fact that a set of generating points of an affine space, closed under joining lines, is the whole space (in the finite case, when the characteristic of the underlying field is odd). In fact, this is true as soon as the underlying field has at least three elements. Indeed, it is well known that in this case any subspace of an affine space is an affine subspace and the result follows straight from that. I teach this to my first year bachelors in mathematics.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6913068$C1DEFCCC-8B3D-4948-A8D0-8180FD830BB0","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"8b4c5ee57a216902558d065dab4fe55aaca65876","datavalue":{"value":{"entity-type":"item","numeric-id":162976,"id":"Q162976"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$78D227DB-A87D-42C1-B94A-7768F60854F5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"97436ffec0c1cb82ffc805c68f1388491dec22eb","datavalue":{"value":"51E20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6913068$98A53728-B997-44CA-9DCB-35D31F683D9A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8f762b832897e47aeb679285d08d6b080292d6a2","datavalue":{"value":"8108977","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6913068$5B3B7F32-159F-4ADF-A2CA-65AE003A88D0","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$B5D7B716-814A-42DD-A5A6-01EDFF163527","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e7d8e266f546e19f9c551e341523094ab3df628c","datavalue":{"value":"caps, affine space.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6913068$ED864E68-A8EF-4726-BB1B-6065D40D07B2","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":"Q6913068$4052013D-BA55-4E7B-A186-134B12430F7D","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"95a88a6546bf0f31e7941ee0ddce531fa4d357a8","datavalue":{"value":{"entity-type":"item","numeric-id":4645008,"id":"Q4645008"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$2908174A-DD56-42E7-A6BD-18D5C920791F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"46a844a2dfa58457028475ab8213c7e00c151dfb","datavalue":{"value":{"entity-type":"item","numeric-id":509700,"id":"Q509700"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$F191B807-E54E-441B-9A48-73695C1226DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c623320ffdba667dd896a52fcb32a98f99d63760","datavalue":{"value":{"entity-type":"item","numeric-id":6962331,"id":"Q6962331"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6913068$A56C7527-7631-4B8B-A13C-F0E76C8FEE0B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Greedy capsets","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Greedy_capsets"}}}}}