Bracketope (EntityClass, 3)
From Hi.gher. Space
(Difference between revisions)
m (→Sets of bracketopes by complexity) |
(add) |
||
| Line 11: | Line 11: | ||
:A ''pure bracketope'' is a bracketope which is not partially or totally useless. | :A ''pure bracketope'' is a bracketope which is not partially or totally useless. | ||
| - | *A question mark indicates that it is unknown whether this bracketope is | + | *A question mark indicates that it is unknown whether this bracketope is pure. |
| + | |||
| + | === Determining bracketopes' purity === | ||
| + | If two or more bracketopes are similar to each other, the one with the lowest [[bracketopic index]] is pure and all others are totally useless. | ||
[[Category:Bracketopes|*]] | [[Category:Bracketopes|*]] | ||
Revision as of 16:57, 18 June 2007
A bracketope is any polytope which can be defined using bracket notation.
Sets of bracketopes by complexity
- Totally useless bracketope (&, ampersand)
- A totally useless bracketope is a bracketope which is similar to a pure bracketope.
- Partially useless bracketope (*, asterisk)
- A partially equivalent bracketope is a bracketope whose vertex graph is identical to that of a pure bracketope.
- Pure bracketope
- A pure bracketope is a bracketope which is not partially or totally useless.
- A question mark indicates that it is unknown whether this bracketope is pure.
Determining bracketopes' purity
If two or more bracketopes are similar to each other, the one with the lowest bracketopic index is pure and all others are totally useless.
