Search Results for ""

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

The three circles theorem, also called Hadamard's three circles theorem (Edwards 2001, p. 187), states that if f is an analytic function in the annulus 0<r_1<|z|<r_2<infty, ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

Shapes such as segments or angles appear larger when placed inside a larger angle.

The angle of incidence of a ray to a surface is measured as the difference in angle between the ray and the normal vector of the surface at the point of intersection.

An occurrence of a variable in a logic which is not free. Bound variables are also called dummy variables.

A cube 13-compound can be constructed as the dual of the octahedron 13-compound. It will be implemented in a future version of the Wolfram Language as ...

Deduction is the process of drawing conclusions from premises and syllogisms.

The term used by Hunter and Madachy (1975, p. 24) and Madachy (1979, p. 87) to refer to a panmagic square.