Search Results for ""

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

The Hall graph is a distance-transitive graph on 65 vertices having intersection array {10,6,4,1;1,2,5} (Hall 1980). It is denoted Gamma^((3)) by Hall (1980) and was ...

The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

The first Hardy-Littlewood conjecture is called the k-tuple conjecture. It states that the asymptotic number of prime constellations can be computed explicitly. A particular ...

A number n for which the harmonic mean of the divisors of n, i.e., nd(n)/sigma(n), is an integer, where d(n)=sigma_0(n) is the number of positive integer divisors of n and ...

A map u:M->N, between two compact Riemannian manifolds, is a harmonic map if it is a critical point for the energy functional int_M|du|^2dmu_M. The norm of the differential ...

The harmonic mean H(x_1,...,x_n) of n numbers x_i (where i=1, ..., n) is the number H defined by 1/H=1/nsum_(i=1)^n1/(x_i). (1) The harmonic mean of a list of numbers may be ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...