Search Results for ""
1121 - 1130 of 13134 for Naive set theorySearch Results
In a noncommutative ring R, a right ideal is a subset I which is an additive subgroup of R and such that for all r in R and all a in I, ar in I. (1) For all a in R, the set ...
The semigroup algebra K[S], where K is a field and S a semigroup, is formally defined in the same way as the group algebra K[G]. Similarly, a semigroup ring R[S] is a ...
A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...
Let a and b be nonzero integers such that a^mb^n!=1 (except when m=n=0). Also let T(a,b) be the set of primes p for which p|(a^k-b) for some nonnegative integer k. Then ...
If P(n) is a sentential formula depending on a variable n ranging in a set of real numbers, the sentence P(n) for every sufficiently large n (1) means exists N such that P(n) ...
A ring defined on a singleton set {*}. The ring operations (multiplication and addition) are defined in the only possible way, *·*=*, (1) and *+*=*. (2) It follows that this ...
A unit ring is a ring with a multiplicative identity. It is therefore sometimes also known as a "ring with identity." It is given by a set together with two binary operators ...
A p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...
First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...
An apex graph is a graph possessing at least one vertex whose removal results in a planar graph. The set of vertices whose removal results in a planar graph is known as the ...
...
View search results from all Wolfram sites (53007 matches)

