Forgot to mention
https://www.ams.org/journals/proc/1970-025-02/S0002-9939-1970-0253944-9/home.html
"""
The logarithm (base 2) of the number of distinct topologies on a set of
elements is shown to be asymptotic to (n^2)/4 as n goes to infinity.
"""
and especially: https://oeis.org/A000798
https://en.wikipedia.org/wiki/On-Line_Encyclopedia_of_Integer_Sequences
On 29/04/2025 18:25, Martin Baker wrote:
Any ideas how I could check this out further?
Martin
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to fricas-devel+unsubscr...@googlegroups.com.
To view this discussion visit
https://groups.google.com/d/msgid/fricas-devel/69462e50-f31e-4af8-b293-55897e4548b0%40gmail.com.
