-
Notifications
You must be signed in to change notification settings - Fork 144
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Rijke Finite Types and the Number of Finite Groups #644
Conversation
Emm... I had changed the definition of |
Is it used in many places in the library? If not, I think it's fine to change it. |
No, almost nowhere. |
Nice! Using |
There are too many files in |
It looks much better now! @ecavallo |
Thanks! This is all great to have in the library. |
This PR transports Egbert Rijke's main results in OEIS-A000001 to cubical agda. Especially his definition of "homotopy finite type" and they are closed under forming Σ-types (see
Cubical.Data.FinType
, the condition is named asisFinType
).Tons of facts about finite sets and related stuff are needed. So this PR depends on #630.
Now we can count the number of finite sets with structures like finite groups or finite semi-groups, at least in theory... I have defined a few in
Cubical.Experiments.CountingFiniteStructure
and everyone can add what he/she likes. But except for the trivial structure (basically no structure, so the number is always 1), the counting is hard to perform.I tried to calculate the number of finite semi-groups of cardinal 2, and after several hours, agda told me "Sorry, Heap Overflow!" Maybe I should enlarge the heap size and try again, or anyone with a better computer would take this job. It seems possible to compute the number though may cost a rather long time.
It also contains the definition of OEIS-A000001. Since the difficulty is much more serious than semi-group case, I have no comments for that.
P.S. It turns out the main obstruction is that transporting Π-types performs extremely slow. I don't know how to get around it.