Search Results for ""

Homology is a concept that is used in many branches of algebra and topology. Historically, the term "homology" was first used in a topological sense by Poincaré. To him, it ...

The homotopy groups generalize the fundamental group to maps from higher dimensional spheres, instead of from the circle. The nth homotopy group of a topological space X is ...

Given a commutative ring R, an R-algebra H is a Hopf algebra if it has additional structure given by R-algebra homomorphisms Delta:H->H tensor _RH (1) (comultiplication) and ...

The house graph is a simple graph on 5 nodes and 6 edges, illustrated above in two embeddings, whose name derives from its resemblance to a schematic illustration of a house ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

A hyperbolic paraboloid is the quadratic and doubly ruled surface given by the Cartesian equation z=(y^2)/(b^2)-(x^2)/(a^2) (1) (left figure). An alternative form is z=xy (2) ...

Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...

The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...

A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G-v has a Hamiltonian path (i.e., is a traceable graph) for every v ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...