Search Results for ""

The graph neighborhood of a vertex v in a graph is the set of all the vertices adjacent to v including v itself. More generally, the ith neighborhood of v is the set of all ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

For any positive integer k, there exists a prime arithmetic progression of length k. The proof is an extension of Szemerédi's theorem.

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

The group algebra K[G], where K is a field and G a group with the operation *, is the set of all linear combinations of finitely many elements of G with coefficients in K, ...

The group theoretical term for what is known to physicists, by way of its connection with matrix traces, as the trace. The powerful group orthogonality theorem gives a number ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...

A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...