The characterization of the facial structure of polyhedra has a long tradition in combinatorial geometry. Steinitz & Rademacher's (1934) fundamental theorem asserts that Theorem of Steinitz. Every ?nite 3-connected planar graph is isomorphic to the edge gr
researchpapers
ActaCrystallographicaSectionA
FoundationsofCrystallography
ISSN0108-7673
Ontheenumerationofthesimple3-polyhedra
PeterEngel
LaboratoryofCrystallography,UniversityofBerne,Freiestrasse3,CH-3012Berne,Switzerland.Correspondencee-mail:peter.engel@krist.unibe.ch
Received17June2002Accepted4October2002
#2003InternationalUnionofCrystallographyPrintedinGreatBritain±allrightsreserved
Itwillbeprovedthatthesimple3-polyhedrawithf+1facetsareobtainedfromallsimple3-polyhedrawithffacetsby2-facesplits.Thenumbersofcombinatorialtypesofsimple3-polyhedrawithupto15facetsarestatedwithrespecttotheirautomorphismgrouporder.
1.Basicdefinitions
Thecharacterizationofthefacialstructureofpolyhedrahasalongtraditionincombinatorialgeometry.Steinitz&Rade-macher's(1934)fundamentaltheoremassertsthat
TheoremofSteinitz.Every®nite3-connectedplanargraphisisomorphictotheedgegraphofa3-polyhedron.
Undera3-polyhedronP,weunderstandanyboundednon-degenerateregionofEuclideanspaceE3whichisobtainedbyintersectinga®nitenumberfofclosedhalfspacesHi,
P
f i 1
0-face&1-face&2-face&PX
Givenanysuch¯ag,wecanconsecutivelynumberallk-faces
ofv P inauniqueway.Next,wesetupthepolyhedronschemebywritingdownforeachfacetintheirconsecutiveorderthenumbersofallitssubordinatedverticesinincreasingorder.Thispolyhedronschemedependsonlyonthechoseninitial¯ag.Wewritethepolyhedronschemesforeachpossible¯ag,andputthemintoclassesofidenticalschemes.Theclassesarelexicographicallyordered,andarepresentativeofthe®rstclassistakenastheuni®edpolyhedronschemeofP.Eachclasscontainsthesamenumberofidenticalschemeswhichequalstheorderofthecombinatorialautomorphismgroupofv P .Theuni®edpolyhedronschemegivesauniquechar-acterizationofv P and,hence,ofitscombinatorialtype.Ontheotherhand,wecangeneratev P fromitspolyhedronscheme.
ItwasprovedbyMani(1971)thatTheoremofMani.Foreach3-polyhedronPthereexistsarealizationPHsuchthat
comb
(i)PH9P;
(ii)thepointgroupofPHisisomorphoustothecombina-torialautomorphismgroupofv P .
A3-polyhedronPiscalledsimple,ifineveryvertexofitexactlythreefacetsmeet,andthusineachvertexthreeedgesmeet.Byvalenceofthevertex,wedenotethenumberofedgesmeetinginavertex.Inwhatfollows,wewillmainlyconsidersimple3-polyhedra.Giventhenumberfoffacetsofasimple3-polyhedron,thenumbersvandeofverticesandedges,respectively,arereadilyobtainedfromEuler'srelation.
v 2fÀ4Ye 3fÀ6X 2 Letfibethenumberof2-facesofPthathavesubordinated
eiedges,i 1YFFFYr.The2-subordinationsymbolisde®nedby
3 e1fe2fFFFerfrY
1
2
HiX
1
ThehalfspacesHiareconvex,hencePisconvextoo.We
denotebyvertices,edgesandfacetsthe0-,1-and2-facesofP,respectively.The3-faceisPitself.
Amongthek-facesofP,0 k 3,thereexistsapartialorderingwithrespecttotheinclusionoperation.Thek-faces,togetherwiththeemptyset,determinebyinclusionthefacelatticev P thatis,foranytwofacesFandFHofv P ,theleastupperboundisgivenbythek-faceF 'F FHhavingleastk.Thegreatestlowerboundisgivenbythel-faceF F FH.The3-polyhedronhavingleastk-facesisthe3-simplex.ItÀ4Á
consistsofk 1k-faces,0 k 3.
TwopolyhedraPandPHarecalledcombinatorially
comb
equivalent,PH9P,andbelongtothesamecombinatorialtype,ifthereexistsacombinatorialisomorphism Xv P 3v PH .AnyrealizationofapolyhedronthatiscombinatorialequivalenttoPiscalledarepresentativeofitscombinatorialtype.
Ifthecombinatorialstructureofa3-polyhedronPisconsideredonly,ahalf-spacecutappliedtoPwhichresultsinPHcanberepresentedbyatransformation(ofthecorre-spondingfacelatticev PH ( v P .Wedenotesuchatransformationasacombinatorialcut.
Inordertoclassifythecombinatorialtypes,weusetheuni®edpolyhedronschemewhichwasintroducedbyEngel(1981),andthengeneralized(Engel,1991a,b).A¯agisde®nedtobeasubseriesofsuccessivelysubordinatedk-facesofv P ,
withe1`e2`FFF`er.Itholdsthat
r f fiX
i 1
14
PeterEngel
Simple3-polyhedraActaCryst.(2003).A59,14±17
A Simple Discussion on the Supply and Demand of Water Resources in the Western Region of China_专业资料。维普资讯 http://www.cqvip.com ASmpeDiuso nteSpl...
Conjectures on the Enumeration of Tableaux of Bounded Height(1) Fran?ois Bergeron...cient method, we looked for simple P -recurrences for these numbers. ...
of the three-state Potts antiferromagnet on the simple-cubic lattice belongs...model have been studied by exact enumeration[22] and series expansion[23]....
ATR-FTIR and XPS study on the structure of complexes formed upon the adsorption of simple organ_专业资料。维普资讯 http://www.cqvip.com Avibeoniea all ...
School of Engineering Technical Report TR-2007-001 University of California, Merced - February 2007 A Simple Experiment on the E?ect of Biasing Sampling ...
A Simple Toy Example of a Distributed System On the Design of a Connecting Switch In this paper the development life-cycle of a design method for distr...
Comment on ``A simple expression for the terms in the Baker-Campbell-Hausdorff series'' Comment on ``A simple expression for the terms in the Baker-...
1. Introduction Let g be a complex simple Lie ...results of [R1] and [R2] on ad-nilpotent .... To obtain the enumeration of ad-nilpotent ...
暂无评价 14页 免费 Enumeration in convex ge... 暂无评价 16页 免费喜欢...we introduce the Banzhaf power indices for simple games on convex geometries...
The C preprocessor permits you to define simple ...on value of expression #ifdef // conditional ...Enumeration: – Names in different enumerations ...
热门文档