Search Results for ""

A unit matrix is an integer matrix consisting of all 1s. The m×n unit matrix is often denoted J_(mn), or J_n if m=n. Square unit matrices J_n have determinant 0 for n>=2. An ...

A quantity which takes on the value zero is said to vanish. For example, the function f(z)=z^2 vanishes at the point z=0. For emphasis, the term "vanish identically" is ...

A smooth two-dimensional surface given by embedding the projective plane into projective 5-space by the homogeneous parametric equations v(x,y,z)=(x^2,y^2,z^2,xy,xz,yz). The ...

The point about which an angle is measured is called the angle's vertex, and the angle theta associated with a given vertex is called the vertex angle. In a polygon, the ...

A k-coloring of a graph G is a vertex coloring that is an assignment of one of k possible colors to each vertex of G (i.e., a vertex coloring) such that no two adjacent ...

_8phi_7[a,qa^(1/2),-qa^(1/2),b,c,d,e,q^(-N); a^(1/2),-a^(1/2),(aq)/b,(aq)/c,(aq)/d,(aq)/e,aq^(N+1);q,(aq^(N+2))/(bcde)] ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...