Permutation Generation Method on Evaluating Determinant of Matrices

Size: px
Start display at page:

Download "Permutation Generation Method on Evaluating Determinant of Matrices"

Transcription

1 Article International Journal of Modern Mathematical Sciences, 2013, 7(1): International Journal of Modern Mathematical Sciences Journal homepage: ISSN: X Florida, USA Permutation Generation Method on Evaluating Determinant of Matrices Haslinda Ibrahim *, Lugean M. Zake, Zurni Omar School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, Sintok Kedah, Malaysia *Author to whom correspondence should be addressed; Tel.: ; Fax: Article history: Received 26 February 2013, Received in revised form 5 June 2013, Accepted 6 June 2013, Published 7 June Abstract: This paper presents a new method for finding determinant for any size of matrices. The fundamental feature of this algorithm is that it uses the idea of permutation generation. A novel combinatorics approach of generating permutation based on starter sets is demonstrated. This permutation algorithm will be a basis to develop a method to calculate determinant. We provide a numerical example for a matrix of size 4 x 4 to illustrate the algorithm. Eventually, general framework for evaluating determinant via this combinatorics approach will be presented. Keywords: Permutation, determinant, starter set. Mathematics Subject Classification (2010): 05A05, 15B35, 15B36 1. Introduction The study of determinants has a long history and appears to be essential in some geometric and algebraic computations. There are various alternative methods to compute determinant of matrices [2,3,7,9,12,13]. These methods can be classified into two categories namely direct method and nondirect methods. In a direct method, a specific mathematical formula is used to obtain determinant of matrices without converting the original matrix into other matrix forms. Examples of direct method are

2 13 cross multiplication, cofactor expansion, condensation method and permutation. Whilst for non-direct methods the matrix is factorized into some different forms. An example of non-direct method is the Gauss elimination [10]. Furthermore another method to find the determinant of matrices is using combinatorial approach, namely permutation algorithms. The algorithm of permutation obtains the determinant of matrices from its definition by generating all the permutations and copying the entries according to each permutation. Each permutation can also be used to provide a sign of the product. Furthermore, the execution time and the complexity of the entire algorithm for determinant of matrices can be reduced by employing permutation. Hence, permutation method can be considered the most favourable algorithms among other algorithms for determinants of matrices [7,8]. Based on the advantages of permutation method over the other methods in determining determinant, this combinatorial approach will be employed in calculating determinant. Thus, this paper will provide the appropriate permutation method to be the basis in evaluating determinant. General framework for this new algorithm will be developed. A numerical example of a 4 x 4 matrix will be used to illustrate the algorithm. 2. Combinatorial Approach in Generating Permutation Permutation is different arrangements that can be made with a given number of things by taking some or all of them at a time. In general, considerable work has already been done on algorithms listing distinct n! permutations [1,6,12]. In this section we provide algorithm for generating permutation based on starter set [5]. This algorithm will be the catalyst to develop new algorithm in finding determinant Generating Permutation by Using Starter This section provides algorithm for generating all permutations by using combinatorial approach [5]. Notably, this new algorithm for listing all permutations for n elements was developed based on distinct starter sets. Hence, once the starter sets are obtained, each starter set is then cycled to obtain the first half of the distinct permutations. The complete list of permutations is achieved by reversing the order of the first half of the permutation. This algorithm has advantages over the other algorithms due to its simplicity and ease of use [5]. Therefore this algorithm is employed in this study to construct new algorithm for determinant of matrices. The followings definitions and theorems are necessary for developing a new algorithm for evaluating determinant [5]. Definition 2.1. A starter set is a set that is used as a basis to enumerate other permutations.

3 14 Definition 2.2. A reversed (inverse) set is a set that is produced by reversing the order of permutation set. Definition 2.3. An equivalence starter set is a set that can produce the same permutation from any other starter set. Theorem 2.4. There exist starter sets for each n elements for listing all n! permutations. Theorem 2.5. There exist n cycles for each starter sets of n elements. Theorem 2.6. There exists n! permutations from starter sets. We provide a numerical example for listing 4! distinct permutations. Here are the following steps: Step 1: Fix one element from the integers (1, 2, 3,4), for example 1, we have the following starter sets permutation: (1, 2, 3, 4), (1, 2, 4, 3), (1, 3, 2, 4), (1, 3, 4, 2), (1, 4, 2, 3), (1, 4, 3, 2) Step2: Find all equivalent starters sets permutations and starter sets in the following: (1, 2, 3, 4) (1, 4, 3, 2) (1, 2, 4, 3) (1, 3, 4, 2) (1, 3, 2, 4) (1, 4, 2, 3) Step 3: Delete the equivalence starter sets permutation, we produce the following: (1, 2, 3, 4) (1, 2, 4, 3) (1, 3, 2, 4) Step 4: Generate all permutations from these starters set {(1, 2, 3, 4), (1, 2, 4, 3), (1, 3, 2, 4)}. All permutations are generated cyclically for every permutation as the following: (1, 2, 3, 4), (2, 3, 4, 1), (3, 4, 1, 2), (4, 1, 2, 3), (1, 2, 4, 3), (2, 4, 3, 1), (4, 3, 1, 2), (3, 1, 2, 4), (1, 3, 2, 4), (3, 2, 4, 1), (2, 4, 1, 3), (4, 1, 3, 2). Step 5: Find the inverses (reverse) of the above permutations,

