Search Results for ""
1961 - 1970 of 13134 for Graph TheorySearch Results
The fundamental group of an arcwise-connected set X is the group formed by the sets of equivalence classes of the set of all loops, i.e., paths with initial and final points ...
The Lambert W-function, also called the omega function, is the inverse function of f(W)=We^W. (1) The plot above shows the function along the real axis. The principal value ...
What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...
Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...
There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...
The Möbius strip, also called the twisted cylinder (Henle 1994, p. 110), is a one-sided nonorientable surface obtained by cutting a closed band into a single strip, giving ...
A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...
The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...
An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...
A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...
...
View search results from all Wolfram sites (33872 matches)

