Minimum Zero-Centre-Pandiagonal Composite Type II (a) Magic Squares over Multi Set of Integer Numbers as a Semiring

Similar documents
Tetrabonacci Subgroup of the Symmetric Group over the Magic Squares Semigroup

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

GLOSSARY. a * (b * c) = (a * b) * c. A property of operations. An operation * is called associative if:

Three of these grids share a property that the other three do not. Can you find such a property? + mod

Magic Squares. Lia Malato Leite Victoria Jacquemin Noemie Boillot

Permutation Groups. Definition and Notation

NEGATIVE FOUR CORNER MAGIC SQUARES OF ORDER SIX WITH a BETWEEN 1 AND 5

Mathematics of Magic Squares and Sudoku

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.

EXTENSION. Magic Sum Formula If a magic square of order n has entries 1, 2, 3,, n 2, then the magic sum MS is given by the formula

28,800 Extremely Magic 5 5 Squares Arthur Holshouser. Harold Reiter.

N-Queens Problem. Latin Squares Duncan Prince, Tamara Gomez February

Graphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA

The Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board

Latin Squares for Elementary and Middle Grades

Week 1. 1 What Is Combinatorics?

Digital Logic Circuits

Three Pile Nim with Move Blocking. Arthur Holshouser. Harold Reiter.

KenKen Strategies. Solution: To answer this, build the 6 6 table of values of the form ab 2 with a {1, 2, 3, 4, 5, 6}

Some Fine Combinatorics

Lecture 6: Latin Squares and the n-queens Problem

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

The pairing strategies of the 9-in-a-row game

Constructing pandiagonal magic squares of arbitrarily large size

The Place of Group Theory in Decision-Making in Organizational Management A case of 16- Puzzle

A Group-theoretic Approach to Human Solving Strategies in Sudoku

THE SIGN OF A PERMUTATION

I.M.O. Winter Training Camp 2008: Invariants and Monovariants

Staircase Rook Polynomials and Cayley s Game of Mousetrap

Permutation Generation Method on Evaluating Determinant of Matrices

Dyck paths, standard Young tableaux, and pattern avoiding permutations

LECTURE 8: DETERMINANTS AND PERMUTATIONS

Solutions to Exercises Chapter 6: Latin squares and SDRs

Lecture 3 Presentations and more Great Groups

Mistilings with Dominoes

Crossing Game Strategies

1.6 Congruence Modulo m

Another Form of Matrix Nim

A theorem on the cores of partitions

Permutations. = f 1 f = I A

completing Magic Squares

Lecture 2.3: Symmetric and alternating groups

Figurate Numbers. by George Jelliss June 2008 with additions November 2008

The Tilings of Deficient Squares by Ribbon L-Tetrominoes Are Diagonally Cracked

Senior Math Circles February 10, 2010 Game Theory II

PUTNAM PROBLEMS FINITE MATHEMATICS, COMBINATORICS

PART 2 VARIA 1 TEAM FRANCE WSC minutes 750 points

New designs from Africa

FOR THE CONSTRUCTION OF SAMAGARBHA AND VIṢAMA MAGIC SQUARES

MAS336 Computational Problem Solving. Problem 3: Eight Queens

MAGIC SQUARES WITH ADDITIONAL PROPERTIES

5 Symmetric and alternating groups

Introduction to Combinatorial Mathematics

Food for Thought. Robert Won

General Properties of Strongly Magic Squares

X = {1, 2,...,n} n 1f 2f 3f... nf

An Intuitive Approach to Groups

European Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap

18.204: CHIP FIRING GAMES

Shuffling with ordered cards

Math236 Discrete Maths with Applications

Analysis on the Properties of a Permutation Group

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel

FREDRIK TUFVESSON ELECTRICAL AND INFORMATION TECHNOLOGY

arxiv: v2 [math.ho] 23 Aug 2018

You ve seen them played in coffee shops, on planes, and

Weighted Polya Theorem. Solitaire

Combinatorial Proofs

Pattern Avoidance in Unimodal and V-unimodal Permutations

A Complete Characterization of Maximal Symmetric Difference-Free families on {1, n}.

12. 6 jokes are minimal.

A variation on the game SET

THE ASSOCIATION OF MATHEMATICS TEACHERS OF NEW JERSEY 2018 ANNUAL WINTER CONFERENCE FOSTERING GROWTH MINDSETS IN EVERY MATH CLASSROOM

Introduction to Modular Arithmetic

Slicing a Puzzle and Finding the Hidden Pieces

37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game

Aesthetically Pleasing Azulejo Patterns

PD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction

Q(A) - Balance Super Edge Magic Graphs Results

Edge-disjoint tree representation of three tree degree sequences

Sequences. like 1, 2, 3, 4 while you are doing a dance or movement? Have you ever group things into

Chapter 6.1. Cycles in Permutations

AL-JABAR. Concepts. A Mathematical Game of Strategy. Robert P. Schneider and Cyrus Hettle University of Kentucky

