Search Results for ""
3821 - 3830 of 13134 for complexity theorySearch Results
For a finite group G, let p(G) be the subgroup generated by all the Sylow p-subgroups of G. If X is a projective curve in characteristic p>0, and if x_0, ..., x_t are points ...
The abundancy of a number n is defined as the ratio sigma(n)/n, where sigma(n) is the divisor function. For n=1, 2, ..., the first few values are 1, 3/2, 4/3, 7/4, 6/5, 2, ...
The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...
Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...
An algorithm similar to Neville's algorithm for constructing the Lagrange interpolating polynomial. Let f(x|x_0,x_1,...,x_k) be the unique polynomial of kth polynomial order ...
The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...
Given a field F and an extension field K superset= F, an element alpha in K is called algebraic over F if it is a root of some nonzero polynomial with coefficients in F. ...
The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...
The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...
A link which has a link diagram with alternating underpasses and overpasses. The proportion of links which are alternating tends exponentially to zero with increasing ...
...
View search results from all Wolfram sites (28442 matches)

