We have permutations are discussed with different theorems in algebra. In this chapter I apply B system analysis to get the theorems easy and memorable. After B system analysis applied there becomes a lot of new theorems and all the theorems get a new face by summation methods. One usual theorem described with summation method and face new looks.
Table of Contents
1. Introduction
2. Preliminaries
3. Permutation Space
4. Permutation Member
5. Permutation Theorem
6. Permutation Event
7. Identified Permutation Theorem
8. Permutation Partial Space
9. Permutation Partial Event Type I
10. Permutation Partial Event Type II
11. General Permutation Theorem
12. Permutation Distribution
13. Selected Permutations
14. Selected Permutation Theorem
15. Identified Selected Permutation Theorem
16. Conclusion
Objectives and Topics
The primary objective of this work is to present an alternative, application-based analysis of permutations in algebra using the "B system" method. The research aims to simplify the understanding and memorization of algebraic theorems related to permutations, especially when summation methods are applied to express different permutation events and identified components.
- Application of the "B system" analysis for permutation theorems.
- Mathematical derivation of permutation events using summation methods.
- Analysis of permutations with identified components.
- Theoretical development of permutation distribution and related moments.
- Extension of permutation theorems to cases where components are not all distinct (Selected Permutations).
Excerpt from the Book
5. Permutation Theorem
Theorem 1: The number of permutations of N different components taken V at a time denoted by P(N/V) is
P(N/V) = N(N-1)(N-2)... (N-V+1) (4)
Using the summation method we get (4) as
P(N/V) = Σk1=1^N Σk2=1^(N-1) Σk3=1^(N-2) ..... Σkv=1^(N-V+1) C (5)
Proof: Suppose we have N distinct components and V places in a permutation to fill. We arranged the N components in a O. P. A. as first component, second component, third component and so on Nth component. The row can be designed as
1st, 2nd, 3rd, ... nth, ... Nth
And we shall call it ordered O. P. A. We fill the first place with one of the N components of the O. P. A. that begins from first component and ends in Nth component. Now k1 states an index that indicates a component of the O. P. A. taken by first place of the permutation holds the interval 1 ≤ k1 ≤ N (6)
Summary of Chapters
1. Introduction: Defines the fundamental concept of permutations as the selection of M different components where order is considered.
2. Preliminaries: Establishes the basic theorem for calculating permutations of N components taken V at a time.
3. Permutation Space: Defines the set of all possible permutation outcomes for a given experiment.
4. Permutation Member: Describes an element of a permutation space and its components.
5. Permutation Theorem: Derives the number of permutations using summation methods.
6. Permutation Event: Discusses subsets of permutation spaces with shared component positions.
7. Identified Permutation Theorem: Focuses on counting permutations where specific components are pre-identified.
8. Permutation Partial Space: Introduces permutation spaces derived from a parent combination.
9. Permutation Partial Event Type I: Analyzes events within identified combination-based permutation spaces.
10. Permutation Partial Event Type II: Continues the study of events in permutation partial spaces given identified component assemblies.
11. General Permutation Theorem: Extends permutation calculations to include limited-size subsets of particular components.
12. Permutation Distribution: Introduces the theoretical probability distribution derived from permutation spaces.
13. Selected Permutations: Explores permutation theory for assemblies containing non-distinct (alike) components.
14. Selected Permutation Theorem: Formulates the counting theorem for permutations with non-distinct components.
15. Identified Selected Permutation Theorem: Combines the concepts of identified components with non-distinct element permutations.
16. Conclusion: Summarizes the concepts of permutation and identified permutation theorems covered in the paper.
Keywords
Permutation space, permutation member, permutation event, permutation partial space, permutation partial event, general permutation theorem, permutation distribution, selected permutations, summation method, B system analysis, algebraic theorem, identified components, probability mass function, factorial moments.
Frequently Asked Questions
What is the core focus of this publication?
The work focuses on analyzing permutation theorems in algebra by applying a "B system" analysis and summation methods to make these theorems more intuitive and easier to remember.
What are the primary themes covered in the text?
The themes include permutation spaces, identified permutation components, permutation distributions, and theorems for permutations with non-distinct elements.
What is the main research objective?
The objective is to derive standard and complex permutation counting theorems using a consistent summation approach, providing clearer structured proofs.
Which scientific method is utilized?
The author utilizes algebraic summation methods (Σ) to define and count various permutation events and spaces systematically.
What content is included in the main section?
The main section establishes the definitions for permutation spaces, members, and events, moving from simple arrangements to complex scenarios like identified components and non-distinct elements.
Which keywords define this work?
Key terms include permutation space, permutation distribution, summation method, identified permutations, and selected permutations.
How is the "General Permutation Theorem" defined in this document?
The theorem calculates permutations in a space where a subset of components is drawn from a limited pool of specific elements, rather than the entire N-set.
What does the "Permutation Distribution" describe?
It describes a discrete theoretical probability distribution derived from a permutation space, utilizing the parameters N (total components), U (subset of interest), and V (components taken at a time).
What is the significance of "Selected Permutations"?
This section addresses cases where components are not all distinct, specifically handling assemblies that contain groups of identical components (alike components).
- Arbeit zitieren
- Deapon Biswas (Autor:in), General Permutation Theorem and Selected Permutations, München, GRIN Verlag, https://www.grin.com/document/1464424
