Skip to main content
16 events
when toggle format what by license comment
Jan 2 at 5:35 vote accept 15948238
Dec 11, 2023 at 17:30 answer added Oscar Lanzi timeline score: 5
Dec 11, 2023 at 14:45 history edited Sam Hopkins CC BY-SA 4.0
added 147 characters in body; edited title
Dec 11, 2023 at 7:38 history edited GH from MO
edited tags
Dec 11, 2023 at 7:36 answer added GH from MO timeline score: 3
Dec 11, 2023 at 5:47 history edited RobPratt CC BY-SA 4.0
edited title
Dec 11, 2023 at 5:43 history edited Daniele Tampieri CC BY-SA 4.0
Fully Math Jaxed
Dec 11, 2023 at 1:05 comment added Sam Hopkins It is not uncommon for exact values of these kind of problems of counting combinatorial objects satisfying certain constraints to be known only for small parameter values. The issue is just that brute force searching becomes computationally infeasible beyond a certain level, and there are not techniques much better than brute force. This is related to the whole idea of polynomial time vs. NP computational problems, and also "combinatorial explosion." Maybe more can be said for this particular problem of cap sets, but I doubt there is anything to unique to it.
Dec 10, 2023 at 20:56 history edited 15948238 CC BY-SA 4.0
edited title
Dec 10, 2023 at 20:56 comment added 15948238 Bounds as opposed to exact values is what I meant.
Dec 10, 2023 at 19:58 comment added Seva I am still puzzled. Why do you believe that "we can only find bounds for sizes of cap sets for $d>6$"?
Dec 10, 2023 at 19:48 comment added 15948238 Yes, sorry about that. Just edited for clarification.
Dec 10, 2023 at 19:47 history edited 15948238 CC BY-SA 4.0
added 21 characters in body
Dec 10, 2023 at 19:11 comment added Seva Capsets... where? In $\mathbb F_p^d$? Is $d$ the dimension? Maybe, just because for $d\le 5$ the exact values are known?
S Dec 10, 2023 at 17:32 review First questions
Dec 11, 2023 at 5:43
S Dec 10, 2023 at 17:32 history asked 15948238 CC BY-SA 4.0