4 15 (4, 3, 2, 1), (1, 4, 3, 2), (2, 1, 4, 3), (3, 2, 1, 4), (3, 4, 2, 1), (1, 3, 4, 2), (2, 1, 3, 4), (4, 2, 1, 3), (4, 2, 3, 1), (1, 4, 2, 3), (3, 1, 4, 2), (2, 3, 1, 4). The general algorithm can be found in [5]. This algorithm will be a basis to generate starter sets and its application in calculating the determinant for n n matrices. 3. A New Algorithm for Evaluating Determinant This section presents results for the algorithm development. Then a new algorithm for finding determinant will be developed. In addition, a proof for the new algorithm for determinant of matrices will be presented. Definition 3.1. Let be the inverse permutation, then the sign of, denoted by sign is defined by sign( 1 ) ( 1) 1-1 number of inversion pair sin 1-1 if the number of inversion in is even if the number of inversion in -1 is odd Moreover, we call an even permutation if the sign = 1, and we call an odd permutation if the sign = 1. Definition 3.2. Let be the permutation, Then the sub-determinantis a calculation by summation diagonal with adding sign and inverse diagonal with adding sign for every sub matrices of permutations. Definition 3.3. Let be the permutation, then the equivalent permutation is inverse of permutation after fixing the first element of permutation. Before explaining the new algorithm for determinant, we present the following proposition, which will be used in developing the new algorithm for determinant. Proposition3.4. Let P be a cycle permutation, where P = ( n 1n), and U= (1 n n ), then P U. Proof. P = ( n 1 n) (1) ( n 1 n) P is cycle permutation

5 16 (2 3) (3 4) (4 5) (5 6) (n 1 n) (n 1 n) (5 6) (4 5) (3 4) (2 3), (n n 1) (6 5) (5 4) (4 3) (3 2). (n n ) = (1) (n n ) = (1 n n ) U. Now, we provide the numerical example to calculate determinant using permutation based on starter set. The numerical example is given to illustrate steps of this new algorithm for a matrix of size 4 4. Given a matrix A The determinant of A with the new algorithm can be obtained by generating all permutations based on starter set. Recall we have three starter set: (1, 2, 3, 4), (1, 3, 4, 2) and (1, 4, 2, 3). Then use each starter set and permutation for these starters to evaluate determinant. Figure 1 provides sub matrices from first starter set (1, 2, 3, 4). Then, use these permutations to generate sub matrices from original matrix by exchanging columns of matrix as the followings: Figure 1. Calculating sub-determinants from (1, 2, 3, 4) starter set From this starter set we produce the following result: (-72+18) + (-21+75) + (125-28) + (24 120) = 1

6 17 Figure 2. Calculating sub-determinants from (1, 3, 4, 2) starter set From starter set (1, 3, 4, 2) we produce the following result: (15-105) + ( ) + ( ) + (84 15) = -51 Figure 3. Calculating sub-determinants from (1, 4, 2, 3) starter set Finally from starter set (1, 4, 2,3) we have the following result: ( ) + (36-36) + (42 30) + ( ) = 32 Now we gather all the sub determinants of the sub matrices with each other and we add sign of permutations and sign of inverses permutation to find the determinant for original matrix, as show below:

7 18 det(a) = (( 72+18) ( 21+75) + (125 28) (24 120)) + ((15 105) ( )+ ( ) (84 15)) + (( 60+60) (36 36) + (42 30) ( 50+70)) = 18. Now, we are ready to provide the general framework of this new algorithm to evaluate determinant. Suppose for any n n matrices, we can find determinant by using the following steps. Step 1: Determine starter sets for n elements. Step 2: Use every column of permutations from step 1 to generate all sub matrices [ ] [ ] [ ] [ ] Step 3: Find the sub determinant for the sub matrices which are produced in step 2 by using the following: a. Multiply diagonal elements and multiply inverse diagonal elements for every sub matrix produced from step 4, such as... [ ] [ a 1n. a n1 a 11 a 22 a 33 a nn a 11 a n2 a 12 a 23 a 34 a n1 a 1(n-1) a nn a 1n a 21 a 32 a n(n-1) ]

