e-Abacus Diagram Rows Rearranging Technology

DOI: 10.4236/oalib.1106407   PDF   HTML   XML   16 Downloads   58 Views  

Abstract

In our ordinary lives, we need to re-arrange our priorities so that we present and delay things according to the appropriateness of the circumstance we are going through. Also when we write something, after its completion we ask what if we made some adjustments to it in terms of presentation and delay. The question here is, can we use this technique to replace the rows in the e-abacus diagram, and know the representation of the new partition from the original partition?

Share and Cite:

Mahmood, A. and Al-Hussaini, A. (2020) e-Abacus Diagram Rows Rearranging Technology. Open Access Library Journal, 7, 1-5. doi: 10.4236/oalib.1106407.

1. Introduction

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 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]. For example, if we take δ = ( 6 2 , 3 4 , 2 , 1 3 ) and b = 10 then

β 1 = 15 , β 2 = 14 , β 3 = 10 , β 4 = 9 , β 5 = 8 , β 6 = 7 , β 7 = 5 , β 8 = 3 , β 9 = 2 , β 10 = 1.

Table 1. e-abacus diagram.

If we choosing e = 4 then we have Table 2.

Mahmood & Ali in [3] [4] and [5] introduced the idea of the e-abacus diagram which rotates at certain angles (90, 180, 270, 360), and it is quite clear that the new diagram is completely different in its representation from the original partition. Also, Mahmood & Sami in [6], presented the idea of changing the rows together, and there were hypotheses and rules that were carefully studied. Each rule there is a representation of the diagram that is completely different of original. In this paper, we present a very fun and easy technique for solving the dilemma that was mentioned in the above two papers, which we will learn directly about the representation of the partition after the replacement process from the original without the need for a lot of rules and relationships that appeared there.

2. Replacement Technology

We will introduce the technique of switching rows according to the following steps:

1) We switch the partition sites from small to large, so that it becomes a shape:

δ = ( δ n , δ n 1 , , δ 1 ) .

2) We put in front of each number of δ a number of (-) which is of the same value. So if two or more numbers of δ are equal, then we do not repeat the (-) mode only at the first value of them only. Now, if we come to other different δ , we put a number of (-) in front of it, taking into account that a portion of it already exists so only the difference between them will be added this time. Repeat the steps with all δ .

3) According to the chosen e, we will put brackets on what we did in the 2nd step and in it exactly inside the number of e and then repeat the process until all of what is found in the 2nd step is completed. So if the last bracket has a number equal to e then we stand, if not, we will add the difference from the value of e by -.

4) Now, any bracket we want to place in the beginning we take it as it is, noting that the bracket is either -, all numbers or a combination of the two. The first and the second have no problem, except that the second case will completely cancel its effect from the later partition representation. As for the third case, we add the number of consecutive -, so this addition is the sum of the first number that comes after the -. By repeating this process with the rest of the brackets, we always add the number of―with the ones before it to give us the representation of partition after the change.

Table 2. 4-abacus diagram for a partition δ = ( 6 2 , 3 4 , 2 , 1 3 ) .

From the above example, when δ = ( 6 2 , 3 4 , 2 , 1 3 ) , then:

1st step: δ = ( 1 3 , 2 , 3 4 , 6 2 ) = ( 1 , 1 , 1 , 2 , 3 , 3 , 3 , 3 , 6 , 6 ) .

2nd step: ( 1 , 1 , 1 , 2 , 3 , 3 , 3 , 3 , 6 , 6 ) = ( , 1 , 1 , 1 , , 2 , , 3 , 3 , 3 , 3 , , , , 6 , 6 )

3rd step: If we e = 2 , then ( { , 1 } , { 1 , 1 } , { , 2 } , { , 3 } , { 3 , 3 } , { 3 , } , { , } , { 6 , 6 } ) , and if we take e = 3 , then ( { , 1 , 1 } , { 1 , , 2 } , { , 3 , 3 } , { 3 , 3 , } , { , , 6 } , { 6 , , } ) .

4th step: When e = 2 , we have 8 brackets, if we want to consider the 8th as the 1st, 7th as to 2nd, and so on the rest of the classes then we will be in front of the following:

( { 6 , 6 } ) ( { hasnoeffect , hasnoeffect } ) = ( { 0 , 0 } ) .

( { , } ) ( { 0 , 0 } , { , } ) ,

( { 3 , } ) ( { 0 , 0 } , { , } , { 2 , } ) ,

( { 3 , 3 } ) ( { 0 , 0 } , { , } , { 2 , } , { 3 , 3 } ) ,

( { , 3 } ) ( { 0 , 0 } , { , } , { 2 , } , { 3 , 3 } , { , 4 } ) ,

( { , 2 } ) ( { 0 , 0 } , { , } , { 2 , } , { 3 , 3 } , { , 4 } , { , 5 } ) ,

( { 1 , 1 } ) ( { 0 , 0 } , { , } , { 2 , } , { 3 , 3 } , { , 4 } , { , 5 } , { 5 , 5 } ) ,

( { , 1 } ) ( { 0 , 0 } , { , } , { 2 , } , { 3 , 3 } , { , 4 } , { , 5 } , { 5 , 5 } , { , 6 } ) .

