Determinants of generalized binary band matrices
|
|
- Pierce Williams
- 6 years ago
- Views:
Transcription
1 Determinants of generalized inary and matrices Dmitry Efimov arxiv: v1 [mathra] 18 Fe 017 Department of Mathematics, Komi Science Centre UrD RAS, Syktyvkar, Russia Astract Under inary matrices we mean matrices whose entries take one of two values In this paper, explicit formulae for calculating the determinant of some type of inary Toeplitz matrices are otained Examples of the application of the determinant of inary Toeplitz matrices for the enumeration of even and odd permutations of different types are given Introduction Under inary matrices we will mean matrices whose elements can take only two values Matrices of this kind arise in different mathematical questions For example, this type includes such popular ojects in mathematics and its applications as matrices over the field GF) [1] The Hadamard s prolem of finding the maximal determinant of 1, 1)- matrices, ie matrices consisting from 1 and 1, is well known[] Further, 0, 1)-matrices are one of the favorite ojects of the enumerative cominatorics [3 6] Also one can use inary 1, x)-matrices for enumerative prolems [6] These examples can e extended One of the asic notion of the matrix theory is the notion of determinant There exist effective algorithms for the determinant calculation, for example, the modified method of Gaussian elimination, which run in polynomial time Nevertheless, in cases of some kinds of matrices it is possile to otain good explicit formulae for the determinant expression On the one hand, these formulae allow to draw certain conclusions aout properties of matrices On the other hand, they give even greater gain in the speed of the determinant calculation Such formulae are known only for very limited class of matrices Our paper is motivated to some extent y the recent work [7] in which the explicit formula for the determinant of some inary circulant matrices has een otained In the present paper we get explicit formulae for determinants of some kinds of inary Toeplitz matrices Considered matrices are close in their structure to and matrices, therefore we call them generalized and matrices For our purposes we use quite elementary methods Applying the Laplace expansion we otain recurrent formulae leading to required result Thepaperisorganizedasfollows Inthesecondsection wegiveandprovetheformulae, which allow to efficiently calculate determinants of generalized inary and matrices in an explicit form In the third section we give a few examples of the application of the determinant of such inary matrices for the enumeration of even and odd permutations of different types The study is supported y Program of UD RAS, project defimov@dmkomiscru 1
2 1 The main part Let n,k,l e integers, 1 l k n Consider a inary Toeplitz matrix A = a ij ) of order n with the following elements: {, if l < j i < k; a ij = a, otherwise, where a and a ) elong to a commutative associative ring with a unit In the case a = 0 we get a so-called and matrix [8], p16) So we can say that we consider generalized inary and matrices Our purpose is to get explicit formulae for calculating the determinant of the matrix A We will divide this prolem into two cases Case 1 Let l = 1 In other words, let the first row of the matrix A have the form: k {}}{ [ } {{ a a} ], n and the i+1)-st row is otained from the first row y the removal of i elements on the right and addition of i elements a on the left: a A = 1) a Theorem 11 Let n p mod k), where 0 < p k Then the determinant of the matrix 1) is equal to: deta = a) n 1 + n p ) k a ) For the proof of Theorem 11 one can apply the method given in [7] for the proof of explicit formulae of the determinants of circulant matrices using the formula of the determinant of a lock matrix) But in this case another method will e more convenient First let us formulate some auxiliary statements Consider a square matrix of order n of the form: a a a a a 3) a a a a a a a a The given matrix is otained from the matrix 1) of order n 1) y addition of one more the last) row and one more the last) column, consisting entirely of elements a Let f n denote the determinant of such matrix Lemma 11 The determinant of the matrix 3) is equal to: f n = a) n 1 a 4)
3 Proof Sutracting the penultimate row from the last row and expanding the determinant along the last row, we get that f n = a)f n 1 Using the given formula consecutively to f n 1, f n and so on, we get 4) Suppose that k = n, ie consider the matrix of order n of the form: 5) a By g n denote the determinant of such matrix Lemma 1 One can calculate the determinant of the matrix 5) y the formula: Proof Similarly to the proof of the previous lemma g n = a) n 1 6) Consider the matrix 1) of order n with k < n Let d n denote the determinant of such matrix Lemma 13 The following equality holds: { a) d n = k d n k + a) n 1 a, k < n ; a) n 1 +a), k n 7) Proof Let k < n, ie the numer of elements in the first row of the matrix 1) is less than the numer of elements a Let us sutract the penultimate row of the matrix from the last row and expand the determinant along the last row Performing this procedure consecutively k times, we come to the equality: d n = a) k d n k + a) k f n k Sustituting here the formula 4), we get the first row of the equality 7) Let n k, ie the numer of elements in the first row of the matrix 1) is more or equal to the numer of elements a, ut less than n Executing the same k consecutive expansions along the last row as in the first case, we come to the equality: d n = a) k f n k +g n k ) Sustituting here the formulae 4) and 6), we get the second row of 7) Proof of the Theorem 11) Suppose that n p mod k), where 0 < p k, ie n = km+p, where m is a non-negative integer Assume that k < n Then m > 0 and, using the first row of the formula 7) recurrently m 1 times, we otain the equality: d n = a) n k p d k+p +m 1) a) n 1 a Since k+p k, then applying the second row of the formula 7) to d k+p and performing ovious transformations, we get ) If k = n, ie the first row of the matrix 1) entirely consists from elements, then p = n and the formula ) gives us d n = a) n 1, which corresponds to the statement of the Lemma 1 3
4 Case Let l > 1 In other words, let the i-th row of the matrix A, i = 1,,l, have the form: k+i 1 {}}{ [ } {{ a a} ], n and the l +j)-th row is otained from the l-th one y the removal of j elements on the right and addition of j elements a on the left: a A = 8) a The matrix A is not symmetric in general, ut it is persymmetric ie symmetric with respect of the secondary diagonal) like all Toeplitz matrices Lemma 14 In the matrix 8) exactly maxk +l n,0) rows consist entirely from elements Proof First note that each row of the matrix A contains no more than k+l 1 elements y definition Let k+l n 0 Hence k+l 1 < n, ie there is at least one element a in each row and there are no rows, consisting entirely from elements Let now k+l n > 0 or, alternatively, k+l 1 n If n = k+i 1, 1 i l, then the numer of rows, that consist entirely from elements, will e equal to l i+1 = k+l n Theorem 1 Let 1 < l k n and n p mod k +l 1), 0 p < k +l 1 Then the determinant of the matrix 8) is equal to: ) 1) k 1)l 1)n k+l 1 a) + n 1 n k l+1 k+l 1 a, p = 0, ) deta = 1) k 1)l 1)n 1) k+l 1 a) + n 1 n 1 k+l 1 a, p = 1, 0, otherwise Proof By the theorem condition n Let n p mod k +l 1), 0 p < k +l 1 This is equivalent to n = k +l 1)s+p, where s is a non-negative integer First consider the case when s = 0, ie when p = n and, respectively, n < k +l 1 By lemma 14 at least rows of the matrix A will consist entirely from elements in this case, therefore the determinant of the matrix A will e equal to 0, that corresponds to the formula 9) Now assume that s 1 The first row of the matrix A differs from the second one only y an element in the k + 1)-st column Let us sutract the first row from the second one and expand the determinant along the second row We will get that deta = 1) k 1 a)deta, where A is a matrix, whose first and second rows differ also only in the k+1)-st column Performing this procedure l 1 times, we otain that 9) 4
5 deta = 1) k 1)l 1) a) l 1 deta, where a a a A = a a The part of the matrix A that is located aove the horizontal line consists from k rows, and in the first row there are exactly k elements In the lower right corner of the matrix A there is a sumatrix, which is formed y intersection of the last n k l+1 rows and columns of A The given sumatrix, in turn, also has the form 8) The algorithm can e repeated s times with an ovious shift at each step in the k rows down and in the k columns to the right Thus in the second step we sutract the k+1)-st row of the matrix A from the k+)-nd one and expand the determinant along the k +)-nd row, and repeat this procedure l 1 times and so on As a result we will get that deta = 1) k 1)l 1)s a) l 1)s deta, 10) where a a A = a a M The part of the matrix A that is located aove the horizontal line consists from ks rows, and in the first row there are exactly k elements In the lower right corner of the matrix A there is a sumatrix M, which is formed y intersection of the last n k+l 1)s = p rows and columns of the matrix A It is not hard to see that if 1 < p < k + l 1 then M contains two identical rows, hence the matrix A also contains two identical rows, and therefore its determinant and the determinant of the matrix A are equal to 0 If p = 0 then the matrix A is the matrix of the form 1) of order ks Then y Theorem 11 we get: deta = a) ks 1 + ks k ) a = a) ks 1 [+s 1)a] k Then, sustituting the given formula in 10) and taking into account that n = k+l 1)s, we finally otain: deta = 1) k 1)l 1)s a) k+l 1)s 1 [+s 1)a] = = 1) k 1)l 1)n k+l 1 a) n 1 + n k l+1 ) a k+l 1 If p = 1 then the matrix A will e the matrix of the form 1) of order ks+1 Then from Theorem 11 we get: deta = a) ks + ks+1 1 ) a = a) ks +sa) k 5
6 Then, sustituting the given formula in 10) and taking into account that n = k +l 1)s+1, we finally otain: deta = 1) k 1)l 1)s a) k+l 1)s +sa) = = 1) k 1)l 1)n 1) k+l 1 a) n 1 + n 1 ) k+l 1 a The application of determinants of inary matrices to the enumeration of permutations As mentioned in the Introduction, the inary matrices are one of the favorite ojects of the enumerative cominatorics In particular, they are applied for enumeration of permutations with restricted positions Following [6] let us descrie riefly this mechanism Let A = a ij ) e a 0,1)-matrix of order n Each of such matrices defines a class BA) of restricted permutations Namely a permutation p elongs to BA) if and only if the inequality M p A holds for its incidence matrix M p, ie each element of the matrix M p is not more than the corresponding element of the matrix A The matrix A is called the characteristic matrix of the class BA) It is not hard to see that the numer of permutations in the class BA) is equal to the permanent of the matrix A: BA) = pera Denote the numer of even and odd permutations from the class BA) y E A and O A, respectively It is ovious that E A +O A = pera It is easy to see also that E A O A = deta This implies the following formulae for calculating the total numer of even and odd permutations from the class BA): E A = pera+deta, O A = pera deta 11) As an example we calculate the numer of even and odd permutations π S n such that πi) i,i + 1 for i = 1,n 1 and πn) n The characteristic matrix of this class of permutations is the following 0,1)-matrix A n of order n: A n = Such matrices arise in the variation of the famous ménage prolem, where not a round tale, ut one side of a rectangular tale is considered [5], ch 8) If we denote the permanent of such matrix y p n, then the sequence of permanents will satisfy the following recurrence relation: n 1)p n = n n 1)p n 1 +np n + 1) n+1, p 1 = p = 0 One can also calculate these permanents y the following explicit formula: n ) n k p n = n k)! 1) k k k=0 Let d n denote the determinant of the matrix A n Sustituting = 0, a = 1, k = to the formula ), we get d n = 1) n 1n p, n p mod ), 0 < p 6
7 One can also rewrite this equality in the following form: { n 1 n 1 d n = 1) n 1 =, if n odd;, if n even n Applying formulae 11), we otain sequences of the numer of even e n ) and odd o n ) permutations of the given type depending on the permutation order: n p n d n e n o n As the second example, we will calculate the numer of even and odd permutations π S n such that πi) i > 1, i = 1,,n The characteristic matrix of the given class of permutations is the matrix of order n B n whose main diagonal and its neighoring diagonals are zero, and all other elements are equal to 1: B n = This example is linked with another variation of the ménage prolem, where a rectangular tale is considered and additional restriction on the placement of men is imposed The explicit formula of the total numer of such permutations of order n or, alternatively, of the value of the permanent of B n was found y VS Shevelev see the review [6]) Here we will not give it, ut indicate only that the sequence {p n} of such numers has the id-numer A in [9] Let d n denote the determinant of the matrix B n Sustituting = 0, a = 1, k = l = to the formula 9), we get 3 n d n = 3, if p = 0; n 1 3, if p = 1; 0, if p = ; wheren p mod 3) Applyingformulae 11), we otain sequences of the numer of even e n) and odd o n) permutations of the given type depending on the permutation order: n p n d n e n o n Another version of the application of inary matrices to enumeration of permutations has een descried also in [6] It consists in the following Let us consider a inary matrix A of order n in which some elements areequal to the variale, and the other elements are equal to 1 It is easy to see that the coefficient on k in the permanent pera will e equal to the numer of permutations π S n whose incidence matrices have exactly k units in the positions, in which there are elements in the matrix A Respectively, the coefficient on k in the determinant deta will e equal to the difference etween the numer of even and odd permutations of such type Then calculating in expressions 1 deta±pera) the coefficient on k, we get the numer of even and odd permutations of such kind 7
8 Let us give an example of the application of this scheme Let π e a permutation Recall that a numer i for which πi) i is called a weak excedance of π [10], p 40) Let us find the numer of even and odd permutations of order n with exactly k weak excedances Consider a inary matrix of order n C n whose elements on the main diagonal and aove it are equal to, and other elements are equal to 1: C n = 1 It is well known [10], p 39 40) that the permanent of this matrix is equal to the Eulerian polynomial of order n, and, respectively, the coefficient on k is equal to the Eulerian numer Tn,k) A0089 in [9]) By the formula ) we get that detc n = 1) n 1 It follows that the coefficient on k in detc n is equal to: ) n 1 cn,k) = 1) n k k 1 Hencethenumerofevenandoddpermutationsofordernwithexactly k weakexcedances is equal to: e n,k = 1 )) n 1 Tn,k)+ 1) n k, o n,k = 1 )) n 1 Tn,k) 1) n k k 1 k 1 Let, for example, k = Then e n, = 1 Tn,)+ 1)n n 1)), o n, = 1 Tn,) 1)n n 1)) and we get the following tale: n Tn,) cn,) e n, o n, Let us write out all permutations of order 4 with weak excedances: 143, 143, 413, 314, 314, 341, 341, 413, 413, 431, 431 total 7 even and 4 odd permutations weak excedances are in old, even permutations are underlined) Acknowledgment The author is grateful to VS Shevelev for useful pointers to the literature and comments Referenses [1] Boston N Spaces of constant rank matrices over GF) // Electronic Journal of Linear Algera 010 Vol 0 P 1 5 [] Seerry J, Xia T, Koukouvinos C, Mitrouli M The maximal determinant and sudeterminants of ±1 matrices // Linear Algera and its Applications 003 Vol 373 P [3] Brualdi R A, Ryser H J Cominatorial matrix theory Camridge University Press, 1991 [4] Minc H Permanents Reading, MA: Addison-Wesley,
9 [5] Ryser H J Cominatorial Mathematics Mathematical Association of America, 1963 [6] Shevelev V S Some prolems of the theory of enumerating the permutations with restricted position // Journal of Soviet Mathematics 199 Vol 614) P [7] Kravvaritis Ch Determinant evaluations for inary circulant matrices // Special Matrices 014 Vol P [8] Golu J H, Van Loan C F Matrix computations The Johns Hopkins University Press, 1996 [9] Sloane N J A The On-Line Encyclopedia of Integer Sequences Availale at [10] Stanley R P Enumerative Cominatorics Volume 1 Camridge University Press, nd edition, p 9
Upper Bounds for Stern s Diatomic Sequence and Related Sequences
Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:
More informationExpansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2
Least squares: Mathematical theory Below we provide the "vector space" formulation, and solution, of the least squares prolem. While not strictly necessary until we ring in the machinery of matrix algera,
More information1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS
1Numer systems: real and complex 1.1 Kick off with CAS 1. Review of set notation 1.3 Properties of surds 1. The set of complex numers 1.5 Multiplication and division of complex numers 1.6 Representing
More informationNOTE. A Note on Fisher's Inequality
journal of cominatorial theory, Series A 77, 171176 (1997) article no. TA962729 NOTE A Note on Fisher's Inequality Douglas R. Woodall Department of Mathematics, University of Nottingham, Nottingham NG7
More informationSection 2.1: Reduce Rational Expressions
CHAPTER Section.: Reduce Rational Expressions Section.: Reduce Rational Expressions Ojective: Reduce rational expressions y dividing out common factors. A rational expression is a quotient of polynomials.
More informationERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA)
ERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA) General information Availale time: 2.5 hours (150 minutes).
More informationQUADRATIC EQUATIONS EXPECTED BACKGROUND KNOWLEDGE
6 QUADRATIC EQUATIONS In this lesson, you will study aout quadratic equations. You will learn to identify quadratic equations from a collection of given equations and write them in standard form. You will
More information1 Caveats of Parallel Algorithms
CME 323: Distriuted Algorithms and Optimization, Spring 2015 http://stanford.edu/ reza/dao. Instructor: Reza Zadeh, Matroid and Stanford. Lecture 1, 9/26/2015. Scried y Suhas Suresha, Pin Pin, Andreas
More informationGeneralized Reed-Solomon Codes
Chapter 5 Generalized Reed-Solomon Codes In 1960, I.S. Reed and G. Solomon introduced a family of error-correcting codes that are douly lessed. The codes and their generalizations are useful in practice,
More informationZeroing the baseball indicator and the chirality of triples
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.1.7 Zeroing the aseall indicator and the chirality of triples Christopher S. Simons and Marcus Wright Department of Mathematics
More informationMATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases
MATH 225: Foundations of Higher Matheamatics Dr. Morton 3.4: Proof y Cases Chapter 3 handout page 12 prolem 21: Prove that for all real values of y, the following inequality holds: 7 2y + 2 2y 5 7. You
More informationIN this paper we study a discrete optimization problem. Constrained Shortest Link-Disjoint Paths Selection: A Network Programming Based Approach
Constrained Shortest Link-Disjoint Paths Selection: A Network Programming Based Approach Ying Xiao, Student Memer, IEEE, Krishnaiyan Thulasiraman, Fellow, IEEE, and Guoliang Xue, Senior Memer, IEEE Astract
More information3.5 Solving Quadratic Equations by the
www.ck1.org Chapter 3. Quadratic Equations and Quadratic Functions 3.5 Solving Quadratic Equations y the Quadratic Formula Learning ojectives Solve quadratic equations using the quadratic formula. Identify
More informationSchool of Business. Blank Page
Equations 5 The aim of this unit is to equip the learners with the concept of equations. The principal foci of this unit are degree of an equation, inequalities, quadratic equations, simultaneous linear
More informationSolving Systems of Linear Equations Symbolically
" Solving Systems of Linear Equations Symolically Every day of the year, thousands of airline flights crisscross the United States to connect large and small cities. Each flight follows a plan filed with
More informationSU(N) representations
Appendix C SU(N) representations The group SU(N) has N 2 1 generators t a which form the asis of a Lie algera defined y the commutator relations in (A.2). The group has rank N 1 so there are N 1 Casimir
More informationERASMUS UNIVERSITY ROTTERDAM
Information concerning Colloquium doctum Mathematics level 2 for International Business Administration (IBA) and International Bachelor Economics & Business Economics (IBEB) General information ERASMUS
More informationTechnical Appendix: Imperfect information and the business cycle
Technical Appendix: Imperfect information and the usiness cycle Farice Collard Harris Dellas Frank Smets March 29 We would like to thank Marty Eichenaum, Jesper Lindé, Thomas Luik, Frank Schorfheide and
More informationSVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof)
JOURNAL OF MODERN DYNAMICS VOLUME 4, NO. 4, 010, 637 691 doi: 10.3934/jmd.010.4.637 STRUCTURE OF ATTRACTORS FOR (a, )-CONTINUED FRACTION TRANSFORMATIONS SVETLANA KATOK AND ILIE UGARCOVICI (Communicated
More informationThe maximal determinant and subdeterminants of ±1 matrices
Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,
More informationApprentice Program: Linear Algebra
Apprentice Program: Linear Algebra Instructor: Miklós Abért Notes taken by Matt Holden and Kate Ponto June 26,2006 1 Matrices An n k matrix A over a ring R is a collection of nk elements of R, arranged
More informationA Tabu Search Algorithm to Construct BIBDs Using MIP Solvers
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, Septemer 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 179 189 A Tau Search Algorithm to Construct
More informationPolynomial Degree and Finite Differences
CONDENSED LESSON 7.1 Polynomial Degree and Finite Differences In this lesson, you Learn the terminology associated with polynomials Use the finite differences method to determine the degree of a polynomial
More informationDeterminant evaluations for binary circulant matrices
Spec Matrices 014; :187 199 Research Article Open Access Christos Kravvaritis* Determinant evaluations for binary circulant matrices Abstract: Determinant formulas for special binary circulant matrices
More informationab is shifted horizontally by h units. ab is shifted vertically by k units.
Algera II Notes Unit Eight: Eponential and Logarithmic Functions Sllaus Ojective: 8. The student will graph logarithmic and eponential functions including ase e. Eponential Function: a, 0, Graph of an
More informationGenetic Algorithms applied to Problems of Forbidden Configurations
Genetic Algorithms applied to Prolems of Foridden Configurations R.P. Anstee Miguel Raggi Department of Mathematics University of British Columia Vancouver, B.C. Canada V6T Z2 anstee@math.uc.ca mraggi@gmail.com
More informationVector spaces. EE 387, Notes 8, Handout #12
Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is
More informationCHAPTER 5. Linear Operators, Span, Linear Independence, Basis Sets, and Dimension
A SERIES OF CLASS NOTES TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS LINEAR CLASS NOTES: A COLLECTION OF HANDOUTS FOR REVIEW AND PREVIEW OF LINEAR THEORY
More informationCOMBINATORIAL MINORS FOR MATRIX FUNCTIONS AND THEIR APPLICATIONS
ZESZYTY NAUKOWE POLITECHNIKI ŚLĄSKIEJ 2014 Seria: MATEMATYKA STOSOWANA z. 4 Nr kol. 1920 Vladimir SHEVELEV Department of Mathematics Ben-Gurion University of the Negev COMBINATORIAL MINORS FOR MATRIX FUNCTIONS
More informationProperties of proper rational numbers
arxiv:1109.6820v1 [math.gm] 29 Sep 2011 Properties of proper rational numers Konstantine Zelator Mathematics, Statistics, and Computer Science 212 Ben Franklin Hall Bloomsurg University of Pennsylvania
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationSection 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices
3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices 1 Section 3.2. Multiplication of Matrices and Multiplication of Vectors and Matrices Note. In this section, we define the product
More informationNew duality operator for complex circulant matrices and a conjecture of Ryser
New duality operator for complex circulant matrices and a conjecture of Ryser Luis H. Gallardo Mathematics University of Brest Brest, France Luis.Gallardo@univ-brest.fr Submitted: May 6, 2015; Accepted:
More informationsum of squared error.
IT 131 MATHEMATCS FOR SCIENCE LECTURE NOTE 6 LEAST SQUARES REGRESSION ANALYSIS and DETERMINANT OF A MATRIX Source: Larson, Edwards, Falvo (2009): Elementary Linear Algebra, Sixth Edition You will now look
More informationMath 1314 Week #14 Notes
Math 3 Week # Notes Section 5.: A system of equations consists of two or more equations. A solution to a system of equations is a point that satisfies all the equations in the system. In this chapter,
More information1 Systems of Differential Equations
March, 20 7- Systems of Differential Equations Let U e an open suset of R n, I e an open interval in R and : I R n R n e a function from I R n to R n The equation ẋ = ft, x is called a first order ordinary
More informationIMVI ISSN (p) , ISSN Open Mathematical Education Notes Vol. 3 (2013), / JOURNALS / IMVI OMEN
IMVI ISSN (p) 2303-4882 ISSN 1840-4383 Open Mathematical Education Notes Vol. 3 (2013) 17-29 www.imvil.org / JOURNALS / IMVI OMEN FROM PASCAL S TRIANGLE TO A MATHEMATICAL FRONTIER: UNCOVERING HIDDEN PATTERNS
More informationObjectives To solve equations by completing the square To rewrite functions by completing the square
4-6 Completing the Square Content Standard Reviews A.REI.4. Solve quadratic equations y... completing the square... Ojectives To solve equations y completing the square To rewrite functions y completing
More informationarxiv: v1 [math.nt] 27 May 2018
SETTLIG SOME SUM SUPPOSITIOS TAAY WAKHARE AD CHRISTOPHE VIGAT arxiv:180510569v1 matht] 7 May 018 Astract We solve multiple conjectures y Byszewsi and Ulas aout the sum of ase digits function In order to
More informationRobot Position from Wheel Odometry
Root Position from Wheel Odometry Christopher Marshall 26 Fe 2008 Astract This document develops equations of motion for root position as a function of the distance traveled y each wheel as a function
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationis a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ]
Matrices: Definition: An m n matrix, A m n is a rectangular array of numbers with m rows and n columns: a, a, a,n a, a, a,n A m,n =...... a m, a m, a m,n Each a i,j is the entry at the i th row, j th column.
More informationJournal of Integer Sequences, Vol. 3 (2000), Article Magic Carpets
Journal of Integer Sequences, Vol. 3 (2000), Article 00.2.5 Magic Carpets Erich Friedman Stetson University Deland, FL 32720 Mike Keith 4100 Vitae Springs Road Salem, OR 97306 Email addresses: efriedma@stetson.edu
More informationarxiv: v1 [math.co] 4 Mar 2010
NUMBER OF COMPOSITIONS AND CONVOLVED FIBONACCI NUMBERS arxiv:10030981v1 [mathco] 4 Mar 2010 MILAN JANJIĆ Abstract We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationWhen two letters name a vector, the first indicates the and the second indicates the of the vector.
8-8 Chapter 8 Applications of Trigonometry 8.3 Vectors, Operations, and the Dot Product Basic Terminology Algeraic Interpretation of Vectors Operations with Vectors Dot Product and the Angle etween Vectors
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 2054 2066 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa An eigenvalue
More informationSOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 2 NOVEMBER 2016
SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY NOVEMBER 06 Mark Scheme: Each part of Question is worth 4 marks which are awarded solely for the correct answer.
More informationMATH 2050 Assignment 8 Fall [10] 1. Find the determinant by reducing to triangular form for the following matrices.
MATH 2050 Assignment 8 Fall 2016 [10] 1. Find the determinant by reducing to triangular form for the following matrices. 0 1 2 (a) A = 2 1 4. ANS: We perform the Gaussian Elimination on A by the following
More informationPolynomials Characterizing Hyper b-ary Representations
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.4.3 Polynomials Characterizing Hyper -ary Representations Karl Dilcher 1 Department of Mathematics and Statistics Dalhousie University
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationReview for Exam 2/Solutions
MTH 310-3 Astract Algera I and Numer Theory S18 Review for Eam 2/Solutions 1. Let n e an integer. (a) For 0 n 10, verify that n 2 n + 11 is a prime. () If n 0, 1 and n 0, 1 (mod 11), show that n 2 n +
More informationOn the Hadamard Product of Fibonacci Q n matrix and Fibonacci Q n matrix
Int J Contemp Math Sciences, Vol, 006, no 6, 753-76 On the Hadamard Product of Fibonacci Q n matrix and Fibonacci Q n matrix Ayşe NALLI Department of Mathematics, Selcuk University 4070, Campus-Konya,
More informationOn the Complexity of the BKW Algorithm on LWE
On the Complexity of the BKW Algorithm on LWE Martin R. Alrecht 1, Carlos Cid 3, Jean-Charles Faugère, Roert Fitzpatrick 3, and Ludovic Perret 1 Technical University of Denmark, Denmark INRIA, Paris-Rocquencourt
More informationELA
CRITICAL EXPONENTS: OLD AND NEW CHARLES R. JOHNSON AND OLIVIA WALCH. Abstract. For Hadamard and conventional powering, we survey past and current work on the existence and values of critical exponents
More informationMathematics Background
UNIT OVERVIEW GOALS AND STANDARDS MATHEMATICS BACKGROUND UNIT INTRODUCTION Patterns of Change and Relationships The introduction to this Unit points out to students that throughout their study of Connected
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationLinear Programming. Our market gardener example had the form: min x. subject to: where: [ acres cabbages acres tomatoes T
Our market gardener eample had the form: min - 900 1500 [ ] suject to: Ñ Ò Ó 1.5 2 â 20 60 á ã Ñ Ò Ó 3 â 60 á ã where: [ acres caages acres tomatoes T ]. We need a more systematic approach to solving these
More informationCompleting the Square
3.5 Completing the Square Essential Question How can you complete the square for a quadratic epression? Using Algera Tiles to Complete the Square Work with a partner. Use algera tiles to complete the square
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationTwisted integral orbit parametrizations
Institute for Advanced Study 4 Octoer 017 Disclaimer All statements are to e understood as essentially true (i.e., true once the statement is modified slightly). Arithmetic invariant theory This talk is
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More information1 2 2 Circulant Matrices
Circulant Matrices General matrix a c d Ax x ax + cx x x + dx General circulant matrix a x ax + x a x x + ax. Evaluating the Eigenvalues Find eigenvalues and eigenvectors of general circulant matrix: a
More informationA Geometric Approach to Carlitz-Dedekind Sums
A Geometric Approach to Carlitz-Dedekind Sums A thesis presented to the faculty of San Francisco State University In partial fulfilment of The requirements for The degree Master of Arts In Mathematics
More informationNew Constructions of Sonar Sequences
INTERNATIONAL JOURNAL OF BASIC & APPLIED SCIENCES IJBAS-IJENS VOL.:14 NO.:01 12 New Constructions of Sonar Sequences Diego F. Ruiz 1, Carlos A. Trujillo 1, and Yadira Caicedo 2 1 Department of Mathematics,
More informationMinimizing a convex separable exponential function subject to linear equality constraint and bounded variables
Minimizing a convex separale exponential function suect to linear equality constraint and ounded variales Stefan M. Stefanov Department of Mathematics Neofit Rilski South-Western University 2700 Blagoevgrad
More information#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES
#A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York jthiel@citytech.cuny.edu Received: 6/11/13, Revised:
More informationCirculant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv: v1 [math.co] 26 Nov 2017
Circulant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv:1711.09373v1 [math.co] 26 Nov 2017 J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona October
More informationMATRIX INTEGRALS AND MAP ENUMERATION 2
MATRIX ITEGRALS AD MAP EUMERATIO 2 IVA CORWI Abstract. We prove the generating function formula for one face maps and for plane diagrams using techniques from Random Matrix Theory and orthogonal polynomials.
More informationLinks Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers
Links Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers arxiv:1611.09181v1 [math.co] 28 Nov 2016 Denis Neiter and Amsha Proag Ecole Polytechnique Route de Saclay 91128 Palaiseau
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More information1 - Systems of Linear Equations
1 - Systems of Linear Equations 1.1 Introduction to Systems of Linear Equations Almost every problem in linear algebra will involve solving a system of equations. ü LINEAR EQUATIONS IN n VARIABLES We are
More informationTibor ILLèS. Katalin MèSZêROS
Yugoslav Journal of Operations Research 11 (2001), Numer 1 15-30 A NEW AND CONSRUCIVE PROOF OF WO ASIC RESULS OF LINEAR PROGRAMMING * ior ILLèS Department of Operations Research E tv s LorÃnd University
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Updated: April 14, 017 Total Positivity The final and historically the original motivation is from the study of total positive matrices, which
More informationChapter 9: Systems of Equations and Inequalities
Chapter 9: Systems of Equations and Inequalities 9. Systems of Equations Solve the system of equations below. By this we mean, find pair(s) of numbers (x, y) (if possible) that satisfy both equations.
More informationA Short Overview of Orthogonal Arrays
A Short Overview of Orthogonal Arrays John Stufken Department of Statistics University of Georgia Isaac Newton Institute September 5, 2011 John Stufken (University of Georgia) Orthogonal Arrays September
More informationarxiv: v1 [math.nt] 17 Nov 2011
On the representation of k sequences of generalized order-k numbers arxiv:11114057v1 [mathnt] 17 Nov 2011 Kenan Kaygisiz a,, Adem Sahin a a Department of Mathematics, Faculty of Arts Sciences, Gaziosmanpaşa
More informationQuivers. Virginia, Lonardo, Tiago and Eloy UNICAMP. 28 July 2006
Quivers Virginia, Lonardo, Tiago and Eloy UNICAMP 28 July 2006 1 Introduction This is our project Throughout this paper, k will indicate an algeraically closed field of characteristic 0 2 Quivers 21 asic
More informationSection 3.3. Matrix Rank and the Inverse of a Full Rank Matrix
3.3. Matrix Rank and the Inverse of a Full Rank Matrix 1 Section 3.3. Matrix Rank and the Inverse of a Full Rank Matrix Note. The lengthy section (21 pages in the text) gives a thorough study of the rank
More informationOn Worley s theorem in Diophantine approximations
Annales Mathematicae et Informaticae 35 (008) pp. 61 73 http://www.etf.hu/ami On Worley s theorem in Diophantine approximations Andrej Dujella a, Bernadin Irahimpašić a Department of Mathematics, University
More informationOptimal Routing in Chord
Optimal Routing in Chord Prasanna Ganesan Gurmeet Singh Manku Astract We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected
More informationPermanents and Determinants of Tridiagonal Matrices with (s, t)-pell Numbers
International Mathematical Forum, Vol 12, 2017, no 16, 747-753 HIKARI Ltd, wwwm-hikaricom https://doiorg/1012988/imf20177652 Permanents and Determinants of Tridiagonal Matrices with (s, t)-pell Numbers
More informationx y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2
5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationELEMENTARY MATRIX ALGEBRA
ELEMENTARY MATRIX ALGEBRA Third Edition FRANZ E. HOHN DOVER PUBLICATIONS, INC. Mineola, New York CONTENTS CHAPTER \ Introduction to Matrix Algebra 1.1 Matrices 1 1.2 Equality of Matrices 2 13 Addition
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationDivide-and-Conquer. Reading: CLRS Sections 2.3, 4.1, 4.2, 4.3, 28.2, CSE 6331 Algorithms Steve Lai
Divide-and-Conquer Reading: CLRS Sections 2.3, 4.1, 4.2, 4.3, 28.2, 33.4. CSE 6331 Algorithms Steve Lai Divide and Conquer Given an instance x of a prolem, the method works as follows: divide-and-conquer
More informationIntroduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX
Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX September 2007 MSc Sep Intro QT 1 Who are these course for? The September
More informationDomino Tilings with Barriers
Journal of Cominatorial Theory, Series A 87, 347356 (1999) Article ID jcta.1999.2967, availale online at http:www.idealirary.com on Domino Tilings with Barriers James Propp Department of Mathematics, University
More informationMATH2210 Notebook 2 Spring 2018
MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................
More informationSOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS
#A42 INTEGERS 14 (2014) SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS Benjamin V. Holt Department of Mathematics, Humoldt State University, Arcata, California vh6@humoldt.edu Received:
More informationLecture Introduction. 2 Linear codes. CS CTT Current Topics in Theoretical CS Oct 4, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 4, 01 Lecturer: Elena Grigorescu Lecture 14 Scribe: Selvakumaran Vadivelmurugan 1 Introduction We introduced error-correcting codes and linear codes in
More informationRATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS. February 6, 2006
RATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS ATOSHI CHOWDHURY, LESLIE HOGBEN, JUDE MELANCON, AND RANA MIKKELSON February 6, 006 Abstract. A sign pattern is a
More informationConstruction of quasi-cyclic self-dual codes
Construction of quasi-cyclic self-dual codes Sunghyu Han, Jon-Lark Kim, Heisook Lee, and Yoonjin Lee December 17, 2011 Abstract There is a one-to-one correspondence between l-quasi-cyclic codes over a
More information