8 19 [ ] [ a 1n a n1 a 11 a 23 a 32 a nn a 11 a n3 a 13 a 22 a 34 a n1 a 1(n-1) a nn a 1n a 21 a 33 a n(n-1) ] for all sub matrices. b. Find the sign for permutation, and add to the diagonal elements. So the sign permutation is used with multiplication of diagonal elements, and the sign for inverse permutation is used with multiplication of inverse diagonal elements as the following: c. Calculate the sub determinants of the sub matrices by sum diagonal and inverse daigonal for every submatrices. Step 4: Combine all the products of the sub determinants for all sub matrices which are produced from step 3. Step 5: The final result for the determinant to the original matrix is det(a) = sign a 11 a 22 a 33 a nn + signa 1n a n1 + sign a 12 a 23 a 34 a n1 +sign a 11 a n2 + + signa 1n a 21 a 32 a n(n-1) +sign a 1(n-1) a nn From this algorithm we will be able to prove the following a new formula for determinant. Theorem We have ( )

9 20 Proof. Case 1:Suppose A is a matrix of size 2 2, and there are two permutations 1 (1, 2), 2 (2, 1). We take only permutation 1(1, 2) and delete permutation 2(2, 1) because this permutation is the inverse of 1(1, 2). Then, take the matrix based on the permutation, such as A. We can use the following expression to create the intersection of the diagonals of the one matrix (1) then we get from matrix A,a 11 a 22 +a 12 a 21. By using the definition of sign, and inversion and by adding the sign to the permutations resulting from the previous expression, we get a 11 a 22 + ( 1) a 12 a 21 = a 11 a 22 a 12 a 21. So, (1) becomes Then, we use this equation to find the determinant of matrix for one permutation only. This equation for one permutation without inverse takes one matrix. So that a solution for the determinant of matrix A for the permutation (1,2) is given by det (A) = a 11 a 22 a 12 a 21. Case 2: Consider a matrix A of size 3 3, we get 3! = 6 permutations of {(1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), (3, 2, 1)},which are generated from (1, 2, 3) without repetition and inverse. The permutations here have only 3 permutations which are {(1, 2, 3), (2, 3, 1), (3, 1, 2)}. Take the matrices for these permutations after changing the columns for the original matrix as follows: For the permutation (1, 2, 3) take a matrix A 1, for the permutation (2, 3, 1) take a matrix A 2, and the permutation (3, 1, 2) take a matrix A 3. To find the determinant for every sub matrix from matrix A, use equation (2) above and multiply the diagonal elements and multiply the inverse diagonal elements and take the sign a diagonal and inverse diagonal, such as:

10 21 Combining these equations we get Then = + + [ ] [ ] ( ) Case 3: Now, we expand this operation on the matrix size n n, so we get ( ) permutation without repetition and we get ( ) sub matrices based on the permutations. Therefore, the algorithm for the determinant for a matrix A which is

11 22 Determine by using the equation (2) for every sub matrices produced from A after swapping of permutation by exchanging columns so that a sub matrix A 1 comes from a permutation ( n 3 n 2 n 1 n) such as A 1 = Then we make swap in a permutation to get a sub matrix A 2, A 2 = Repeat this step to all permutations to get all sub matrices whose number is ( ) from A based on swapping in permutations. Now, by using equation (2), for every sub matrix, the determinant for these matrices is as follows: To find the determinant of the matrix A, we just need to combine every determinant of sub matrix, to obtain =

12 23 Therefore, we get (( ) ( ) ) This equation is produced by combining determinants for all sub matrices. We have ( ) sub matrices produced from ( ) permutations without repeating matrix size n n. Then ( )

