Search Results for ""
2601 - 2610 of 13134 for Graph TheorySearch Results
The upper central series of a group G is the sequence of groups (each term normal in the term following it) 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... that is constructed in the ...
Given a number field K, there exists a unique maximal unramified Abelian extension L of K which contains all other unramified Abelian extensions of K. This finite field ...
The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...
Honaker's problem asks for all consecutive prime number triples (p,q,r) with p<q<r such that p|(qr+1). Caldwell and Cheng (2005) showed that the only Honaker triplets for ...
An ordinal number is called an initial ordinal if every smaller ordinal has a smaller cardinal number (Moore 1982, p. 248; Rubin 1967, p. 271). The omega_alphas ordinal ...
There are at least two distinct notions of an intensity function related to the theory of point processes. In some literature, the intensity lambda of a point process N is ...
Let X be an infinite set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A,B in V(X) be finitary algebras with finitely many operations, and ...
A semigroup S is said to be an inverse semigroup if, for every a in S, there is a unique b (called the inverse of a) such that a=aba and b=bab. This is equivalent to the ...
A semiprime which English economist and logician William Stanley Jevons incorrectly believed no one else would be able to factor. According to Jevons (1874, p. 123), "Can the ...
An algorithm in control theory introduced by Kalman (1960) and refined by Kalman and Bucy (1961). It is an algorithm which makes optimal use of imprecise data on a linear (or ...
...
View search results from all Wolfram sites (33872 matches)