Axiom A-1: To every angle there corresponds a unique, real number, 0 < < 180.

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA

Taking Sudoku Seriously

Reflections on the N + k Queens Problem

The patterns considered here are black and white and represented by a rectangular grid of cells. Here is a typical pattern: [Redundant]

ON 4-DIMENSIONAL CUBE AND SUDOKU

The 99th Fibonacci Identity

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

The Unreasonably Beautiful World of Numbers

An Optimal Algorithm for a Strategy Game

The mathematics of the flip and horseshoe shuffles

Corners in Tree Like Tableaux

Mathematical Investigation of Games of "Take-Away"

Symmetric-key encryption scheme based on the strong generating sets of permutation groups

Extending the Sierpinski Property to all Cases in the Cups and Stones Counting Problem by Numbering the Stones

Chapter 4 Number Theory

Sec 5.1 The Basics of Counting

Transcription:

Minimum Zero-Centre-Pandiagonal Composite Type II (a) Magic Squares over Multi Set of Integer Numbers as a Semiring Babayo A.M. 1, Moharram Ali Khan 2 1. Department of Mathematics and Computer Science, Faculty of Science, Federal University Kashere, P.M.B.0182, Gombe State, Nigeria. 2. Department of Mathematics, Faculty of Natural Science, Umaru Musa Yar aduwa University Katsina, Katsina State, Nigeria. ABSTRACT This pioneer work explicates that the set of the Minimum Zero-Centre-Pandiagonal Composite Type II (a) Loub Magic Squares over Multi Set of Integer Numbers (as we denote it) forms an additive abelian group if equipped with the matrix binary operation of addition (as we denote it) and if it is enclosed with the integer number operation of multiplication (as we denote it), it forms a multiplicative semigroup with identity. That is, forms a semiring for it satisfies all the axioms of a semiring. Mathematics Subject Classification: 12-xx Keywords: Matrix Binary Operation, Integer Numbers Operation, Zero-Centre-Pandiagonal, Composite, Loub Magic Squares, Multi Set of Integer Numbers, Semiring 1. INTRODUCTION Magic Square has been investigated over 3886 years. Mathematicians introduced it long time before astronomers picked up interest in it. Magic Square is lost in mathematics and is attributed to astronomers for many centuries. Recently, mathematicians tend to bring it back to mathematics again arguably after the introduction of Ring Theory. The oldest magic square recorded and originated in China is the Lo Shu Magic Square. De La Loub, a French diplomat, designed a procedure of constructing the Lo Shu Magic Square. We term all the Lo Shu Magic Squares constructed with the procedure as Loub Magic Squares. By Zero-Centre-Pandiagonal Composite Type II (a) Loub Magic Squares over Multi Set of Integer Numbers, we understand the set of magic squares formed by the De La Loub Procedure of repeating- pattern- sequence such that each of its cell is a Loub Magic Square of Type II(a) and such that the diagonal magic squares across the face-centre magic square contain only zero entries. We showcased that the Minimum Zero-Centre-Pandiagonal Composite Type II (a) Loub Magic Squares over Multi Set of Integer Numbers (as we denote it) forms an additive abelian group if equipped with the matrix binary operation of addition (as we denote it) and if it is enclosed with the integer number operation of multiplication (as we denote it), it forms a multiplicative semigroup with identity. satisfies the distributivity of over from either sides and the neutral element of is absorbing. Arbitrarily, Minimum Zero-Centre-Pandiagonal Composite Type II (a) Loub Magic Squares over Multi Set of Integer Numbers is considered not squares such that to economize space, and not, the triviality, for it is isomorphic to the aforementioned underlining multi set. ISSN: 2231-5373 http://www.ijmttjournal.org Page 25

The sequence result; but presenting both the two is a babyish tautology. rather than is considered, though the later will also give an analogous 2. PRELIMINARIES Definition 2,1. A multi set is a set in which repetition of elements is relevant/important. For example, for their Loub Magic Squares are not isomorphic. Definition 2.2. A Composite Loub Magic Square is a magic square such that each of its cell (grid) is a Loub Magic Square. See also [1]. Definition 2.3. Main Row or Column is the column or row of the Loub Magic Squares containing the first term and the last term of the arithmetic sequence in the square. Definition 2.4. A Loub Magic Square of type I is a magic square of arithmetic sequence entries such that the entries along the main column or row have a common difference and the main column or row is the central column or central row respectively. 2.5 Loub Procedure (NE-W-S or NW-E-S, the cardinal points). Consider an empty square of grids (or cells). Start, from the central column or row at a position where is the greater integer number less than or equal to, with the number 1. The fundamental movement for filling the square is diagonally up, right (clock wise or NE or SE) or up left (anti clock wise or NW or SW) and one step at a time. If a filled cell (grid) is encountered, then the next consecutive number moves vertically down ward one square instead. Continue in this fashion until when a move would leave the square, it moves due N or E or W or S (depending on the position of the first term of the sequence) to the last row or first row or first column or last column. See also [2] for such a procedure. Definition 2.6. Loub Magic Squares of type II are magic squares constructed with Loub Procedure with repeating pattern - sequence. Remark 2.7. If we use a repeating pattern sequence a, a, a,... n times, b, b, b,...n times, c, c, c,... n times,... n number; we get Type II(a) Loub Magic Square and if instead we use a,b,c,... n number, a, b, c,... n number,... n times; we changed the orientation of the diagonal and we get the Type II(b) Loub Magic Square. 2.8. Semigroup A non empty set S equipped with an operation * is known as a semigroup if the following properties are satisfied. i. S is closed with respect to *.i.e., ii. is associative in S. i.e., ISSN: 2231-5373 http://www.ijmttjournal.org Page 26

