Search Results for ""
1 - 10 of 82 for stone bridgeSearch Results
Bridge is a card game played with a normal deck of 52 cards. The number of possible distinct 13-card hands is N=(52; 13)=635013559600, (1) where (n; k) is a binomial ...
Let P(L) be the set of all prime ideals of L, and define r(a)={P|a not in P}. Then the Stone space of L is the topological space defined on P(L) by postulating that the sets ...
A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...
A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...
The least number of unknotted arcs lying above the plane in any projection. The knot 05-002 has bridge number 2. Such knots are called 2-bridge knots. There is a one-to-one ...
An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...
If X is any compact space, let A be a subalgebra of the algebra C(X) over the reals R with binary operations + and ×. Then, if A contains the constant functions and separates ...
A generalization of Turán's theorem to non-complete graphs.
A theorem which specifies the structure of the generic unitary representation of the Weyl relations and thus establishes the equivalence of Heisenberg's matrix mechanics and ...
The Königsberg bridge problem asks if the seven bridges of the city of Königsberg (left figure; Kraitchik 1942), formerly in Germany but now known as Kaliningrad and part of ...
...