DocumentCode :
2743788
Title :
Enumerating the Configurations in the n-Dimensional Orthogonal Polytopes Through Pólya´s Countings and A Concise Representation
Author :
Perez-Aguila, Ricardo
Author_Institution :
Inst. Univ. de Tecnologia y Humanidades, Puebla
fYear :
2006
fDate :
6-8 Sept. 2006
Firstpage :
1
Lastpage :
4
Abstract :
This article will describe Polya´s countings as a methodology for determining the number of configurations to be present in the nD orthogonal pseudo-polytopes. Banks et al have used this methodology for counting configurations, in 1D to 4D spaces, under the context of the dual problem. We will describe a concise and simple representation for the configurations that provides the elements to reach the 5D and 6D cases and therefore to obtain their corresponding countings
Keywords :
computational geometry; graph theory; group theory; Polya´s counting; computational geometry; configuration representation; group theory; n-dimensional orthogonal pseudopolytope; Boolean functions; Computational geometry; Hypercubes; Reflection; Solid modeling; Computational Geometry; Geometrical and Topological Modeling; Group Theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Electronics Engineering, 2006 3rd International Conference on
Conference_Location :
Veracruz
Print_ISBN :
1-4244-0402-9
Electronic_ISBN :
1-4244-0403-7
Type :
conf
DOI :
10.1109/ICEEE.2006.251849
Filename :
4017934
Link To Document :
بازگشت