Search Results for ""

The Diffie-Hellman protocol is a method for two computer users to generate a shared private key with which they can then exchange information across an insecure channel. Let ...

The dihedral group D_n is the symmetry group of an n-sided regular polygon for n>1. The group order of D_n is 2n. Dihedral groups D_n are non-Abelian permutation groups for ...

The direct product is defined for a number of classes of algebraic objects, including sets, groups, rings, and modules. In each case, the direct product of an algebraic ...

A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...

Let c and d!=c be real numbers (usually taken as c=1 and d=0). The Dirichlet function is defined by D(x)={c for x rational; d for x irrational (1) and is discontinuous ...

The problem of finding the connection between a continuous function f on the boundary partialR of a region R with a harmonic function taking on the value f on partialR. In ...

Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

For a graph G and a subset S of the vertex set V(G), denote by N_G[S] the set of vertices in G which are in S or adjacent to a vertex in S. If N_G[S]=V(G), then S is said to ...