Search Results for ""

The smallest composite squarefree number (2·3), and the third triangular number (3(3+1)/2). It is the also smallest perfect number, since 6=1+2+3. The number 6 arises in ...

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...

Relationships between the number of singularities of plane algebraic curves. Given a plane curve, m = n(n-1)-2delta-3kappa (1) n = m(m-1)-2tau-3iota (2) iota = ...

Fermat's sandwich theorem states that 26 is the only number sandwiched between a perfect square number (5^2=25) and a perfect cubic number (3^3=27). According to Singh ...

A representation of a C^*-algebra A is a pair (H,phi) where H is a Hilbert space and phi:A->B(H) is a *-homomorphism. (H,phi) is said to be faithful if phi is injective. For ...

An endomorphism is called ergodic if it is true that T^(-1)A=A implies m(A)=0 or 1, where T^(-1)A={x in X:T(x) in A}. Examples of ergodic endomorphisms include the map X->2x ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...