13 24 4. Conclusion We have proposed new method to evaluate determinant based on starter set from listing permutation. We shall consider the following questions for future study: Could we construct isomorphism classes to classify equivalence starter sets? We expect to use one-factorization or decomposition of compete graph (K n ). Could we compare this new algorithm for finding determinant with other existing methods? Could we employ these new algorithms (permutation based on starter set and diagonal method for determinant)in other fields, for example in cryptography(security), image processing (determinant), and medicine (permutation)? Acknowledgments We are indebted to Ministry of Higher Education for providing this grant (Code #:11768). References [1] C. T. Fike, A permutation generation method. The Computer Journal, 18(1) (1975): [2] E. H. Bareiss, Sylvester s identity and multistep integer-preserving Gaussian elimination. Mathematics of Computation, 22(103) (1968): [3] F. Benno, Modified Gauss algorithm for matrices with symbolic entries. ACM Communications in Computer Algebra, 42(3) (2008): [4] G. I. Mani, Permutation generation using matrices. Retrieved on November 01, 2010, from [5] H. Ibrahim, Z. Omar, & A. M. Rohni, New algorithm for listing all permutations. Modern Applied Science, 4(2)(2010): [6] J. S. Rohl, Generating permutations by Choosing. The Computer Journal, 21(4) (1978): [7] K. Thongchiew. A computerized algorithm for generating permutation and its application in determining a determinant. World Academy of Science, Engineering and Technology, 27(2007): [8] M. Mahajan &V. Vinay, Determinant: Combinatorics, algorithms, and complexity. Chicago Journal of Theoretical Computer Science,5(1997):

14 25 [9] M. L. Griss, An efficient sparse minor expansion algorithm. In J. Gosden, & O. G. Johnson (Ed.), ACM National Conference 76, Proceedings of the association for computing machinery annual conference, ACM, New York, NY, 1976, p [10] O. Rezaifar & M. Rezaee, A new approach for finding the determinant of matrices. Applied Mathematics and Computation, 188(2007): [11] R. Sedgewick, Permutation generation methods. Journal Computer Science of Applied Mathematics, 9(1977): [12] T. Sasaki & H. Murao, Efficient Gaussian elimination method for symbolic determinants and linear systems. ACM Transactions on Mathematical Software (TOMS), 8(3)(1982): [13] W. M. Gentleman & S.C. Johnson, The evaluation of determinants by expansion by minors and the general problem of substitution. Mathematics of Computation, 28(126)(1974):

Integrated Strategy for Generating Permutation

Integrated Strategy for Generating Permutation Int J Contemp Math Sciences, Vol 6, 011, no 4, 1167-1174 Integrated Strategy for Generating Permutation Sharmila Karim 1, Zurni Omar and Haslinda Ibrahim Quantitative Sciences Building College of Arts

More information

Comparisons for Determinants of Special Matrices by Algorithm Proposed

Comparisons for Determinants of Special Matrices by Algorithm Proposed ISSN 1746-7659, England, UK Journal of Information and Computing Science Vol. 6, No. 1, 2011, pp. 049-054 Comparisons for Determinants of Special Matrices by Algorithm Proposed Lugen M. Zake 1, Haslinda

More information

Determinants, Part 1

Determinants, Part 1 Determinants, Part We shall start with some redundant definitions. Definition. Given a matrix A [ a] we say that determinant of A is det A a. Definition 2. Given a matrix a a a 2 A we say that determinant

More information

LECTURE 8: DETERMINANTS AND PERMUTATIONS

LECTURE 8: DETERMINANTS AND PERMUTATIONS LECTURE 8: DETERMINANTS AND PERMUTATIONS MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1 Determinants In the last lecture, we saw some applications of invertible matrices We would now like to describe how

More information

Permutation group and determinants. (Dated: September 19, 2018)

Permutation group and determinants. (Dated: September 19, 2018) Permutation group and determinants (Dated: September 19, 2018) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter

More information

1111: Linear Algebra I

1111: Linear Algebra I 1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 7 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 7 1 / 8 Invertible matrices Theorem. 1. An elementary matrix is invertible. 2.

More information

Week 1. 1 What Is Combinatorics?

Week 1. 1 What Is Combinatorics? 1 What Is Combinatorics? Week 1 The question that what is combinatorics is similar to the question that what is mathematics. If we say that mathematics is about the study of numbers and figures, then combinatorics

More information

Solutions to Exercises Chapter 6: Latin squares and SDRs

Solutions to Exercises Chapter 6: Latin squares and SDRs Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,

More information

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

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees. 7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}

More information

Math 3560 HW Set 6. Kara. October 17, 2013

Math 3560 HW Set 6. Kara. October 17, 2013 Math 3560 HW Set 6 Kara October 17, 013 (91) Let I be the identity matrix 1 Diagonal matrices with nonzero entries on diagonal form a group I is in the set and a 1 0 0 b 1 0 0 a 1 b 1 0 0 0 a 0 0 b 0 0

More information

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

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.

More information

Hamming Codes as Error-Reducing Codes

Hamming Codes as Error-Reducing Codes Hamming Codes as Error-Reducing Codes William Rurik Arya Mazumdar Abstract Hamming codes are the first nontrivial family of error-correcting codes that can correct one error in a block of binary symbols.

More information

Pattern Avoidance in Unimodal and V-unimodal Permutations

Pattern Avoidance in Unimodal and V-unimodal Permutations Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is

More information

THE SIGN OF A PERMUTATION

THE SIGN OF A PERMUTATION THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written

More information

Permutations of a Multiset Avoiding Permutations of Length 3

