# The number of $p$-groups of order $\leq p^n$ that split over a normal abelian subgroup

How can one estimate the number of $p$-groups of order $\leq p^n$ that split over a normal abelian subgroup?

Moreover, let $s(n,p)$ be the number of such groups, and let $f(n,p)$ denotes the number of $p$-groups of order $\leq p^n$.

What can one expect for $\frac{s(n,p)}{f(n,p)}$?

Is it true that $lim_n\frac{s(n,p)}{f(n,p)}$ is 0, for every prime $p$?

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9822677969932556, "perplexity": 120.67914082270191}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-41/segments/1412037663060.18/warc/CC-MAIN-20140930004103-00488-ip-10-234-18-248.ec2.internal.warc.gz"}