TOPICS
Search

Search Results for ""


31 - 40 of 294 for complementSearch Results
The normal bundle of a submanifold N in M is the vector bundle over N that consists of all pairs (x,v), where x is in N and v is a vector in the vector quotient space ...
One of a set of numbers defined in terms of an invariant generated by the finite cyclic covering spaces of a knot complement. The torsion numbers for knots up to 9 crossings ...
Let S be a nonempty set, then an ultrafilter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F. 2. If A,B in F, then A ...
The hyperbolic volume of the knot complement of a hyperbolic knot is a knot invariant. Adams (1994) lists the hyperbolic volumes for knots and links. The hyperbolic volume of ...
The orthogonal decomposition of a vector y in R^n is the sum of a vector in a subspace W of R^n and a vector in the orthogonal complement W^_|_ to W. The orthogonal ...
Given a linear code C of length n and dimension k over the field F, a parity check matrix H of C is a n×(n-k) matrix whose rows generate the orthogonal complement of C, i.e., ...
The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...
If M^n is a finite simplicial complex of dimension n>=5 that has the homotopy type of the sphere S^n and is locally piecewise linearly homeomorphic to the Euclidean space ...
A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...
Rule 158 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
1|2|3|4|5|6|7 ... 30 Previous Next

...