Search Results for ""

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, then there exists a B_3 in S such ...

The gyroelongated pentagonal bicupola is the Johnson solid J_(46), which consists of two pentagonal cupolas, one twisted with respect to the other, adjoined to a decagonal ...

An addition chain for which there is a subset H of members such that each member of the chain uses the largest element of H which is less than the member.

The Harada-Norton group is the sporadic group HN of order |HN| = 273030912000000 (1) = 2^(14)·3^6·5^6·7·11·19. (2) It is implemented in the Wolfram Language as ...

A perspective collineation with center O and axis o not incident is called a geometric homology. A geometric homology is said to be harmonic if the points A and A^' on a line ...

The partial differential equation u_t=u_(xxx)u^3.

On the class of topological spaces, a homeomorphism class is an equivalence class under the relation of being homeomorphic. For example, the open interval (-pi/2,pi/2) and ...

A function which satisfies f(tx,ty)=t^nf(x,y) for a fixed n. Means, the Weierstrass elliptic function, and triangle center functions are homogeneous functions. A ...

The identric mean is defined by I(a,b)=1/e((b^b)/(a^a))^(1/(b-a)) for a>0, b>0, and a!=b. The identric mean has been investigated intensively and many remarkable inequalities ...