In affine geometry, a cap set is a subset of (an -dimensional affine space over a three-element field) with no three elements in a line.The cap set problem is the problem of finding the size of the largest possible cap set, as a function of . The first few cap set sizes are 1, 2, 4, 9, 20, 45, 112, ... (sequence in the OEIS).
| Property |
Value |
| dbo:abstract |
In affine geometry, a cap set is a subset of (an -dimensional affine space over a three-element field) with no three elements in a line.The cap set problem is the problem of finding the size of the largest possible cap set, as a function of . The first few cap set sizes are 1, 2, 4, 9, 20, 45, 112, ... (sequence in the OEIS). Cap sets may be defined more generally as subsets of finite affine or projective spaces with no three in line, where these objects are simply called caps. The "cap set" terminology should be distinguished from other unrelated mathematical objects with the same name, and in particular from sets with the compact absorption property in function spaces as well as from compact convex co-convex subsets of a convex set. (en) |
| dbo:thumbnail |
wiki-commons:Special:FilePath/Cap_set.svg?width=300 |
| dbo:wikiPageID |
51223601 (xsd:integer) |
| dbo:wikiPageLength |
15412 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1111695109 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Projective_space dbr:Péter_Frankl dbr:Ronald_Graham dbr:Jordan_Ellenberg dbr:Matrix_multiplication dbr:Endre_Szemerédi dbr:Arithmetic_combinatorics dbr:Function_space dbr:Sunflower_(mathematics) dbr:Timothy_Gowers dbr:Games_graph dbr:Locally_linear_graph dbr:Affine_space dbr:Ernest_S._Croot_III dbr:Fields_Medal dbr:No-three-in-line_problem dbr:Noga_Alon dbr:Ramsey_theory dbr:Terence_Tao dbc:Ramsey_theory dbr:Affine_geometry dbr:Lean_(proof_assistant) dbr:Imre_Z._Ruzsa dbr:Set_(card_game) dbr:Strongly_regular_graph dbr:Vojtěch_Rödl dbr:Nets_Katz dbr:Tom_Brown_(mathematician) dbr:Triangle_removal_lemma dbr:Dion_Gijswijt dbr:File:Cap_set.svg |
| dbp:wikiPageUsesTemplate |
dbt:Set_isomorphic_cards.svg dbt:Harvtxt dbt:Main dbt:OEIS dbt:Reflist dbt:Short_description |
| dcterms:subject |
dbc:Ramsey_theory |
| rdfs:comment |
In affine geometry, a cap set is a subset of (an -dimensional affine space over a three-element field) with no three elements in a line.The cap set problem is the problem of finding the size of the largest possible cap set, as a function of . The first few cap set sizes are 1, 2, 4, 9, 20, 45, 112, ... (sequence in the OEIS). (en) |
| rdfs:label |
Cap set (en) |
| owl:sameAs |
wikidata:Cap set https://global.dbpedia.org/id/2eFWy |
| prov:wasDerivedFrom |
wikipedia-en:Cap_set?oldid=1111695109&ns=0 |
| foaf:depiction |
wiki-commons:Special:FilePath/Cap_set.svg |
| foaf:isPrimaryTopicOf |
wikipedia-en:Cap_set |
| is dbo:wikiPageDisambiguates of |
dbr:Cap_(disambiguation) |
| is dbo:wikiPageRedirects of |
dbr:Cap_set_problem dbr:Exponential_bound_on_capsets |
| is dbo:wikiPageWikiLink of |
dbr:Cap_set_problem dbr:Cap_(disambiguation) dbr:Sunflower_(mathematics) dbr:Games_graph dbr:Ernest_S._Croot_III dbr:No-three-in-line_problem dbr:Exponential_bound_on_capsets dbr:Set_(card_game) dbr:Nets_Katz dbr:Extremal_Problems_For_Finite_Sets dbr:Roth's_theorem_on_arithmetic_progressions dbr:Ruzsa–Szemerédi_problem dbr:Polynomial_method_in_combinatorics dbr:Szemerédi's_theorem |
| is foaf:primaryTopic of |
wikipedia-en:Cap_set |
