Stepan Komkov
Abstract
Abstract We obtain a criterion for the minimal logarithmic growth rate for an arbitrary set with a given set of operations defined on it, i.e., we describe all finite sets A with operations on them such that the growth rate differs by at most a constant from the logarithmic growth rate to base ∣ A ∣.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract We obtain a criterion for the minimal logarithmic growth rate for an arbitrary set with a given set of operations defined on it, i.e., we describe all finite sets A with operations on them such that the growth rate differs by at most a constant from the logarithmic growth rate to base ∣ A ∣.
Key concepts: Logarithm, Mathematics, Logarithmic growth, Set (abstract data type), Constant (computer programming), Growth rate, Base (topology), Discrete mathematics