TOPICS
Search

Search Results for ""


2411 - 2420 of 13134 for Theory of mindSearch Results
Let G be a Lie group and let rho be a group representation of G on C^n (for some natural number n), which is continuous in the sense that the function G×C^n->C^n defined by ...
A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...
A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...
Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...
A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...
A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...
A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...
Let K_1 be a knot inside a torus, and knot the torus in the shape of a second knot (called the companion knot) K_2, with certain additional mild restrictions to avoid trivial ...
Let X be a set of urelements, and let V(X) be the superstructure with X as its set of individuals. Let kappa be a cardinal number. An enlargement V(^*X) is kappa-saturated ...
A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...
1 ... 239|240|241|242|243|244|245 ... 1314 Previous Next

...