TOPICS
Search

Search Results for ""


4591 - 4600 of 13135 for Combinatorial MathematicsSearch Results
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 symbol defined by c^(a/b) = c(c+b)(c+2b)...[c+(a-1)b] (1) = b^a(c/b)_a (2) = (b^aGamma(a+c/b))/(Gamma(c/b)), (3) where (a)_n is the Pochhammer symbol and Gamma(z) is the ...
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.
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 ...
A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...
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 ...
1 ... 457|458|459|460|461|462|463 ... 1314 Previous Next

...