Talk:Polychoron
From Wikipedia, the free encyclopedia
This article needs to be renamed. "Polychora" is a made-up word that, as far as I know, is not used by mathematicians. The same goes for glome. --Zundark, 2002 Feb 19
I beg to differ with you. I just did a web search on google for polychora, and found several pages of links, all of which use the word polychora in the meaning used here, some as prestigious as mathworld.com. It may be a neologism in the last century, but it certainly seems to be used consistently, and unambiguously, by a community of speakers about a particular topic. Whether mathematicians all use it really isn't the issue, since they are happy using 0-sphere for point, 1-sphere for circle and 2-sphere for what English speakers generally call a sphere.
- A 0-sphere is pair of points. And mathematicians generally call a 0-sphere a pair of points, a 1-sphere a circle, and a 2-sphere a sphere. But they don't call a 3-sphere a glome. And mathworld.com is full of inaccuracies and should not be relied upon for anything. And note that I wasn't questioning whether all mathematicians use these terms, but whether any mathematicians use them. Can you cite a single paper in a peer-reviewed mathematical journal that uses either term? This doesn't mean the terms can't be mentioned in Wikipedia, but we shouldn't use them in article titles or in other ways that imply that they are standard terms. --Zundark, 2002 Feb 19
-
- that seems like a reasonable approach, even if I disagree with it as a criteria to use in this case. Let me point out the fact that mathematicians have very little motivation to coin neologisms, since they already have terms that they can and do use to be unambiguous. So the popular press, (or the popular web as in this case) is the only way to find out what terms and words that hobbyists or non-professionals are using to refer to something. I certainly know that in my chosen field, I get very tired of people using the word 'hacker' as a perjorative, but recognize that it is used that way. My small part in that battle is to use the word in the broader sense of an 'expert-programmer' and hope that both word-meanings survive. I certainly think that 'polychora' is a much more usable term than '4 dimensional figures', which is the only competition that I know of. The same with glome as a more usable term than hypersphere, and tesseract for hypercube.
-
-
- The word "tesseract" is completely different, as it's a well-established term. I suggest renaming this page to 4-polytope, which is reasonably brief, reasonably standard, and (judging by the number of hits on Google) more popular than "polychora" anyway. --Zundark, 2002 Feb 19
-
-
-
- It sounds very odd to hear that "mathematicians have very little motivation to coin neologisms". Mathematics is full of words being coined almost daily. New concepts are constantly appearing, or older ones becoming important enough to require individual names. And then there are the names we could do without ... Zaslav 04:05, 20 November 2006 (UTC)
-
The term "polychoron" was actually coined by Norman Johnson who is currently writing a book titled "Uniform Polytopes" - he is the one the Johnson solids are named after and is a world renown mathematician. The name "polychorema" was originated by George Olshevsky, and Norman encouraged the shorter term "polychoron" - It was coined quite recently - this is why it is not seen in many journals and books. It should also be noted that most (if not all) of those who are presently involved with serious polychoron study actually uses the term - also the majority of polychoron discoveries and research were within the past 15 years in which very little has been in any published journals, the ones using the term are not just hobbyist - but the primary researchers of the field! -- [Jonathan Bowers - discoverer of over 8000 uniform polychora. August 15,2002]
I work with convex polytopes from time to time and never heard of a "polychoron" until today. It's a nice name but I think it is not generally known yet. I edited the article to reflect this fact. Let's hope it spreads in the future. Zaslav 04:05, 20 November 2006 (UTC)
Contents |
[edit] Cells meeting at a face
Recently, in "a face is where two cells meet", "two" was changed to "two or more". I would like to question this, as it runs counter to the case for lower-dimensional polytopes. (I admit I do not have much knowledge about polytopes so I will submit to correction if I'm totally wrong.) Eric119 06:53, 27 August 2005 (UTC)
- It depends on what is being meant by face, since that word is unfortunately heavily overloaded with incompatible meanings. If a 2-dimensional surtope (sub-polytope) is meant, that you're right: in 4 dimensions, only 2 cells can ever meet at a face. I just looked at the page history, and the example doesn't make sense: the pentatope has exactly two tetrahedral cells meeting at every face, not any more. However, it does have three cells sharing a single edge (a 1-dimensional surtope). Now, I'm not sure if faces can share more than 2 cells if the polytope is non-convex, but until this is confirmed, I'd say revert the edit and ask for clarification.—Tetracube 22:50, 29 August 2005 (UTC)
-
- It is precisely this confusion of meanings etc, that i spent a good deal of time realigning meanings to what the words mean elsewhere. For example, 'cell' elsewhere means a tiling-element (eg cell-based automata). The transfer of meaning to 3-element comes because the surface of a polychoron looks like a foam of bubbles. Some authors use face in the meaning of bounding element, (ie what might face you), while others use it in the restricted meaning of 2d element. Wendy.krieger 10:13, 19 September 2007 (UTC)
[edit] suggestion: table of elements
An idea for the list of nonprismatic convex uniform polychora, of which all but two (the snub 24-cell and the grand antiprism) are derived by truncating regular polychora. The tesseract (for example) has 8 cells, 24 faces, 32 edges and 16 vertices. Each of the 12 figures with the same symmetry has cells corresponding to some subset of these 8+24+32+16 elements, thus:
8 | 24 | 32 | 16 | |
---|---|---|---|---|
tesseract | cubes | (squares) | (edges) | (vertices) |
16-cell | (vertices) | (edges) | (triangles) | tetrahedra |
rectified tesseract | cuboctahedra | - | - | tetrahedra |
bitruncated | truncated octahedra | - | - | truncated tetrahedra |
truncated tesseract | truncated cubes | - | - | tetrahedra |
truncated 16-cell | octahedra | - | - | truncated tetrahedra |
cantellated tesseract | small rhombicuboctahedra | - | triangular prisms | octahedra |
cantitruncated tesseract | great rhombicuboctahedra | - | triangular prisms | truncated tetrahedra |
runcinated | cubes | cubes | triangular prisms | tetrahedra |
runcitruncated tesseract | small rhombicuboctahedra | octagonal prisms | triangular prisms | cuboctahedra |
runcitruncated 16-cell | small rhombicuboctahedra | cubes | hexagonal prisms | truncated tetrahedra |
omnitruncated | great rhombicuboctahedra | octagonal prisms | hexagonal prisms | truncated octahedra |
... and similar tables for the 5-cell, 24-cell and 120/600-cell groups. (I'm not sure the above table is accurate in detail, but I hope it gets the idea across.) Anton Sherwood 02:10, 2 January 2006 (UTC)
- I'm definitely interested in getting more information on the uniform polychora organized. It sounds like a good table format above as I can understand it. I definitely like it for showing the relations. I guess I would try to make the same relation tables first on the convex uniform polyhedra. In fact the polyhedron article itself or Uniform polyhedron need more than a little organizational and cleanup work. Are you interested in helping there too?
- Also perhaps you've noticed I started adding some stat tables to the individual polychoron articles that exist so far: Pentachoron, hypercube, 16-cell, 24-cell, 120-cell, 600-cell, Rectified 5-cell, Rectified 600-cell, Runcinated pentatope Runcinated tesseract, Bitruncated 24-cell. : I didn't try a new template yet since I wasn't sure what all information to include. Free free to help there as well. I'm a bit random in my work as time and inspiration allows. I'm hoping to generate more pictures of the polychora, but my generating software needs extending for generating more general vertex figures. Tom Ruen 22:43, 2 January 2006 (UTC)
[edit] reorganization
Hi Tom Ruen, I noticed your recent addition of a page for semi-regular polychora, and it gave me an idea: why not have a separate page for the convex uniform polychora as well? The current polychoron page (this page) seems too cluttered with lists of polychora, and seems imbalanced in emphasis (the convex uniform polychora list takes up most of the page, but they are hardly representative of uniform polychora in general, most of which are non-convex). We could use this current page as an index to point to other pages with the polychoron lists, e.g., something like:
- (...general introductory stuff currently at the top of the page...)"
- The polychora may be grouped as follows:
- The regular polychora:
-
- Convex regular polychora
- Non-convex regular polychora
- The uniform polychora:
-
- Convex semi-regular polychora
- Convex uniform polychora
- Non-convex uniform polychora
- Prismatic uniform polychora:
-
- Polyhedral prisms
- Duoprisms
- Uniform 3-space tessellations (Suggested addition by User:Tomruen)
... and so forth. (The above structure is just a rough idea, some of the items above may not need to be separate pages.)
What do you think? —Tetracube 20:59, 9 January 2006 (UTC)
- Sounds very good, although I'm wondering how Anton Sherwood's organization might fit in as well. I'm not in a place to do much work here, except a little slow tinkering. I'm very happy if you (and Anton Sherwood ) would like to do some major restructuring like this. Tom Ruen 00:21, 10 January 2006 (UTC)
- Not fully defendable, but REALLY want to include the tessellations as "Infinite polychora" connected here - Andreini tessellation
- ALSO: This structure above should go under Uniform polychoron which is currently redirected to Polychoron.
- Tom Ruen 01:17, 10 January 2006 (UTC)
-
- I agree with both of you. (I need to learn more about Wikipedia mechanics before I can take part in any serious reorganizing.) As I see it, the page Uniform polychoron should link to
- Regular polychoron, containing information about all sixteen (six convex and ten stars) and mentioning the regular tiling of three-space by cubes;
- Convex uniform polychoron, showing views from inside S3, analogous to the view of hyperbolic {5,3,4} in Not Knot; including the Andreini tilings. This could of course be organized as I suggested above. (I'd need to learn more about 4D geometry in order to generate such views.)
- Uniform polychoron should also expand on the statement "The Uniform Polychora Project has classified the 8,186 currently known uniform polychora into 29 groups."
- --Anton Sherwood 01:56, 10 January 2006 (UTC)
- I agree with both of you. (I need to learn more about Wikipedia mechanics before I can take part in any serious reorganizing.) As I see it, the page Uniform polychoron should link to
-
- I have the VEFC stats for the 10 Non-convex regular polychora, and model wireframes, so maybe I'll try adding a stub article for these, sometime in next couple weeks. At least 10 isn't overwhelming addition to take on! Tom Ruen 04:29, 10 January 2006 (UTC)
OK, I've just moved the uniform polychora lists into the uniform polychora page, and added a section about the prismatic uniform polychora. It took a lot longer than I expected, so I just left a link from this page. I haven't had the time to create the regular polychora page yet. Also, the uniform polychora page is still preliminary; we should probably reorganize it as TamFang has said, make it link to regular polychora and semiregular polychora, then list the remaining polychora. Anyway, it's bedtime for me, so I'll check back tomorrow and maybe move the regular polychora lists into the regular polychora page. :-) —Tetracube 06:51, 10 January 2006 (UTC)
- Good start!
- Myself, I made a quick formatted summary data table for the 16 regular polychora on a test page. User:Tomruen/regular polychora (Added this test so hopefully I can leave it alone for a while!)
- I confirmed my data by comparing to [1] I listed 6 convex forms first, and then grouped 10 nonconvex forms by face types.
- I'd like to keeping the convex and nonconvex regulars together in one article, or just having a nice summary table like this one (with some pictures added later).
- Tom Ruen 07:28, 10 January 2006 (UTC)
- I just got an mail from Jonathan Bowers, and he has a new website, worthy to read, starting apparently listing 1845 polychora in 29 categories! Tom Ruen
-
- Wonderful!! I just glanced over Jonathan's new website. Truly impressive! Also, I like the table you have. I think we can put that in the regular polychora page, using it to link to the individual regular polychoron pages. BTW, what should we do with the current convex regular polychora page? Should we rename it so that it includes the non-convex regulars as well?—Tetracube 18:09, 10 January 2006 (UTC)
OK, I've removed the list of regular polychora and replaced it with a link to the regular polytopes page where the tables are. I've also put in its place a nice nested structure giving an overview of the various types of polychora. I hope this looks good. :-) What do you guys think?—Tetracube 17:35, 13 January 2006 (UTC)
- Fine with me. — Anton Sherwood 19:15, 13 January 2006 (UTC)
[edit] "prismatic"
A polychoron may also be termed prismatic if some or all of its cells are prisms, and its symmetry generalizes the symmetry of prisms. This is a somewhat vague category ...
I disagree with "vague": it's well-defined. A prismatic polytope is a Cartesian product of two polytopes of lower dimension. ("Two or more" is not necessary because one or both of the "factors" may itself be a product.) The measure polytopes are excluded because they have symmetries other than those of their factors.
A prismatic polytope has some prismatic elements, but that's not sufficient: edge-truncation or face-truncation of the regular polychora introduces prisms as cells, without making the polytope prismatic.
--Anton Sherwood 18:13, 10 January 2006 (UTC)
- You're right, prismatic is well-defined after all. I've corrected the text. Thanks for pointing this out!—Tetracube 19:17, 10 January 2006 (UTC)
[edit] subsets of subsets
I just noticed Tetracube's "correction" of Jan.13 to the classifications. I had written:
- A polychoron is uniform if ...
- A uniform polychoron is semi-regular if ...
- A semi-regular polychoron is regular if ...
- A uniform polychoron is semi-regular if ...
The cascade was intentional: regular polytopes are a subset of semi-regular polytopes, which in turn are a subset of uniform polytopes. Tetracube's change removes that nesting. —Tamfang 01:17, 2 February 2006 (UTC)
- Ahh, OK. I understand why it's done that way now. It just looked weird at first glance. My bad. Feel free to revert it to what you had before.—Tetracube 01:34, 2 February 2006 (UTC)
[edit] Everything is ill defined
The article uses many ill-defined terms that are not clear, specifically, in the definition section:
- A closed set in mathematical analysis is a set which contains all its limit points. It does not seem to be what is wanted here.
- The word "figure" is undefined.
- There is no need to redefined point, edge, face, cell, since there are links to preexisting definitions.
- In the three criterion of the definition, the words "join" and "compound" are undefined.
Also, I would like to point out that the definition of polychoron on mathworld conficts with some of the notions discussed later in this page. According to mathworld, all polychoron are polytopes, which are convex hulls. Therefore polychoron cannot be classified by convexity, as they are all convex.
There are likewise many undefined notions in the classification section. For example, a polychoron is uniform if...
- Its vertices are acted on by a symmetry group. A symmetry group is a permutation of points, by definition. Therefore a set of vertices is always acted upon by a symmetry group. Is it meant that the symmetry group acts in such a way that it extends to an action on the entire polychoron, via a permutation of the barycentric coordinates of points in every cell? If so this requires convexity of all polychoron.
- It is not clear what it means for edges to be equal.
Etc. User:Ajcy
- Hmmmm... I hope User:Ajcy would like to help improve this article! :)
- On definition of polytope, there's certainly no convexity requirement. A polytope need not be convex any more than a polygon needs to be convex!
- Tom Ruen 23:40, 20 March 2006 (UTC)
- The meaning of "closed" here is related to that of abstract algebra: a closed surface has no ends, and a set is "closed under an operation" if the operation on members of the set always gives a member, e.g. the set of real numbers is closed under addition and multiplication but not under division (because n/0 is not a member) nor fractional exponentiation.
- All polychora are polytopes, yes. Mathworld does not say all polytopes are convex: it says "A convex polytope may be defined as the convex hull of a finite set of points . . . ."
- I've improved the symmetry language in the definition of uniform. Still needed is some statement of the distinction between vertices of the outer surface (the surtope) and vertices of a self-penetrating polytope. —Tamfang 23:29, 21 March 2006 (UTC)
-
- The definition of 'uniform', designed to include and exclude particluar cases, is that the figure is isogonal, equalateral, and reductive to polygons. The 'reductive to polygons', means that every surtope or element, that contains polygons, must itself be uniform. This last condition prevents figures like the 24-choron antiprism (which features octahedral prisms), not part of the set. --Wendy.krieger 10:35, 7 October 2007 (UTC)
[edit] H3
Where do you find "at least 48" uniform hyperbolic tilings? I see
- 8 truncations of {3,5,3}
- 8 truncations of {5,3,5}
- 13 truncations of {4,3,5} / {5,3,4}
for a total of 29, or 33 counting the regulars. (I've rearranged the bullets slightly so that the items more indented are subsets of those less indented.) —Tamfang 21:08, 22 July 2006 (UTC)
- You're right, I was double counting. 33 with regulars. Glad for your watchful eyes, and I know it also should explain E3, H3 a bit too! Tom Ruen 21:49, 22 July 2006 (UTC)
By the irrelevant way — some years ago in sci.math someone asked whether buckyballs (tI) can tile H3; had I known then what I know now, I could have simply responded, "yes, it's the bitruncated {5,3,5}"! —Tamfang 00:46, 23 July 2006 (UTC)
- Very cool! I'd say let's enumerate these lists, but we'd better finish the REGULAR hyperbolic tessellation of 3-space pictures first! (Still hoping Jeff Weeks' will get his software to create these.) Tom Ruen 01:04, 23 July 2006 (UTC)
The current list of uniform polychora in H3, with cells of finite extent (ie do not rus to infinity), is one infinite class, 76 by applying wythoff's construction to the nine mirror groups (ie dotted graphs), and nine further discoveries. Most of these 9 are recent discoveries, although i did give three of these in my paper on the subject. Wendy.krieger 10:06, 19 September 2007 (UTC)
- Interesting - Can you show me the Coxeter-Dynkin diagrams for the 9 mirror groups? (I'm in the dark for the moment.) Tom Ruen 20:45, 21 September 2007 (UTC)
-
- The nine groups in 3d are in order: 534, 353, 535, 53A, 3334:, 3335:, 3434:, 3435:, and 3535:. The first three are regular, the 53A consists of branches 5,3,3 radiating from a single node, the groups with a colon in it form four sides of a square, marked with the appropriate numbers. The number of distinct uniform figures from these are 16, 9, 9, 4, 9, 9, 6, 9, 6 total = 76. The groups are often mentioned in text, but only the first three are given, because Schläfli's notation does not cover the remainder. I am using my notation here. Wendy.krieger 07:02, 22 September 2007 (UTC)
-
-
- Are there any references I can use for these groups and related hyperbolic honeycombs? Tom Ruen 21:58, 22 September 2007 (UTC)
-
-
-
-
- I thought i read it in DMY Sommerville 1929 "An introduction to the geometry of N dimensions" Dover reprint. Sommerville refers to Schläfli only very late (ch ix and x) in this work, and mentions only the regular ones (since the schläfli can only generate regular ones). It might be elsewhere, i should try to recall. The exact enumeration is by me, but we already know from Conway that under certian conditions (which apply here), anything goes goes.--Wendy.krieger 07:27, 23 September 2007 (UTC)
-
-
-
-
-
- Norman Johnson mentioned to me once that they're covered in his Uniform Polytopes — if that ever sees the light of day ... —Tamfang 05:02, 23 September 2007 (UTC)
-
-
-
-
- I count 11 forms from 53A; do the other 7 duplicate forms from 534? If so, it's a bit surprising that my counts agree with Wendy's for the "square" groups. —Tamfang 05:15, 23 September 2007 (UTC)
-
-
-
-
- The only ones from 53A that are not in 534 are where the two -3 branches have different markings, because a5e3iAi = a5e3i4o. This means that one branch is always marked x, the other o, and the other two freely x and o. Wendy.krieger 07:10, 23 September 2007 (UTC)
-
-
- Hi Wendy! How about those with infinite cells (inscribed in horospheres I guess)? —Tamfang 05:02, 23 September 2007 (UTC)
-
- There are many different groups here, but there's a lot of repeatition as well. But i will list these and their known counts. Rows contain related symmetries in increasing size (eg all multiples of the first), different rows are unrelated, except for 633 and 634, which share a 1 to 5 relation (ie 63A is five times 333:A. As before, : means return to start, and :: means return to the second node. So 333:6 is an unnarked triangle with a 6-branch hanging off it.
- 443, 44A, 444, 4433 44Aq, 4444: gives 15, 4, 9?, 3, 1.
- 633, 333:3, 363, 636, 333:6, 3333:3:3:: give 15, 4, 6, 6, 0
- 634, 63A, 333:4, 333:33: 6363: gives 15, 4, 4, 1, 1 (excluding elswhere includes)
- 536, 333:5, give 15, 4
- 3336: gives 9,
- 3436: gives 9
- 3536: gives 9
- 4443: gives 9
- Other integer groups are frieze-patterns, with infinite cells. Very few of these cross constructively, although two are known: the groups 834 crosses with a second 834, to give a finite tiling, which in turn generates the non-wythoff uniform tiling of truncated cubes, 16 at a vertex. The other is a set of 84A crossing, to give the larger of the octagonal-octahedrals. The resulting tiling is one of rCO and triangle prisms, 16 of each at a vertex. Wendy.krieger 07:10, 23 September 2007 (UTC)
- There are many different groups here, but there's a lot of repeatition as well. But i will list these and their known counts. Rows contain related symmetries in increasing size (eg all multiples of the first), different rows are unrelated, except for 633 and 634, which share a 1 to 5 relation (ie 63A is five times 333:A. As before, : means return to start, and :: means return to the second node. So 333:6 is an unnarked triangle with a 6-branch hanging off it.
-
-
- Dunno what you mean by "cross", but – are these the "infinite class" you mentioned earlier? —Tamfang 20:47, 3 October 2007 (UTC)
-
-
- You mention 9 non-Wythoff forms; how were these found? It has occurred to me that one could search for vertex figures by making all possible closed surfaces out of lower vertex figures, but a successful one has to have a circumsphere and I don't know how to tell that. —Tamfang 20:47, 3 October 2007 (UTC)
-
-
- The tiling of truncated Cubes was considered from the general case of xPxQoRo, where xQoRo has a flat surface. The tiling of rCO and triangle-prisms, was derived from viewing the vertex-figure in a dream, the case of the pt{3,5,3} was derived by looking at partial truncates, especially of the special subgroup in {3,5,3}. The remaining six come together, when one uses sC and sD as vertex figures. Because the vertex-figure is itself uniform, one can truncate and rectify it. That makes nine. Then there is the infinite class of bollochomea, which consists of 12 p-gonal prisms, and 8 cubes, meeting at a pyrito-icosahedron at the vertex figure. Suppose that's ten or so. --Wendy.krieger 10:29, 7 October 2007 (UTC)
-
[edit] Coxeter-Dynkin diagrams for hyperbolic groups
3 linear graphs: (regular) |
1 Y-graphs: | 5 square graphs: |
---|---|---|
Note: has double the fundamental domain of . (I think!) Tom Ruen 22:07, 22 September 2007 (UTC)
- By analogy with alter-cubic and quarter-cubic, perhaps one of the "square" groups has a unit double that one? (I'm a bit too stupid tonight to work out which one) —Tamfang 05:02, 23 September 2007 (UTC)
-
- The only ones that are related are 534 and 53A. The other ones with squares in them do not come to much. 3334: and 3534: only has one kind of mirror, which is restored on removal. 3434: has two kinds of mirror in the same shape, but the removal of one set of mirrors makes the shape inot a non-simplex shape six times the size. --Wendy.krieger 07:16, 23 September 2007 (UTC)
I added the hyperbolic groups at Coxeter–Dynkin_diagram#Hyperbolic_Infinite_Coxeter_groups. I expect there's some triangle graphs for the hyperbolic plane, like 334:, 344:, 444:? Tom Ruen 03:03, 1 October 2007 (UTC)
[edit] Definition criterion 2
I think I must object to the definition, criterion #2, Adjacent cells are not in the same three-dimensional hyperplane.
This looks like a definition for a "convex polychoron" only.
Thoughts?
Tom Ruen 01:13, 4 September 2006 (UTC)
- No, this criterion does not exclude non-convex polychora. What it does exclude is degenerate compounds of polychora (e.g., a 4-cube can be considered as a compound of 16 4-cubes with half the edge length; in this case, the facets of the original 4-cube are replaced with 8 smaller cubes, all of which lie on the same hyperplane. This criterion is to exclude this from being considered a distinct polychoron). Note that there is no mention of any restrictions on the relative orientations of the 3-planes that 2 adjacent cells lie in: they can be in a convex angle or concave angle.—Tetracube 03:49, 4 September 2006 (UTC)
- So, going down a dimension for example, the surface of a rubik's cube is not a polyhedron because it has neighboring co-planar square faces? ? Tom Ruen 03:55, 4 September 2006 (UTC)
-
- Correct. That's the intention of this criterion, as I read it.—Tetracube 16:32, 4 September 2006 (UTC)
-
-
- The 4-cube vs 2x2x2x2 4-cube are different polytopes as far as I'm concerned. I always figured topology is more important than geometry for polytopes. I know coxeter discounted zero dihedral angle faces for defining regular polyhedra, but they're STILL categorical polyhedra to my accounting. Tom Ruen 18:11, 4 September 2006 (UTC)
-
-
-
-
- Sorry for taking so long to reply... but anyway, to me, it seems redundant to include such polytopes. A facet can always be decomposed into smaller facets ad infinitum, but you still end up with the same geometrical shape. I consider topology to be somewhat outside the realm of polytopes per se, because you're really dealing with decompositions of unbounded surfaces rather than planar facets. At least, I like to think of polytopes as being prototypically planar-faceted; they are equivalent to various deformations thereof. In any case, at least for convex (planar faceted) polytopes, you really don't want to include (adjacent) co-planar facets, because you will get a redundant hyperplane representation, which causes many nice properties of polytopes to break down. Also, as Bowers has found, allowing coplanar facets in non-convex polytopes leads to an explosion of bizarre pseudo-polychora (which induces similar polytopes in n>4). But in the end, this is all a matter of taste.—Tetracube 17:54, 13 September 2006 (UTC)
-
-
- What bothers me, for example is the definition says THIS is a polytope, while THIS (surface) is not, despite identical topology. Tom Ruen 18:34, 13 September 2006 (UTC)
-
- You have a point there. Although, I'd say that since the definition comes from an effort to catalogue polytopes, the intent of the definition is to yield prototypical polytopes, so that each distinct topology is represented only once. The 2x2x2 cube topology, for example, would be represented by your Catalan example. Otherwise, you have an infinite number of topologies associated with any given geometrical shape (up to a facet decomposition): for example, the cube can also be decomposed in such a way that it becomes topologically equivalent to the triakis tetrahedron:
- Or, for that matter, a tetrakis hexahedron:
- Personally, I'd rather that a geometrical cube be equivalent only to the topological cube.
- From another angle, your 2x2x2 cube can be thought of as a compound of 8 cubes, and so is "redundant" in the sense that it can be constructed from more "basic" polytopes that are already included under the definition. (Note that compounds are explicitly excluded in item 3 of the definition.)
- Of course, maybe what you really want is to replace the definition of polychoron altogether.—Tetracube 20:30, 13 September 2006 (UTC)
- Well, all of this is why I don't want to limit the definition of polytope (or any dimensional version) more than necessary. I accept that a polygon has 2 edges on every vertex. A polyhedron has 2 faces on every edge. A polychoron has 2 cells on every face. etc.
- It does get complicated still, for example, the topological nature ofstellations are not clearly defined in my mind, although they can be named as if they are polyhedra.
- Example: - is this (picture) a compound of two tetrahedrons? Is it a NET made of an octahedron with 8 tetrahedrons around it (As an unfolded octahedral hyperpyramid)? Is it a concave icosatetrahedron? My answer is the picture could be ANY of the above, but only the LAST is a polyhedron, having 2 faces/edge. In fact, same topology as the triakis octahedron, .
- So yes I would like to replace the definition, although more just remove criterion 2. Of course the real issue is where did it come from and what other definitions can we find printed. I'll look further when I have some time. Tom Ruen 23:05, 13 September 2006 (UTC)
-
- I'd be careful about forcing the interpretation of the stella octangula to be a concave icosatetrahedron... You realize that many of the so-called regular star polyhedra would fail to be regular under this definition, right? For example, {5, 5/2} (the "great dodecahedron") is regular by virtue of the fact that its faces are pentagons. But they mutually intersect, so using your definition the faces of the great dodecahedron should be isosceles triangles, not regular pentagons. Similarly, many of the star polychora have facets that intersect each other in very complex ways (which is why Jonathan Bowers' pictures are so intriguing). If we take your interpretation that they should all be treated as concave surfaces, I doubt that any of them would qualify as regular or even uniform polychora. Consider again the great dodecahedron: the current edge count is based only on the edges of pentagons, and not the segments arising from the intersections between pentagons. If we adopt your definition, the great dodecahedron should have 90 edges and 90 faces, but that's not what most mathematicians have agreed on. I'm not prepared to redefine edge, face, ridge, and cell contrary to how they are currently being used.—Tetracube 00:18, 16 September 2006 (UTC)
-
- P.S. To help this discussion reach some semblance of resolution, here are some quotations from H.S.M. Coxeter's Regular Polytopes:
- Just as the definition of a polygon can be generalized by allowing non-adjacent sides to intersect, so the definition of a polyhedron can be generalized by allowing non-adjacent faces to intersect; and it is natural at the same time to allow the faces to be star-polygons. (Regular Polytopes, p. 96).
- In view of the figures discussed in Chapter VI [editor's note: i. e., the Kepler-Poinsot solids, or the star polyhedra], it is natural to extend the definition of a polytope so as to allow non-adjacent cells to intersect, and to admit star-polygons and star-polyhedra as elements. (Regular Polytopes, p. 263).
- (Editor's note mine.) I submit that Coxeter's definitions of polyhedra and polytopes, suitably extended to allow the stars, is the best way to approach this issue, since it sidesteps the problems that arise from treating these figures as concave, non-self-intersecting objects.—Tetracube 00:46, 16 September 2006 (UTC)
- P.S. To help this discussion reach some semblance of resolution, here are some quotations from H.S.M. Coxeter's Regular Polytopes:
-
- A good deal of thought has gone into this matter, and many words entered in the polygloss as a result. Something like 5/2, has 5 sides winding around the centre twice. The sides cross, and the central core is density 2 (ie d2 is density 2, 2d is 2-dimension). The formulae for working out surface gives the correct answer when the core is counted twice. So something like "volume = moment of surface" must enumerate internal bits of the surface, etc. So a polytope can be treated as a density function, and we can get
-
- surface = gradient of density; volume = moment of surface = space integral of density.
-
- since it is also useful to keep the limit of referenced points as a word (other than surface), these are distinguished in the PG as "perimeter", and forms in /peri/ then refer to the limit of referenced points. The core bit of the pentagram is ouly counted once in the periform (figure bounded by the perimeter.
-
- In relation to adjacent faces being in the same plane, one notes that tilings have a margin-angle of 180 degrees, and that all faces are in the same plane. There is nothing preventing one having such things, the notion of 'surtope paint', supposes that one sprays the surface of something to make more faces etc, and the denser the paint, the smaller the faces. This is a useful idea because one can convert a non-defined surface into regions of finite spherous (sphere-topology) figures, which can then be used in counts etc.
-
- One should further note that the terminology of mathematications, is like that of explorers. They describe what they pass through, with little regard for what comes later or who else is in the region. The terminology of people who quarry one small bit has no overriding context, but is very useful for that small bit. One needs someone who is prepared to cover the full scope of the field to give things robust, uniform names.--Wendy.krieger 07:46, 23 September 2007 (UTC)