Factorial multiplication of combinations between elements is obtained through the product of all positive integers from 1 to n, n. being the number of elements intervening in the combinatory.
This is represented by n!, as a short hand for 1.2.3…n.
Obviously, the number of possible combinations among elements grows in an accelerated way in accordance to the number of elements in the combinatory.
This is however an abstract model; it is implicitly admitted that there are no restriction of any kind for some combinations.
In practical situations such restrictions appear promptly because for ex. of environmental limitations that block or brake the multiplication of the elements, or through saturation of their relational network.
- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented
To cite this page, please use the following information:
Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]
We thank the following partners for making the open access of this volume possible: