Search Results for ""
6031 - 6040 of 13135 for Use of computers and internetSearch Results
The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...
The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...
An extremal graph in which the forced triangles are all the same color. Call R the number of red monochromatic forced triangles and B the number of blue monochromatic forced ...
The Bôcher Memorial Prize is awarded by the American Mathematical Society every five years for notable research in analysis that has appeared in a recognized North American ...
The finite zeros of the derivative r^'(z) of a nonconstant rational function r(z) that are not multiple zeros of r(z) are the positions of equilibrium in the field of force ...
A quartic surface which can be constructed as follows. Given a circle C and plane E perpendicular to the plane of C, move a second circle K of the same radius as C through ...
If f has no spectrum in [-lambda,lambda], then ||f||_infty<=pi/(2lambda)||f^'||_infty (1) (Bohr 1935). A related inequality states that if A_k is the class of functions such ...
A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...
Every bounded infinite set in R^n has an accumulation point. For n=1, an infinite subset of a closed bounded set S has an accumulation point in S. For instance, given a ...
If a continuous function defined on an interval is sometimes positive and sometimes negative, it must be 0 at some point. Bolzano (1817) proved the theorem (which effectively ...
...
View search results from all Wolfram sites (204332 matches)

