Search Results for ""

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

The forward and inverse Kontorovich-Lebedev transforms are defined by K_(ix)[f(t)] = int_0^inftyK_(ix)(t)f(t)dt (1) K_(ix)^(-1)[g(t)] = ...

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

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

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.

Numbers 1, alpha_1, ..., alpha_L are rationally independent iff under the action of rotation rho_(alpha_1)×...×rho_(alpha_L) on the L-dimensional torus, every orbit is ...

The Kronecker sum is the matrix sum defined by A direct sum B=A tensor I_b+I_a tensor B, (1) where A and B are square matrices of order a and b, respectively, I_n is the ...

If R is a ring (commutative with 1), the height of a prime ideal p is defined as the supremum of all n so that there is a chain p_0 subset ...p_(n-1) subset p_n=p where all ...