Search Results for ""

The case of the Weierstrass elliptic function with invariants g_2=-1 and g_3=0. The half-periods for this case are L(1+i)/4 and L(-1+i)/4, where L is the lemniscate constant ...

A root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...

A sequence of numbers alpha_n is said to be uncorrelated if it satisfies lim_(n->infty)1/(2n)sum_(m=-n)^nalpha_m^2=1 lim_(n->infty)1/(2n)sum_(m=-n)^nalpha_malpha_(k+m)=0 for ...

The anti-self-dual Yang-Mills equation is the system of partial differential equations ...

The de Bruijn constant, also called the Copson-de Bruijn constant, is the minimal constant c=1.1064957714... (OEIS A113276) such that the inequality ...

Consider the probability Q_1(n,d) that no two people out of a group of n will have matching birthdays out of d equally possible birthdays. Start with an arbitrary person's ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...