Search Results for ""

One of the basic objects treated in a given formal language system. The term is sometimes also used as a synonym for urelement.

A primitive subgroup of the symmetric group S_n is equal to either the alternating group A_n or S_n whenever it contains at least one permutation which is a q-cycle for some ...

A map u:R^n->R^n from a domain G is called a map of class C^r if each component of u(x)=(u_1(x_1,...,x_n),...,u_m(x_1,...,x_n)) is of class C^r (0<=r<=infty or r=omega) in G, ...

A shuffle in which cards from the top of the deck in the left hand are alternatively moved to the bottom and top of the deck in the right hand. If the deck is shuffled m ...

In above figure, which constitutes a modified version of the painting Tirets by Francois Morellet, small circles seem to appear and disappear as the eye is moved over them.

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...

Given a matrix equation Ax=b, the normal equation is that which minimizes the sum of the square differences between the left and right sides: A^(T)Ax=A^(T)b. It is called a ...

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

A congruence of the form ax^2+bx+c=0 (mod m), (1) where a, b, and c are integers. A general quadratic congruence can be reduced to the congruence x^2=q (mod p) (2) and can be ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...