Search Results for ""
7761 - 7770 of 13135 for Book GraphSearch Results
A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closable if it has a closed extension B:D(B)->H where D(A) subset D(B). Closable operators are ...
A closed sentential formula is a sentential formula in which none of the variables are free (i.e., all variables are bound). Examples of closed sentential formulas are given ...
There are several equivalent definitions of a closed set. Let S be a subset of a metric space. A set S is closed if 1. The complement of S is an open set, 2. S is its own set ...
The term "closure" has various meanings in mathematics. The topological closure of a subset A of a topological space X is the smallest closed subset of X containing A. If R ...
Cluster analysis is a technique used for classification of data in which data elements are partitioned into groups called clusters that represent collections of data elements ...
An odd prime p is called a cluster prime if every even positive integer less than p-2 can be written as a difference of two primes q-q^', where q,q^'<=p. The first 23 odd ...
Determining the length of a country's coastline is not as simple as it first appears, as first considered by L. F. Richardson (1881-1953) and sometimes known as the ...
A system of circles obtained by multiplying each radius in a coaxal system by a constant. The Tucker circles are a coaxaloid system (Johnson 1929, p. 277).
The simple first-order difference equation y_(t+1)-Ay_t=B, (1) where A = -(m_s)/(m_d) (2) B = (b_d-b_s)/(m_d) (3) and D_t = -m_dp_t+b_d (4) S_(t+1) = m_sp_t+b_s (5) are the ...
A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...
...
View search results from all Wolfram sites (172886 matches)