If in addition to the axioms above, the following axiom is satisfied, we call a semigroup with identity where is a denotation of a semigroup. iii. For the definition of semigroup, see also [3]. 2.9.Abelian Group If in addition to the axioms above (2.8), the following axioms are satisfied, we call iv. ; and v.. an abelian group. 2.10. Semiring [4] A semiring is an algebraic structure, consisting of a nonempty set R on which we have two operations, addition and multiplication such that the following conditions hold: i. Addition is associative and commutative and has a neutral element. That is to say, and for all and there exists a special element of R, usually denoted by 0, such that for all. It is very easy to prove that this element is unique. ii. Multiplication is associative and has a neutral element. That is to say, for all and there exists a special element of R, usually denoted by 1, such that for all. It is very easy to prove that this element too is unique. In order to avoid trivial cases, we will always assume that, thus insuring that R has at least two distinct elements. iii. Multiplication distributes over addition from either side. That is to say, and for all iv. The neutral element with respect to addition is multiplicatively absorbing. That is to say, for all. 3. MINIMUM ZERO-CENTRE-PANDIAGONAL COMPOSITE TYPE II (A) LOUBERE MAGIC SQUARES OVER MULTI SET OF INTEGER NUMBERS AS A SEMIRING Let the set of the Minimum Zero-Centre-Pandiagonal Composite Type II (a) Loub Magic Squares over Multi Set of Integer Numbers be denoted by, let the matrix binary operation of addition be denoted by, and let the integer number operation of multiplication be denoted by. Then, we present the following theorems: Theorem 3.1. forms an additive abelian group. Proof. Arbitrarily considering (a denotation of the aforementioned squares of ) we define as follows: Let where ISSN: 2231-5373 http://www.ijmttjournal.org Page 27

. Then: i. is closed with respect to : From the above definition, if, then. This is more vivid by letting (say). ii. is associative: For whence where iii. The identity element 0 is. ISSN: 2231-5373 http://www.ijmttjournal.org Page 28

iv. Given, there exists an inverse of it, Y express as such that. v. is commutative: whence the matrix binary operation of addition over set of Thus, integer numbers is commutative (inheritance). forms an additive abelian group. Theorem 3.2. forms a multiplicative semigroup with identity. Proof. Let. We define. Then ISSN: 2231-5373 http://www.ijmttjournal.org Page 29

i. is closed with respect to For from the above definition. This is vivid by intimate look at the pattern of elements in F. ii. Associativity: is associative for because. iii. The identity element is Thus, forms a multiplicative semigroup with identity. Remark 3.3. For all and The neutral element with respect to addition is multiplicatively absorbing. That is to say, whence for all Theorem 3.4. forms a semiring. Proof. This follows immediately from Theorem 3.1, Theorem 3.2 and Remark 3.3 above. 4. CONCLUSION Every Minimum Zero-Centre-Pandiagonal Composite Type II (a) Loub Magic Squares under discussion in this work has about 4 miscellany effects of rotations and/or reflections. Considering 1 out of the 4 effects is arbitrary. Although the Magic Squares presented here are not the basic (obvious) ones, yet they are Pandiagonal Loub with unique magic sums and products. We recommend that if you are apt in searching for an example of any algebraic structures be it semigroup (Fibonacci), group (Symmetric), semiring (the one we presented), field (Loub ), vector space (Magic Squares in general) or not enter Loub Magic Squares, you will find one. ISSN: 2231-5373 http://www.ijmttjournal.org Page 30

REFERENCES International Journal of Mathematics Trends and Technology Volume 17 Number 1 Jan 2015 [1] Maya Ahmed, Algebraic Combinatorics of Magic Squares, A Doctor of Philosophy Dissertation, University of California, Davis, pp. 85, 2004. [2] Gan Yee Siang, Fon Wan Heng, Nor Haniza Sarmin, Properties and Solutions of Magic Squares, Menemui Matematik (Discovering Mathematics), vol. 34, pp. 69, 2012. [3]John M. Howie, Fundamentals of Semigroup Theory, Oxford University Press, New York, United States, vol. 1, pp.1, 2003. [4]Jonathan S.Golan, Some Recent Applications of Semiring Theory, International Conference on Algebra in Memory, Kostia Beidar, pp1-2, 2008. ISSN: 2231-5373 http://www.ijmttjournal.org Page 31