Permutations of a Multiset Avoiding Permutations of Length 3 Europ. J. Combinatorics (2001 22, 1021 1031 doi:10.1006/eujc.2001.0538 Available online at http://www.idealibrary.com on Permutations of a Multiset Avoiding Permutations of Length 3 M. H. ALBERT, R. E.

More information

The number of mates of latin squares of sizes 7 and 8

The number of mates of latin squares of sizes 7 and 8 The number of mates of latin squares of sizes 7 and 8 Megan Bryant James Figler Roger Garcia Carl Mummert Yudishthisir Singh Working draft not for distribution December 17, 2012 Abstract We study the number

More information

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

Graphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA Graphs of Tilings Patrick Callahan, University of California Office of the President, Oakland, CA Phyllis Chinn, Department of Mathematics Humboldt State University, Arcata, CA Silvia Heubach, Department

More information

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

European Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap European Journal of Combinatorics 30 (2009) 532 539 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Staircase rook polynomials

More information

Permutation Groups. Definition and Notation

Permutation Groups. Definition and Notation 5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those

More information

Permutations. = f 1 f = I A

Permutations. = f 1 f = I A Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has

More information

Staircase Rook Polynomials and Cayley s Game of Mousetrap

Staircase Rook Polynomials and Cayley s Game of Mousetrap Staircase Rook Polynomials and Cayley s Game of Mousetrap Michael Z. Spivey Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington 98416-1043 USA mspivey@ups.edu Phone:

More information

Permutation Tableaux and the Dashed Permutation Pattern 32 1

Permutation Tableaux and the Dashed Permutation Pattern 32 1 Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen, Lewis H. Liu, Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 7, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn

More information

Enumeration of Two Particular Sets of Minimal Permutations

Enumeration of Two Particular Sets of Minimal Permutations 3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica

More information

Quarter Turn Baxter Permutations

Quarter Turn Baxter Permutations Quarter Turn Baxter Permutations Kevin Dilks May 29, 2017 Abstract Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these

More information

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors. Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}

More information

Discrete Mathematics with Applications MATH236

Discrete Mathematics with Applications MATH236 Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet

More information

Reflections on the N + k Queens Problem

Reflections on the N + k Queens Problem Integre Technical Publishing Co., Inc. College Mathematics Journal 40:3 March 12, 2009 2:02 p.m. chatham.tex page 204 Reflections on the N + k Queens Problem R. Douglas Chatham R. Douglas Chatham (d.chatham@moreheadstate.edu)

More information

Generating indecomposable permutations

Generating indecomposable permutations Discrete Mathematics 306 (2006) 508 518 www.elsevier.com/locate/disc Generating indecomposable permutations Andrew King Department of Computer Science, McGill University, Montreal, Que., Canada Received

More information

PRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma

PRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma PRIMES 2017 final paper NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma ABSTRACT. In this paper we study pattern-replacement

More information

Dyck paths, standard Young tableaux, and pattern avoiding permutations

Dyck paths, standard Young tableaux, and pattern avoiding permutations PU. M. A. Vol. 21 (2010), No.2, pp. 265 284 Dyck paths, standard Young tableaux, and pattern avoiding permutations Hilmar Haukur Gudmundsson The Mathematics Institute Reykjavik University Iceland e-mail:

More information

BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 2006 Senior Preliminary Round Problems & Solutions

BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 2006 Senior Preliminary Round Problems & Solutions BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 006 Senior Preliminary Round Problems & Solutions 1. Exactly 57.4574% of the people replied yes when asked if they used BLEU-OUT face cream. The fewest

More information

1.6 Congruence Modulo m

1.6 Congruence Modulo m 1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number

More information

How Many Mates Can a Latin Square Have?

How Many Mates Can a Latin Square Have? How Many Mates Can a Latin Square Have? Megan Bryant mrlebla@g.clemson.edu Roger Garcia garcroge@kean.edu James Figler figler@live.marshall.edu Yudhishthir Singh ysingh@crimson.ua.edu Marshall University

More information

Non-overlapping permutation patterns

Non-overlapping permutation patterns PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)

More information

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

NEGATIVE FOUR CORNER MAGIC SQUARES OF ORDER SIX WITH a BETWEEN 1 AND 5 NEGATIVE FOUR CORNER MAGIC SQUARES OF ORDER SIX WITH a BETWEEN 1 AND 5 S. Al-Ashhab Depratement of Mathematics Al-Albayt University Mafraq Jordan Email: ahhab@aabu.edu.jo Abstract: In this paper we introduce

More information

THE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n. Communicated by S. Alikhani

THE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n. Communicated by S. Alikhani Algebraic Structures and Their Applications Vol 3 No 2 ( 2016 ) pp 71-79 THE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n MASOOMEH YAZDANI-MOGHADDAM AND REZA KAHKESHANI Communicated by S Alikhani

More information

Principle of Inclusion-Exclusion Notes

Principle of Inclusion-Exclusion Notes Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.

More information

The Apprentices Tower of Hanoi

