TOPICS
Search

Search Results for ""


1461 - 1470 of 2910 for Integer complexitySearch Results
An algebraic equation in n variables is an polynomial equation of the form f(x_1,x_2,...,x_n)=sum_(e_1,...,e_n)c_(e_1,e_2,...,e_n)x_1^(e_1)x_2^(e_2)...x_n^(e_n)=0, where the ...
An algebraic function is a function f(x) which satisfies p(x,f(x))=0, where p(x,y) is a polynomial in x and y with integer coefficients. Functions that can be constructed ...
Algebraic number theory is the branch of number theory that deals with algebraic numbers. Historically, algebraic number theory developed as a set of tools for solving ...
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 Banach algebra A for which H^1(A,X^*)=Z^1(A,X^*)/B^1(A,X^*)=0 for all Banach A-bimodules X is called amenable (or Johnson amenable; Helemskii 1989, 1997). This notion was ...
A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...
The ampersand curve is the name given by Cundy and Rowlett (1989, p. 72) to the quartic curve with implicit equation (y^2-x^2)(x-1)(2x-3)=4(x^2+y^2-2x)^2. (1) Although it is ...
In a game proposed by J. H. Conway, a devil chases an angel on an infinite chessboard. At each move, the devil can eliminate one of the squares, and the angel can make a leap ...
An entire function which is a generalization of the Bessel function of the first kind defined by J_nu(z)=1/piint_0^picos(nutheta-zsintheta)dtheta. Anger's original function ...
A plane tiling is said to be isohedral if the symmetry group of the tiling acts transitively on the tiles, and n-isohedral if the tiles fall into n orbits under the action of ...
1 ... 144|145|146|147|148|149|150 ... 291 Previous Next

...