One end of type (2,4,2n)
There appears to be no limit to the complexity of the ends. Only the embeddednes proofs become more technical.
- (2,2,n)
- (2,3,n)
- (2,3,2n)
- Mathematica Notebook
One end of type (2,4,2n) |
|
There appears to be no limit to the complexity of the ends. Only the embeddednes proofs become more technical. |
See also:
|
|
|