The Apprentices Tower of Hanoi Journal of Mathematical Sciences (2016) 1-6 ISSN 272-5214 Betty Jones & Sisters Publishing http://www.bettyjonespub.com Cory B. H. Ball 1, Robert A. Beeler 2 1. Department of Mathematics, Florida Atlantic

More information

Chapter 6.1. Cycles in Permutations

Chapter 6.1. Cycles in Permutations Chapter 6.1. Cycles in Permutations Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 6.1. Cycles in Permutations Math 184A / Fall 2017 1 / 27 Notations for permutations Consider a permutation in 1-line

More information

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied

More information

Teacher s Notes. Problem of the Month: Courtney s Collection

Teacher s Notes. Problem of the Month: Courtney s Collection Teacher s Notes Problem of the Month: Courtney s Collection Overview: In the Problem of the Month, Courtney s Collection, students use number theory, number operations, organized lists and counting methods

More information

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

28,800 Extremely Magic 5 5 Squares Arthur Holshouser. Harold Reiter. 28,800 Extremely Magic 5 5 Squares Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@uncc.edu

More information

Fast Sorting and Pattern-Avoiding Permutations

Fast Sorting and Pattern-Avoiding Permutations Fast Sorting and Pattern-Avoiding Permutations David Arthur Stanford University darthur@cs.stanford.edu Abstract We say a permutation π avoids a pattern σ if no length σ subsequence of π is ordered in

More information

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

The Place of Group Theory in Decision-Making in Organizational Management A case of 16- Puzzle IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728,p-ISSN: 2319-765X, Volume 7, Issue 6 (Sep. - Oct. 2013), PP 17-22 The Place of Group Theory in Decision-Making in Organizational Management A case

More information

Section Summary. Permutations Combinations Combinatorial Proofs

Section Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement

More information

Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration

Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration Ira M. Gessel Department of Mathematics Brandeis University Sapienza Università di Roma July 10, 2013 Exponential generating functions

More information

SOLUTIONS TO PROBLEM SET 5. Section 9.1

SOLUTIONS TO PROBLEM SET 5. Section 9.1 SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3

More information

MULTIPATH fading could severely degrade the performance

MULTIPATH fading could severely degrade the performance 1986 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 12, DECEMBER 2005 Rate-One Space Time Block Codes With Full Diversity Liang Xian and Huaping Liu, Member, IEEE Abstract Orthogonal space time block

More information

Edge-disjoint tree representation of three tree degree sequences

Edge-disjoint tree representation of three tree degree sequences Edge-disjoint tree representation of three tree degree sequences Ian Min Gyu Seong Carleton College seongi@carleton.edu October 2, 208 Ian Min Gyu Seong (Carleton College) Trees October 2, 208 / 65 Trees

More information

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As

More information

A FAMILY OF t-regular SELF-COMPLEMENTARY k-hypergraphs. Communicated by Behruz Tayfeh Rezaie. 1. Introduction

A FAMILY OF t-regular SELF-COMPLEMENTARY k-hypergraphs. Communicated by Behruz Tayfeh Rezaie. 1. Introduction Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 6 No. 1 (2017), pp. 39-46. c 2017 University of Isfahan www.combinatorics.ir www.ui.ac.ir A FAMILY OF t-regular SELF-COMPLEMENTARY

More information

AwesomeMath Admission Test A

AwesomeMath Admission Test A 1 (Before beginning, I d like to thank USAMTS for the template, which I modified to get this template) It would be beneficial to assign each square a value, and then make a few equalities. a b 3 c d e

More information

Math 127: Equivalence Relations

Math 127: Equivalence Relations Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other

More information

Odd king tours on even chessboards

Odd king tours on even chessboards Odd king tours on even chessboards D. Joyner and M. Fourte, Department of Mathematics, U. S. Naval Academy, Annapolis, MD 21402 12-4-97 In this paper we show that there is no complete odd king tour on

More information

Shuffling with ordered cards

Shuffling with ordered cards Shuffling with ordered cards Steve Butler (joint work with Ron Graham) Department of Mathematics University of California Los Angeles www.math.ucla.edu/~butler Combinatorics, Groups, Algorithms and Complexity

More information

Combinatorics in the group of parity alternating permutations

Combinatorics in the group of parity alternating permutations Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi

More information

Permutation Tableaux and the Dashed Permutation Pattern 32 1

Permutation Tableaux and the Dashed Permutation Pattern 32 1 Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen and Lewis H. Liu Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn

More information

INFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES

INFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES INFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES Ghulam Chaudhry and Jennifer Seberry School of IT and Computer Science, The University of Wollongong, Wollongong, NSW 2522, AUSTRALIA We establish

More information

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

The Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (2017), pp. 1091-1101 Research India Publications http://www.ripublication.com The Classification of Quadratic Rook Polynomials

More information

Biembeddings of Latin squares and Hamiltonian decompositions

