Search Results for ""

Let G denote the group of germs of holomorphic diffeomorphisms of (C,0). Then if |lambda|!=1, then G_lambda is a conjugacy class, i.e., all f in G_lambda are linearizable.

The complexity of a pattern parameterized as the shortest algorithm required to reproduce it. Also known as bit complexity.

The inertial subranges of velocity power spectra for homogeneous turbulence exhibit a power law with exponent -5/3. This exponent (-5/3) is called the Kolmogorov constant by ...

Let Q_i denote anything subject to weighting by a normalized linear scheme of weights that sum to unity in a set W. The Kolmogorov axioms state that 1. For every Q_i in W, ...

n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.

The characteristic escape rate from a stable state of a potential in the absence of signal.

Krasner's lemma states that if K a complete field with valuation v, K^_ is a fixed algebraic closure of K together with the canonical extension of v, and K^_^^ is its ...

The Krohn-Rhodes complexity, also called the group complexity or simply "the complexity," of a finite semigroup S is the smallest number of groups in a wreath product of ...

Any finite semigroup is a divisor for an alternating wreath product of finite groups and semigroups.

Krohn-Rhodes theory is a mathematical approach that seeks to decompose finite semigroups in terms of finite aperiodic semigroups and finite groups.