Abstract
We obtain a new formulation of a criterion for the minimal logarithmic growth rate for an arbitrary finite set with a given set of operations. It turns out that a finite set with operations has the minimal logarithmic growth rate if and only if the set of operations is not entirely contained in any of the precomplete (maximal) classes other than the classes preserving subsets and the classes of functions that preserve predicates given by permutations decomposable into cycles of the same prime length.
Similar content being viewed by others
REFERENCES
J. Wiegold, ‘‘Growth sequences of finite groups,’’ J. Aust. Math. Soc. 17 (2), 133–141 (1974).
J. Wiegold, ‘‘Growth sequences of finite groups II,’’ J. Aust. Math. Soc. 20 (2), 225–229 (1975).
J. Wiegold, ‘‘Growth sequences of finite groups III,’’ J. Aust. Math. Soc. 25 (2), 142–144 (1978).
M. Quick and N. Ruškuc, ‘‘Growth of generating sets for direct powers of classical algebraic structures,’’ J. Aust. Math. Soc. 89 (1), 105–126 (2010).
D. Zhuk, ‘‘The size of generating sets of powers,’’ J. Comb. Theory. Ser. A. 167, 91–103 (2019).
S. A. Komkov, ‘‘Cardinality of generating sets for operations from the Post lattice classes ,’’ Discrete Math. Appl. 29 (3), 159–173 (2019). doi 10.1515/dma-2019-0015
S. A. Komkov, ‘‘On classes of functions of many-valued logic with minimal logarithmic growth rate,’’ Discrete Math. Appl. 30 (4), 265–272 (2020). doi 10.1515/dma-2020-0023
I. Rosenberg, ‘‘Über die funktionale Vollständigkeit in den mehrwertigen Logiken,’’ Pozpravy Cesk. Akad. Ved. 80 (3), 3–93 (1970).
S. S. Marchenkov, ‘‘Precompleteness of closed classes in \(P_{k}\): predicate appraoch,’’ in Mathematical Problems of Cybernetics (Nauka, Moscow, 1996), Vol. 6, pp. 117-132 [in Russian].
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by I. Tselishcheva
About this article
Cite this article
Komkov, S.A. A New Formulation of a Criterion for the Minimal Logarithmic Growth Rate. Moscow Univ. Math. Bull. 75, 220–221 (2020). https://doi.org/10.3103/S0027132220050046
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132220050046