Biembeddings of Latin squares and Hamiltonian decompositions Biembeddings of Latin squares and Hamiltonian decompositions M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM M. Knor Department

More information

The Sign of a Permutation Matt Baker

The Sign of a Permutation Matt Baker The Sign of a Permutation Matt Baker Let σ be a permutation of {1, 2,, n}, ie, a one-to-one and onto function from {1, 2,, n} to itself We will define what it means for σ to be even or odd, and then discuss

More information

Solution: This is sampling without repetition and order matters. Therefore

Solution: This is sampling without repetition and order matters. Therefore June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes

More information

Lecture 2.3: Symmetric and alternating groups

Lecture 2.3: Symmetric and alternating groups Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)

More information

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1:

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1: Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.

More information

Some Fine Combinatorics

Some Fine Combinatorics Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion

More information

Topics to be covered

Topics to be covered Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle

More information

Applications of AI for Magic Squares

Applications of AI for Magic Squares Applications of AI for Magic Squares Jared Weed arxiv:1602.01401v1 [math.ho] 3 Feb 2016 Department of Mathematical Sciences Worcester Polytechnic Institute Worcester, Massachusetts 01609-2280 Email: jmweed@wpi.edu

More information

SQUARING THE MAGIC SQUARES OF ORDER 4

SQUARING THE MAGIC SQUARES OF ORDER 4 Journal of lgebra Number Theory: dvances and lications Volume 7 Number Pages -6 SQURING THE MGIC SQURES OF ORDER STEFNO BRBERO UMBERTO CERRUTI and NDIR MURRU Deartment of Mathematics University of Turin

More information

Math236 Discrete Maths with Applications

Math236 Discrete Maths with Applications Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 43 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1,

More information

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

X = {1, 2,...,n} n 1f 2f 3f... nf Section 11 Permutations Definition 11.1 Let X be a non-empty set. A bijective function f : X X will be called a permutation of X. Consider the case when X is the finite set with n elements: X {1, 2,...,n}.

More information

Gray code and loopless algorithm for the reflection group D n

Gray code and loopless algorithm for the reflection group D n PU.M.A. Vol. 17 (2006), No. 1 2, pp. 135 146 Gray code and loopless algorithm for the reflection group D n James Korsh Department of Computer Science Temple University and Seymour Lipschutz Department

More information

On uniquely k-determined permutations

On uniquely k-determined permutations On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce

More information

5 Symmetric and alternating groups

5 Symmetric and alternating groups MTHM024/MTH714U Group Theory Notes 5 Autumn 2011 5 Symmetric and alternating groups In this section we examine the alternating groups A n (which are simple for n 5), prove that A 5 is the unique simple

More information

SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES

SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES Discrete Mathematics, Algorithms and Applications Vol 4, No 3 (2012) 1250022 (8 pages) c World Scientific Publishing Company DOI: 101142/S179383091250022X SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN

More information

In this paper, we discuss strings of 3 s and 7 s, hereby dubbed dreibens. As a first step

In this paper, we discuss strings of 3 s and 7 s, hereby dubbed dreibens. As a first step Dreibens modulo A New Formula for Primality Testing Arthur Diep-Nguyen In this paper, we discuss strings of s and s, hereby dubbed dreibens. As a first step towards determining whether the set of prime

More information

Avoiding consecutive patterns in permutations

Avoiding consecutive patterns in permutations Avoiding consecutive patterns in permutations R. E. L. Aldred M. D. Atkinson D. J. McCaughan January 3, 2009 Abstract The number of permutations that do not contain, as a factor (subword), a given set

More information

Chapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION

Chapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION Chapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION 3.1 The basics Consider a set of N obects and r properties that each obect may or may not have each one of them. Let the properties be a 1,a,..., a r. Let

More information

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University

More information

Exploiting the disjoint cycle decomposition in genome rearrangements

Exploiting the disjoint cycle decomposition in genome rearrangements Exploiting the disjoint cycle decomposition in genome rearrangements Jean-Paul Doignon Anthony Labarre 1 doignon@ulb.ac.be alabarre@ulb.ac.be Université Libre de Bruxelles June 7th, 2007 Ordinal and Symbolic

More information

Some constructions of mutually orthogonal latin squares and superimposed codes

Some constructions of mutually orthogonal latin squares and superimposed codes University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2012 Some constructions of mutually orthogonal

More information

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

I.M.O. Winter Training Camp 2008: Invariants and Monovariants I.M.. Winter Training Camp 2008: Invariants and Monovariants n math contests, you will often find yourself trying to analyze a process of some sort. For example, consider the following two problems. Sample

More information

m-partition Boards and Poly-Stirling Numbers

