Search Results for ""

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The Zak transform is a signal transform relevant to time-continuous signals sampled at a uniform rate and an arbitrary clock phase (Janssen 1988). The Zak transform of a ...

A complete multipartite graph is a graph that is a complete k-partite graph for some positive integer k (Chartrand and Zhang 2008, p. 41).

Edge splitting is the reverse of edge contraction.

Define g(k) as the quantity appearing in Waring's problem, then Euler conjectured that g(k)=2^k+|_(3/2)^k_|-2, where |_x_| is the floor function.

If G is a group, then the torsion elements Tor(G) of G (also called the torsion of G) are defined to be the set of elements g in G such that g^n=e for some natural number n, ...

A theorem which treats constructions of fields of field characteristic p.

A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.

The branch of formal logic, also called functional calculus, that deals with representing the logical connections between statements as well as the statements themselves.

A polynomial having only real numbers as coefficients. A polynomial with real coefficients is a product of irreducible polynomials of first and second degrees.