Search Results for ""

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...

Percolation theory deals with fluid flow (or any other similar process) in random media. If the medium is a set of regular lattice points, then there are two main types of ...

The word "pole" is used prominently in a number of very different branches of mathematics. Perhaps the most important and widespread usage is to denote a singularity of a ...

The word polytope is used to mean a number of related, but slightly different mathematical objects. A convex polytope may be defined as the convex hull of a finite set of ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...

The small triambic icosahedron is the dual polyhedron of the small ditrigonal icosidodecahedron with Maeder index 30 (Maeder 1997), Weinninger index 70 (Wenninger 1971, p. ...

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...

A real polynomial P is said to be stable if all its roots lie in the left half-plane. The term "stable" is used to describe such a polynomial because, in the theory of linear ...