m-partition Boards and Poly-Stirling Numbers 47 6 Journal of Integer Sequences, Vol. (00), Article 0.. m-partition Boards and Poly-Stirling Numbers Brian K. Miceli Department of Mathematics Trinity University One Trinity Place San Antonio, T 78-700

More information

Another Form of Matrix Nim

Another Form of Matrix Nim Another Form of Matrix Nim Thomas S. Ferguson Mathematics Department UCLA, Los Angeles CA 90095, USA tom@math.ucla.edu Submitted: February 28, 2000; Accepted: February 6, 2001. MR Subject Classifications:

More information

Yet Another Triangle for the Genocchi Numbers

Yet Another Triangle for the Genocchi Numbers Europ. J. Combinatorics (2000) 21, 593 600 Article No. 10.1006/eujc.1999.0370 Available online at http://www.idealibrary.com on Yet Another Triangle for the Genocchi Numbers RICHARD EHRENBORG AND EINAR

More information

Sec$on Summary. Permutations Combinations Combinatorial Proofs

Sec$on Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Sec$on Summary Permutations Combinations Combinatorial Proofs 2 Coun$ng ordered arrangements Ex: How many ways can we select 3 students from a group of 5 students to stand in line for a picture?

More information

To Your Hearts Content

To Your Hearts Content To Your Hearts Content Hang Chen University of Central Missouri Warrensburg, MO 64093 hchen@ucmo.edu Curtis Cooper University of Central Missouri Warrensburg, MO 64093 cooper@ucmo.edu Arthur Benjamin [1]

More information

Greedy Flipping of Pancakes and Burnt Pancakes

Greedy Flipping of Pancakes and Burnt Pancakes Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,

More information

Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4

Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4 Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 206 Rules: Three hours; no electronic devices. The positive integers are, 2, 3, 4,.... Pythagorean Triplet The sum of the lengths of the

More information

Bulgarian Solitaire in Three Dimensions

Bulgarian Solitaire in Three Dimensions Bulgarian Solitaire in Three Dimensions Anton Grensjö antongrensjo@gmail.com under the direction of Henrik Eriksson School of Computer Science and Communication Royal Institute of Technology Research Academy

More information

ON THE ENUMERATION OF MAGIC CUBES*

ON THE ENUMERATION OF MAGIC CUBES* 1934-1 ENUMERATION OF MAGIC CUBES 833 ON THE ENUMERATION OF MAGIC CUBES* BY D. N. LEHMER 1. Introduction. Assume the cube with one corner at the origin and the three edges at that corner as axes of reference.

More information

Harmonic numbers, Catalan s triangle and mesh patterns

Harmonic numbers, Catalan s triangle and mesh patterns Harmonic numbers, Catalan s triangle and mesh patterns arxiv:1209.6423v1 [math.co] 28 Sep 2012 Sergey Kitaev Department of Computer and Information Sciences University of Strathclyde Glasgow G1 1XH, United

More information

A combinatorial proof for the enumeration of alternating permutations with given peak set

A combinatorial proof for the enumeration of alternating permutations with given peak set AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (2013), Pages 293 300 A combinatorial proof for the enumeration of alternating permutations with given peak set Alina F.Y. Zhao School of Mathematical Sciences

More information

PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES

PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES MARK SHATTUCK AND TAMÁS WALDHAUSER Abstract. We give combinatorial proofs for some identities involving binomial sums that have no closed

More information

6.2 Modular Arithmetic

6.2 Modular Arithmetic 6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through

More information

Asymptotic behaviour of permutations avoiding generalized patterns

Asymptotic behaviour of permutations avoiding generalized patterns Asymptotic behaviour of permutations avoiding generalized patterns Ashok Rajaraman 311176 arajaram@sfu.ca February 19, 1 Abstract Visualizing permutations as labelled trees allows us to to specify restricted

More information

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

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations

More information

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

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined

More information

Stupid Columnsort Tricks Dartmouth College Department of Computer Science, Technical Report TR

Stupid Columnsort Tricks Dartmouth College Department of Computer Science, Technical Report TR Stupid Columnsort Tricks Dartmouth College Department of Computer Science, Technical Report TR2003-444 Geeta Chaudhry Thomas H. Cormen Dartmouth College Department of Computer Science {geetac, thc}@cs.dartmouth.edu

More information

THE TAYLOR EXPANSIONS OF tan x AND sec x

THE TAYLOR EXPANSIONS OF tan x AND sec x THE TAYLOR EXPANSIONS OF tan x AND sec x TAM PHAM AND RYAN CROMPTON Abstract. The report clarifies the relationships among the completely ordered leveled binary trees, the coefficients of the Taylor expansion

More information

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

You ve seen them played in coffee shops, on planes, and Every Sudoku variation you can think of comes with its own set of interesting open questions There is math to be had here. So get working! Taking Sudoku Seriously Laura Taalman James Madison University

More information