Search Results for ""
2541 - 2550 of 13134 for Extremal graph theorySearch Results
In general, a remainder is a quantity "left over" after performing a particular algorithm. The term is most commonly used to refer to the number left over when two integers ...
In a local ring R, there is only one maximal ideal m. Hence, R has only one quotient ring R/m which is a field. This field is called the residue field.
Let H be a subgroup of G. A subset T of elements of G is called a right transversal of H if T contains exactly one element of each right coset of H.
A generalization of the Gaussian sum. For p and q of opposite parity (i.e., one is even and the other is odd), Schaar's identity states ...
The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.
A functor which defines an equivalence of module categories.
Eliminate each knot crossing by connecting each of the strands coming into the crossing to the adjacent strand leaving the crossing. The resulting strands no longer cross but ...
Let a sequence {a_i}_(i=1)^infty be strictly increasing and composed of nonnegative integers. Call A(x) the number of terms not exceeding x. Then the density is given by ...
For a set S, the span is defined by maxS-minS, where max is the maximum and min is the minimum.
An operator T which commutes with all shift operators E^a, so TE^a=E^aT for all real a in a field. Any two shift-invariant operators commute.
...
View search results from all Wolfram sites (34319 matches)

