On Landau's function g(n)
From MaRDI portal
Abstract: Let be the symmetric group of letters; Landau considered the function defined as the maximal order of an element of . This function is non-decreasing. Let us define the sequence such that . It is known that . Here it is shown that $lim inf n_{k+1}-n_k is finite.
Recommendations
- On Jacobsthal's \(g(n)\)-function
- The Landau function and the Riemann hypothesis
- Landau automorphic functions on Cn of magnitude ν
- On a basic analogue of the G-function
- scientific article; zbMATH DE number 4079545
- On the values of \(G\)-functions
- scientific article; zbMATH DE number 3861261
- scientific article; zbMATH DE number 3861262
- scientific article; zbMATH DE number 434825
- On the Landau problem for bounded nonvanishing functions
Cited in
(11)- Landau's function for one million billions
- Pattern periodic coloring of distance graphs
- Generalization of a theorem of Landau
- Determinisability of unary weighted automata over the rational numbers
- Some open questions
- Logarithmic asymptotics of Landau-Okhotin function
- On partitions of G-spaces and G-lattices
- The Landau function and the Riemann hypothesis
- MOBS: matrices over bit strings public key exchange
- The set-theoretic Yang-Baxter equation, Kimura semigroups and functional graphs
- Does subset sum admit short proofs?
This page was built for publication: On Landau's function g(n)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785585)