Then the new partition is ( 6 , 5 3 , 4 , 3 2 , 2 ) . If we choose e = 3 , then we have:

( { 6 , , } ) ( { 0 , , } ) ,

( { , , 6 } ) ( { 0 , , } , { , , 4 } ) ,

( { 3 , 3 , } ) ( { 0 , , } , { , , 4 } , { 4 , 4 , } ) ,

( { , 3 , 3 } ) ( { 0 , , } , { , , 4 } , { 4 , 4 , } , { , 6 , 6 } ) ,

( { 1 , , 2 } ) ( { 0 , , } , { , , 4 } , { 4 , 4 , } , { , 6 , 6 } , { 6 , , 7 } ) ,

( { , 1 , 1 } ) ( { 0 , , } , { , , 4 } , { 4 , 4 , } , { , 6 , 6 } , { 6 , , 7 } , { , 8 , 8 } )

The new partition is ( 8 2 , 7 , 6 3 , 4 3 ) .

With the same mechanism, if we want the arrangement of the brackets in the case e = 3 , to be {6}, {3}, {5}, {2}, {4}, {1} then we will be in front of the following:

Table 3. e-abacus diagram by exchange.

( { 6 , , } ) ( { 0 , , } ) ,

( { , 3 , 3 } ) ( { 0 , , } , { , 3 , 3 } ) ,

( { , , 6 } ) ( { 0 , , } , { , 3 , 3 } , { , , 5 } ) ,

( { 1 , , 2 } ) ( { 0 , , } , { , 3 , 3 } , { , , 5 } , { 5 , , 6 } ) ,

( { 3 , 3 , } ) ( { 0 , , } , { , 3 , 3 } , { , , 5 } , { 5 , , 6 } , { 6 , 6 , } ) ,

( { , 1 , 1 } ) ( { 0 , , } , { , 3 , 3 } , { , , 5 } , { 5 , , 6 } , { 6 , 6 , } , { , 8 , 8 } ) .

Therefore the new partition is ( 8 2 , 6 3 , 5 2 , 3 2 ) .

To represent this last part and to ensure the accuracy of the results that we obtained (Table 3).

It is very clear; after using the method of Table 2 the new partition is ( 8 2 , 6 3 , 5 2 , 3 2 ) .

It is natural to point out that the changes taking place here are different in style from Mahmood presented in [7], as he depended on a change in the shape of what was already present in the same site.

3. Conclusion

This technique will make an important difference for us in coding any partition that depends on its representation on the concept of the e-abacus diagram and therefore we only have to use the same method used here to find the new representation of the new partition of the original partition. Research can be completely used [8] - [14].

Acknowledgements

All thanks and appreciation to University of Mosul/College of Education for Pure Science in its great support to researchers working in it.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Mathas, A. (1999) Iwahori-Hecke Algebras and Schur Algebras of the Symmetric Group. Univ. Lecture Series, 15. https://doi.org/10.1090/ulect/015/02
[2] James, G.D. (1978) Some Combinatorial Results Involving Young Diagrams. Mathematical Proceedings of the Cambridge Philosophical Society, 83, 1-10.
https://doi.org/10.1017/S0305004100054220
[3] Mahmood, A.S. and Ali, Sh.S. (2013) Direct Rotation -Numbers. Journal of Advanced Mathematics, 5, 642-650.
[4] Mahmood, A.S. and Ali, Sh.S. (2013) Rightside-Left -Numbers. International Journal of Latest Research in Science and Technology, 2, 124-127. http://www.mnkjournal.com/ijlrst.htm
[5] Mahmood, A.S. and Ali, Sh.S. (2014) (Upside-Down o Direct Rotation) β-Numbers. American Journal of Mathematics and Statistics, 4, 58-64. http://10.5923/j.ajms.20140402.02
[6] Mahmood, A.S. and Sami, H.H. (2014) On the Intersection of Main Partition Diagrams (A) by Exchanging Odd Rows in Even Rows. Iraqi Journal of Science, 55, 1071-1079.
http://Vol55Y2014No3AP1071-1079.pdf
[7] Mahmood, A.S. (2020) Replace the Content in e-Abacus Diagram. Open Access Library Journal, 7, 1-7. https://doi.org/10.4236/oalib.1106211
[8] Mahmood, A.S. (2011) On the Intersection of Young’s Diagrams Core. Journal of Education and Science, 24, 149-157. https://doi.org/10.33899/edusj.1999.58795
[9] Mahmood, A.S., Mahmood, S.M. and Naoum, F.S. (2012) Remarks of the Intersection of Young’s Diagrams Core. Iraqi Journal of Science, 53, 156-160. http://Vol53Y2012No1P156-160.pdf
[10] 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
[11] 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
[12] 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.
https://doi.org/10.4236/oalib.1105834
[13] Shareef, R.J. and Mahmood, A.S. (2019) The Movement of Orbits and Their Effect on the Encoding of Letters in Partition Theory II. Open Access Library Journal, 7, 1-7.
https://doi.org/10.4236/oalib.1106203
[14] Sami, H.H. and Mahmood, A.S. (2020) Encoding Syriac Letters in Partition Theory Using Extended Vigenere Cipher. Eastern-European Journal of Enterprise Technologies, 1, 37-46.
https://doi.org/10.15587/1729-4061.2020.196831

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.