Search Results for ""
4911 - 4920 of 13135 for Computational GeometrySearch Results
Let p be a non-wandering point of a diffeomorphism S:M->M of a compact manifold. The closing lemma concerns if S can be arbitrarily well approximated with derivatives of ...
The clove hitch is the hitch illustrated above that is also called the boatman's knot or peg knot.
Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.
Let A be a unital C^*-algebra, then an element u in A is called co-isometry if uu^*=1.
In 1976, Coates and Wiles showed that elliptic curves with complex multiplication having an infinite number of solutions have L-functions which are zero at the relevant fixed ...
In a cochain complex of modules ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->..., the module B^i of i-coboundaries is the image of d^(i-1). It is a submodule of C^i and is ...
Each of the maps of a cochain complex ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->... is known as a coboundary operator.
In a cochain complex of modules ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->... the module Z^i of i-cocycles Z^i is the kernel of d^i, which is a submodule of C^i.
Code 177 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.
Code 2040 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.
...
View search results from all Wolfram sites (173967 matches)

