Skip to main content
6 events
when toggle format what by license comment
Mar 23, 2022 at 16:23 comment added Simon Pohmann That is a very interesting question. I do not know about any proven lower bound, but would dare the guess that the number is, in fact, $\exp(\Theta(n^2\log(n)))$ (there is some experimental and theoretical reason to believe that).
Mar 23, 2022 at 6:30 comment added Josiah Park That's an upper bound asymptotically, or is there a matching lower bound?
Oct 9, 2021 at 8:50 comment added Simon Pohmann An asymptotic bound of $\exp(O(n^2\log n))$ as well as an explicit bound on the number of perfect quadratic forms in dimension $n$ has been shown in Wessel PJ van Woerden. “Perfect Quadratic forms: an Upper Bound and Challenges in Enumeration”. Diss. Master’s thesis, Leiden University, 2018
Sep 17, 2019 at 17:53 vote accept Calamardo
Sep 17, 2019 at 15:48 history edited Josiah Park CC BY-SA 4.0
added 3 characters in body
Sep 17, 2019 at 15:39 history answered Josiah Park CC BY-SA 4.0