Search Results for ""

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

Also known as metric entropy. Divide phase space into D-dimensional hypercubes of content epsilon^D. Let P_(i_0,...,i_n) be the probability that a trajectory is in hypercube ...

An exchange of two elements of an ordered list with all others staying the same. A transposition is therefore a permutation of two elements. For example, the swapping of 2 ...

The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...

Two points are antipodal (i.e., each is the antipode of the other) if they are diametrically opposite. Examples include endpoints of a line segment, or poles of a sphere. ...

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...

The first Brocard Cevian triangle is the Cevian triangle of the first Brocard point. It has area Delta_1=(2a^2b^2c^2)/((a^2+b^2)(b^2+c^2)(c^2+a^2))Delta, where Delta is the ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

A diagram lemma which states that, given the above commutative diagram with exact rows, the following holds: 1. If alpha is surjective, and beta and delta are injective, then ...

Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...