Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with open-problems
Search options not deleted
user 19729
If it turns out that a problem is equivalent to a known open problem, then the open-problem tag is added. After that, the question essentially becomes, "What is known about this problem? What are some possible ways to approach this problem? What are some ways that people have tried to attack it before, and with what results?"
14
votes
A group-theoretic perspective on Frankl's union closed problem
In a somewhat different direction from Alireza: the conjecture is true for a large family of groups, including all abelian groups and many supersolvable groups.
Let me start with the abelian case. P …
- 3,407
6
votes
Generating random finite groups
Are you running computer experiments to verify conjectures? If so, the GAP SmallGroups library will give you exactly what you want up to $n = 1023$.
For example, the GAP commands
n:=16;; G:=SmallGr …
- 3,407