Search Results for ""

Let R be a ring, let A be a subring, and let B be an ideal of R. Then A+B={a+b:a in A,b in B} is a subring of R, A intersection B is an ideal of A and (A+B)/B=A/(A ...

A semiring is a set together with two binary operators S(+,*) satisfying the following conditions: 1. Additive associativity: For all a,b,c in S, (a+b)+c=a+(b+c), 2. Additive ...

A strategy for the iterated prisoner's dilemma in which a prisoner cooperates on the first move, and thereafter copies the previous move of the other prisoner. Any better ...

Ellipsoidal calculus is a method for solving problems in control and estimation theory having unknown but bounded errors in terms of sets of approximating ellipsoidal-value ...

delta(r)=sqrt(r)-2alpha(r), where alpha(r) is the elliptic alpha function.

Let a general theta function be defined as T(x,q)=sum_(n=-infty)^inftyx^nq^(n^2), then

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

Let s=1/(sqrt(2pi))[Gamma(1/4)]^2=5.2441151086... (1) (OEIS A064853) be the arc length of a lemniscate with a=1. Then the lemniscate constant is the quantity L = 1/2s (2) = ...

Let A denote an R-algebra, so that A is a vector space over R and A×A->A (1) (x,y)|->x·y. (2) Then A is said to be alternative if, for all x,y in A, (x·y)·y=x·(y·y) (3) ...