Minimal order attaining function: Difference between revisions

From Groupprops
 
(4 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{Semistddef}}
{{TOCright}}
==Definition==
==Definition==


Line 15: Line 17:
{{see also|[[Group number function #Open problems]]}}
{{see also|[[Group number function #Open problems]]}}


It is not known whether <math>\mathrm{moa}</math> is well-defined for all natural numbers - it is a conjecture as to whether or not the group number functions is surjective. In other words, it is possible that there is such a number for which there will never be that number of groups up to isomorphism of a fixed order.
It is not known whether <math>\mathrm{moa}</math> is well-defined for all natural numbers. Equivalently, it is a conjecture as to whether or not the group number functions is surjective. In other words, it is possible that there is such a number for which there will never be that number of groups up to isomorphism of any given order.


==Small values==
==Small values==
Line 43: Line 45:
|}
|}


This function is not well understood, and some very small values of the function are not known. For example, it is conjectured that <math>\mathrm{moa}(33)=163293</math>. This is the smallest such unknown value. As of December 2023, this has not been confirmed.
This function is not well understood, and some very small values of the function are not known. For example, it is conjectured that <math>\mathrm{moa}(33)=163293</math>. This is the smallest such unknown value. As of May 2024, this has not been confirmed.


==See also==
==See also==

Latest revision as of 17:32, 26 May 2024

This article defines a term that has been used or referenced in a journal article or standard publication, but may not be generally accepted by the mathematical community as a standard term.[SHOW MORE]

Definition

In words

The minimal order attaining function or moa function is the function moa:NN defined by moa(n) equal to the smallest number such that there are n groups of that order up to isomorphism.

In terms of the group number function

We can define the minimal order attaining function in terms of the group number function, denoted gnu, which outputs the number of groups of a given order up to isomorphism:

moa(n)=min{mN:gnu(m)=n}.

Question of well-definedness

See also: Group number function #Open problems

It is not known whether moa is well-defined for all natural numbers. Equivalently, it is a conjecture as to whether or not the group number functions is surjective. In other words, it is possible that there is such a number for which there will never be that number of groups up to isomorphism of any given order.

Small values

n moa(n) Relevant "groups of order" page
1 1 groups of order 1
2 4 groups of order 4
3 75 groups of order 75
4 28 groups of order 28
5 8 groups of order 8
6 42 groups of order 42
7 375 groups of order 375
8 510 groups of order 510
9 308 groups of order 308
10 90 groups of order 90

This function is not well understood, and some very small values of the function are not known. For example, it is conjectured that moa(33)=163293. This is the smallest such unknown value. As of May 2024, this has not been confirmed.

See also

External links

The sequence Oeis:A046057 in the Online Encyclopedia of Integer Sequences gives the values of the minimal order attaining function.