Abstract
Pansymmetry is the abstract of symmetry, stability and other concepts in physics and so on. Fixed pansystems theorems portray a typical pansymmetry of systemic structure. The present paper complements and extends the work in [1]–[3] concerned in fixed pansystems theorems. It gives in finite case the structural character of fixed subsets; the criterion of existence of the least fixed subset, and the numbering formula of fixed subsets and minimal fixed subsets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wu Xui-mou, Pansystems methodology: Concepts, theorems and applications (V)–(VII), Science Exploration, 4 (1983), 1, 3 (1984).
Wu Xui-mou, Fixed pansystems theorems and pansystems catestrophe analysis of panweighted network, Research and Review of Mathematics, 1 (1984).
Gao Long-ying and Wang Shu-ji, Pansymmetry and fixed pansystems theorem, Applied Mathematics and Mechanics, Vol. 5, No. 5 (1984).
Scott, Dana, Lectures or a Mathematical Theory of Computation, Oxford University Press (1981).
Stoy, Joseph E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press (1977).
Tennent, R.D., Principles of Programming Languages, PHJ Press (1981).
Author information
Authors and Affiliations
Additional information
Communicated by W Xue-mou
Rights and permissions
About this article
Cite this article
Gui-hua, L. The description of the characteristics of the structure and the quantity in fixed pansystems theorems. Appl Math Mech 5, 1867–1874 (1984). https://doi.org/10.1007/BF01904931
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01904931