Let r be a non-negative integer. A partition δ = ( δ 1 , δ 2 , ⋯ , δ n ) of r is a sequence of non-negative integers such that | δ | = ∑ j = 1 n δ j = r , ∀ j ≥ 1 and δ j ≥ δ j + 1 . Fix δ is a partition of r, choosing an integer b greater than or equal to the number of parts of δ and defining β i = δ i + b − i , 1 ≤ i ≤ b . The set { β 1 , β 2 , ⋯ , β b } is said to be the set of β -numbers for δ , see [1] . 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).

Where every β will be represented by a bead (∎) and the rest of the sites by (−), which takes its location e-abacus diagram [2] . 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.

In this section, we will present the idea of replacing what the sites contain in the first main e-abacus diagram [3] , 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 e r -abacus diagram (Figures 1-3). For example, if δ = ( 6 , 6 , 5 , 5 , 5 , 3 , 1 , 1 ) , then

Here we note that for one case of any partition it turned into several formats of the partitions in the case of e r -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.

In fact, the important thing here is the location of ( δ 1 ) according to its presence in any row k and any column l depending on the value of e, by the following equations:

Location   of   δ 1 = δ 1 + ( ( no .   of   parts   of   δ ) − 1 ) (1)

which is exactly equal to

Location   of   δ 1 = ( k − 1 ) e + ( l − 1 ) (2)

where k is a positive integer and 1 ≤ l ≤ e .

From the above example,

The reason for the importance (Location of δ 1 ) 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 e = 2 there is no addition any (∎), while we will add (one (∎), two (∎) and one (∎)) when ( e = 3 , e = 4 and e = 5 ) 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:

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 3⁴ 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 5²

Step 4:

Now, if we take another example, =(8, 8, 8, 7, 4, 4, 2, 2, 2, 2, 1):

Location of ω 1 = 18 , and if we take e = 5, 7 and 12 respectively, then we have Table 4.

Then the value of partitions after the replacement (Figure 4 and Figure 5) are:

Step 1: ( 1 , 2 , 2 , 2 , 2 , 4 , 4 , 7 , 8 , 8 , 8 ) = ( 1 , 2 4 , 4 2 , 7 , 8 3 )

Step 2: 1¹

Step 3: 5², 7³, 8¹

Step 4: 11 if e = 5 → ( 11 , 8 , 7 3 , 5 2 , 1 )

11² if e = 7 → ( 11 2 , 8 , 7 3 , 5 2 , 1 )

11⁵ if e = 7 → ( 11 5 , 8 , 7 3 , 5 2 , 1 ) .

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 [4] [5] [6] [7] .

The author declares no conflicts of interest regarding the publication of this paper.

Mahmood, A.S. (2020) Replace the Content in e-Abacus Diagram. Open Access Library Journal, 7: e6211. https://doi.org/10.4236/oalib.1106211