Search Results for ""

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 ...

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 partial differential equation u_t+2uu_x-nuu_(xx)+muu_(xxx)=0.

The system of ordinary differential equations (dm)/(dt) = lambdamxm+gammax1 (1) (dgamma)/(dt) = lambdagammaxm. (2)

The partial differential equation P_t=P_(xx)-uP_x+partial/(partialx){[u-F(x)]P}.

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.