Search Results for ""

The dual polyhedron of the small icosihemidodecahedron U_(49) and Wenninger dual W_(89). When rendered, the small icosihemidodecacron and small dodecahemidodecacron appear ...

An algorithm for computing an Egyptian fraction.

The polyhedron compound of the small rhombicuboctahedron and its dual, the deltoidal icositetrahedron. The compound can be constructed from a small rhombicuboctahedron of ...

The dual polyhedron of the small rhombidodecahedron and Wenninger model W_(74).

The dual polyhedron of the small rhombihexahedron U_(18) and Wenninger dual W_(86)

The dual polyhedron of the truncated great dodecahedron U_(37) and Wenninger dual W_(75).

A submodule S of a module M such that for any proper submodule T of M, the submodule generated by S union T is not the entire module M. S is also called superfluous submodule.

The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.

Consider (1) If the probability distribution is governed by a Markov process, then P_3(y_1,t_1;y_2,t_2|y_3,t_3) = P_2(y_2,t_2|y_3,t_3) (2) = P_2(y_2|y_3,t_3-t_2). (3) ...

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.