Let r be a non-negative integer. A partition of r is a sequence of non-negative integers such that , and . Fix is a partition of r, choosing an integer b greater than or equal to the number of parts of and defining , . The set is said to be the set of -numbers for , see  . Let e be a positive integer number greater than or equal to 2, we can represent -numbers by a diagram called e-abacus diagram (Table 1).
Table 1. e-Abacus diagram.
Where every will be represented by a bead (∎) and the rest of the sites by (−), which takes its location e-abacus diagram  . In this work, we will try to present the opposite diagram to the main diagram and note all the changes that occurred from that change. This issue is being discussed for the first time.
2. Replace the Content
In this section, we will present the idea of replacing what the sites contain in the first main e-abacus diagram  , with the opposite of what it contains of a (∎) or (−) and then represent the new diagram to know the value of partition after the exchange and denoted by -abacus diagram (Figures 1-3). For example, if , then
Figure 1. 2r-abacus diagram = (6, 3, 3, 2, 2).
Figure 2. 3r-abacus diagram = (8, 6, 3, 3, 2, 2).
Figure 3. 4r-abacus diagram = (8, 8, 6, 3, 3, 2, 2).
Here we note that for one case of any partition it turned into several formats of the partitions in the case of -abacus diagram and perhaps to other formats in the case of different e, as if it becomes a new coding completely difficult (detecting) easily. We will try hard to explain this phenomenon and clarify its implications.
3. Explanation of This Phenomenon
In fact, the important thing here is the location of ( ) according to its presence in any row k and any column l depending on the value of e, by the following equations:
which is exactly equal to
where k is a positive integer and .
From the above example,
The reason for the importance (Location of ) is to know when we stand in the representation of the original diagram as well as in the new diagram after the replacement.
This is on the one hand, on the other hand if any (∎) site is in the last place at l, specifically in the last row k, then this means that this will turn into a (-) after the replacement. But if you are not in the last column l, then the sites that follow that place will turn into beads after the replacement, then the number of sites available to us within the last row.
Returning to Table 2, in the case there is no addition any (∎), while we will add (one (∎), two (∎) and one (∎)) when ( , and ) respectively after the replacement. We have to fully understand the behavior of this type, depending on the value of e, the representation mechanism after the exchange and for this we will take the following example:
The question now is, can we know the value of partition immediately after the replacement of the main partition? The answer is YES, but we have to use e and l as follows:
In order to facilitate the solution, we will take the following steps:
Table 2. The location of .
Table 3. The mechanism.
1) We write the main partition from small to large.
2) We take the first value from first step and note how many times it will give us the origin of the swapped charge raised to the exponent, which is the difference between it and the value that follows and which is not equal at all.
3) We repeat the second step on the new different value and know its number with the addition of it (to the substitution value) and always up to the exponent (which is the difference between this value and the one that follows it and is not equal to the amount) up to the last value where in this case we have to go to step 4.
4) When l = e, we stand at the third step, and if l < e then we repeat the third step and raise it to exponent, which is how much is the difference between e and l.
To illustrate these four steps, we will refer to the example in Table 3:
Step 1: (1, 1, 1, 5, 5, 7)
Step 2: The number of (1, 1, 1) equal to 3, uploaded to 4; (5 ? 1 = 4), then 34 or (3, 3, 3, 3)
Step 3: The number of (5, 5) equal to 2 (plus to 3 of step 2, then 5), uploaded to 2; (7 − 5 = 2), then (5, 5) or 52
Now, if we take another example, =(8, 8, 8, 7, 4, 4, 2, 2, 2, 2, 1):
Location of , and if we take e = 5, 7 and 12 respectively, then we have Table 4.
Step 2: 11
Table 4. The mechanism of .
Step 3: 52, 73, 81
Step 4: 11 if
115 if .
Figure 4. The replacement of if .
Figure 5. The replacement of if .
1) Through one partition, we will have a completely unfinished number of replaced partition, which will make it difficult to fully reveal the origin of the partition.
2) A very new style that was not previously discussed in coding the partition.
3) No matter how small the code is, the new encoding will make it difficult to find the original.
4) It is possible to apply this method to the types that have already been talked about, see     .
 Mathas, A. (1999) Iwahori-Hecke Algebras and Schur Algebras of the Symmetric Group. University Lecture Series, 15, 188 p. http://doi.org/10.1090/ulect/015/02
 James, G. (1978) Some Combinatorial Results Involving Young Diagrams. Mathematical Proceedings of the Cambridge Philosophical Society, 83, 1-10.
 Mahmood, A.S. (2011) On the Intersection of Young’s Diagrams Core. Journal of Education and Science, 24, 149-157. http://doi.org/10.33899/edusj.1999.58795
 Mahmood, A.B. and Mahmood, A.S. (2019) Secret-Word by E-Abacus Diagram I. Iraqi Journal of Science, 60, 638-646. http://www.researchgate.net/publication/332058738
 Mahmood, A.B. and Mahmood, A.S. (2019) Secret-Text by E-Abacus Diagram II. Iraqi Journal of Science, 60, 840-846. http://www.researchgate.net/publication/332786557
 Shareef, R.J. and Mahmood, A.S. (2019) The Movement of Orbits and Their Effect on the Encoding of Letters in Partition Theory. Open Access Library Journal, 6, 1-7.