Periodic properties of matrices
|
|
- Ilene Underwood
- 5 years ago
- Views:
Transcription
1 Periodic properties of matrices Technická univerzita Košice
2 References 1 E. Draženská, M. Molnárová, Periods of Monge matrices with zero-weight cycles, Proc. of the Conf. Informatics and Algorithms, Prešov (1998), M. Molnárová, Periods of matrices with zero-weight cycles in max-algebra, Tatra Mountains Math. Publ. 16 (1999), M. Molnárová, Computational complexity of Nachtigall s representation, Optimization 52 (2003), M. Molnárová, J. Pribiš, Matrix period in max-algebra, Discrete Appl. Math. 103 (2000), M. Molnárová Generalized matrix period in max-plus algebra, Linear Algebra and its Applications 404 (2005),
3 Content 1 Periodic properties of matrices Periodic matrices with zero weight cycles Sufficient and necessary condition for matrix periodicity Linear periodic matrices
4 Periodic matrices with zero weight cycles Periodic behaviour of matrix - Example 1 A = A 2 = A 3 = ε 1 ε ε ε 1 0 ε ε ε ε 0 1 ε ε ε 1 ε 0 ε ε ε 0 ε ε ε 0 = A 4 = A 5 = A 6.
5 Periodic matrices with zero weight cycles Periodic behaviour of matrix - Example 2 A= ε 1 ε ε ε ε ε ε 0 A 2 = 1 1 ε... A 4 = ε A 5 = = A A 6 = A 7 = = A 9 = A 10 ε
6 Periodic matrices with zero weight cycles Periodic behaviour of matrix - Example 3 A= ε 1 ε ε ε ε A 2 = A 5 = ε ε ε ε A 4 = = A 6 =... ε
7 Periodic matrices with zero weight cycles Periodic matrices - Definition Definition Let A G (n, n). We say, that A is almost periodic, if for all i, j is the sequence a ij = ( a (r) ij ; r N + ) almost periodic, i. e. ( p > 0) ( R) ( r > R) a (r+p) ij = a (r) ij. The smallest number p with above property is the period of aij with notation per(aij ). The period of A is defined as per(a) = lcm{ per(a ij); i, j N }.
8 Periodic matrices with zero weight cycles Zero-weight matrices Definition Let A G (n, n). We say that A fulfills the cycle-condition, if the weight of any cycle in the digraph G(A) is equal to zero, in notation w(c) = 0. A = ε 2 ε ε ε ε ε ε 1 ε ε ε 1 1 ε 5 ε ε ε ε ε ε 2 ε ε ε ε 2 ε 8 ε ε ε ε ε ε
9 Periodic matrices with zero weight cycles Period of strongly connected component - Definition Definition Let A G (n, n). The set of all non-trivial strongly connected components of G(A) is denoted by SCC (G(A)) and the set of all strongly connected components by SCC(G(A)). We denote by λ(k) the maximum mean weight of the cycles in K SCC(G(A)). We define the period of K SCC (G(A)) as per(k) = gcd { c ; c je cyklus v K, c > 0 }. If K is trivial, then per(k) = 0. A 11 = ε 2 ε ε ε ε per(k 1 ) = gcd { 2, 3 } = 1
10 Periodic matrices with zero weight cycles Sufficient condition for matrix periodicity Theorem Let A G (n, n) fulfill the cycle-condition. Let d N. Then the following assertions are equivalent (i) per(a) d, (ii) ( K SCC (G)) per(k) d. Theorem Let A G (n, n) fulfill the cycle-condition. Then per(a) = lcm { per(k); K SCC (G) }
11 Periodic matrices with zero weight cycles Algorithm for checking the sufficient condition for matrix periodicity Theorem Let A G (n, n).the cycle-condition can be verified in O(n 3 ) time. 1 find (A) 2 check δ ii 0, for all i 3 find (A ) (conjugated matrix) 4 check δ ii 0, for all i 0 min max 0 = equalities hold
12 Periodic matrices with zero weight cycles Algorithm for computing the matrix period Theorem Let A G (n, n) fulfill the cycle-condition. Then period per(a) can be computed in O(n 3 ) time. 1 find all strongly connected components in O(n 3 ) time by (A) (δ ij and δ ji finite) 2 compute the period of each s.c.c. in O(n 2 ) time by Balcer-Veinott algorithm 3 compute per(a) in O(n log n) time as the least common multiple of the periods of all non-trivial s.c.c. by Euclid algorithm for computation of the greatest common divisor gcd{a, b} ab lcm{a, b} = gcd{a, b}
13 Periodic matrices with zero weight cycles Period of matrix - Example Example: Check the cycle-condition and compute the period of the given matrix in positive case. ε 2 ε ε ε ε ε ε 1 ε ε ε A = 1 1 ε 5 ε ε ε ε ε ε 2 ε ε ε ε 2 ε 8 ε ε ε ε ε ε Solution: K 1 = {1, 2, 3} per(k 1 ) = gcd { 2, 3 } = 1 K 2 = {4, 5} per(k 2 ) = gcd { 2 } = 2 per(a) = lcm { per(k); K SCC (G) } = lcm { 2, 1 } = 2
14 Periodic matrices with zero weight cycles Period of matrix - Example A 10 = ɛ ɛ ε 0 ε 10 A 11 = ε ε ε ε 2 ε ε ε ε ε 0 ε ε ε ε 2 ε 8 ε ε ε ε ε ε ε ε ε ε ε ε A 12 = ε ε ε 0 ε 10 A 13 = ε ε ε ε 2 ε ε ε ε ε 0 ε ε ε ε 2 ε 8 ε ε ε ε ε ε ε ε ε ε ε ε
15 Sufficient and necessary condition for matrix periodicity Highly connected components A = ε 2 ε ε ε ε 2 ε 3 ε ε ε ε ε ε 0 ε ε ε ε 1 ε 1 0 ε ε 1 ε ε ε ε ε ε 1 ε ε G(A)
16 Sufficient and necessary condition for matrix periodicity Period of highly connected component - Definition Definition Let A G (n, n). We say that two nodes i, j G(A) are highly connected, in notation: i h j, if i, j are contained in a cycle c with maximal cycle mean value w(c) = λ(a). The subdigraphs induced by the equivalence classes of the reflexive hull of h are called highly connected components in G(A), the set of all such components is denoted by HCC(G(A)). A component K HCC(G(A)) is called trivial, if K contains no cycle of positive length with cycle mean value equal to λ(a). The set of all non-trivial components K HCC(G(A)) is denoted by HCC (G(A)). For any K HCC(G(A)), the high period of K is defined as hper(k) = gcd { c ; c is a cycle in K, c > 0, w(c) = λ(a) }. If K is trivial, then hper(k) = 0.
17 Sufficient and necessary condition for matrix periodicity Highly connected components A 22 = ε 0 ε ε 1 ε ε ε ε ε 1 ε ε G(A 22 )
18 Sufficient and necessary condition for matrix periodicity Sufficient and necessary condition for matrix periodicity Theorem Let A G (n, n), then the statements (i) A is almost periodic, (ii) ( K SCC (G(A)) ) λ(k) = 0 are equivalent. Theorem Let A G (n, n)is almost periodic. Then per(a) = lcm { hper(k); K HCC (G(A)) }
19 Sufficient and necessary condition for matrix periodicity Algorithm for checking periodicity and computing matrix period Theorem There is an O(n 3 ) algorithm A, which decides for a given matrix A G (n, n) whether A is almost periodic and computes per(a) in the positive case. 1 find all strongly connected components in O(n 3 ) time by (A) (δ ij and δ ji finite) 2 compute λ(k) for all non-trivial strongly connected components in O(n 3 ) time by Karp algorithm 3 find all highly connected components and their periods in O(n 3 ) time by Gavalec algorithm
20 Sufficient and necessary condition for matrix periodicity Algorithm for checking periodicity and computing matrix period 4 compute per(a) in O(n log n) time as the least common multiple of the periods of all non-trivial s.c.c. by Euclid algorithm for computation of the greatest common divisor gcd{a, b} ab lcm{a, b} = gcd{a, b}
21 Sufficient and necessary condition for matrix periodicity Gavalec algorithm for finding HCC and the high periods Theorem Let A G (n, n). Let K HCC (G(A)). If an arc e E(K) is not contained in a zero-cycle, then hper(k) = hper(k e). Theorem Let A G (n, n). Let K HCC (G(A)). If every arc e E(K) is contained in a zero-cycle, then the mean value of any cycle in K is zero and hper(k) = per(k). D: a ij + δ ji 0
22 Sufficient and necessary condition for matrix periodicity Gavalec algorithm for finding HCC and the high periods
23 Sufficient and necessary condition for matrix periodicity Period of matrix - Example Example: Check the periodicity and compute the period of the given matrix in positive case. ε 2 ε ε ε ε 2 ε 3 ε ε ε A = ε ε ε 0 ε ε ε ε 1 ε 1 0 ε ε 1 ε ε ε ε ε ε 1 ε ε Solution: K 1 = {1, 2} hper(k 1 ) = 2 K 2 = {3, 4, 5} hper(k 2 ) = 3 per(a) = lcm { hper(k); K HCC (G(A)) } = lcm { 2, 3 } = 6
24 Sufficient and necessary condition for matrix periodicity Period of matrix - Example ε ε A 9 = ε ε ε ε = A 15 =... ε ε ε ε ε ε A 10 = ε ε ε ε = A 16 =... ε ε ε ε
25 Linear periodic matrices Linear period of matrix - Example A = ε 0 ε ε ε ε 4 ε 5 ε ε ε ε ε ε 2 ε ε ε ε 1 ε 3 2 ε ε 1 ε ε ε ε ε ε 1 ε ε G(A)
26 Linear periodic matrices Linear period of matrix - Example ε ε A 9 = ε ε ε ε A 15 = ε ε ε ε ε ε A 10 = ε ε ε ε A 16 = ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε ε
27 Linear periodic matrices Linear period of matrix - Definition Definition Let A G (n, n). We say, that A is almost linear periodic, if for all i, j is the sequence a ij = ( a (r) ij ; r N + ) almost linear periodic, i. e. ( p > 0) ( R ij ) ( q ij R ) ( r > R ij ) a (r+p) ij = a (r) ij + p q ij. The smallest number p with above property is the linear period of aij with notation lper(aij ). The element q ij is the linear factor of aij with notation lfac(aij ). The smallest number R ij is the linear defect of aij with notation ldef(aij ). The linear period of A is defined as lper(a) = lcm{ lper(a ij); i, j N }. The matrix lfac(a) = (lfac(aij )) is called the linear factor matrix of A. The number ldef(a) = max{r ij } is called the linear defect of A.
28 Linear periodic matrices Sufficient condition for matrix linear periodicity Theorem Let A G (n, n). Let ( K SCC (G(A)) ) be λ(k) = λ(a). Then (i) A is almost linear periodic with lfac(a) = Q, q ij = λ(a), i, j, (ii) for linear periodicity of A holds lper(a) = lcm { hper(k); K HCC (G(A)) }. Theorem There is an O(n 3 ) algorithm A, which decides for a given matrix A G (n, n) whether A is almost linear periodic with a constant linear factor matrix and computes lper(a) in the positive case.
29 Ďakujem za pozornosť.
Generalized matrix period in max-plus algebra
Linear Algebra and its Applications 404 (2005) 345 366 www.elsevier.com/locate/laa Generalized matrix period in max-plus algebra Monika Molnárová Department of Mathematics, Faculty of Electrical Engineering,
More informationMax-plus algebra. Max-plus algebra. Monika Molnárová. Technická univerzita Košice. Max-plus algebra.
Technická univerzita Košice monika.molnarova@tuke.sk Outline 1 Digraphs Maximum cycle-mean and transitive closures of a matrix Reducible and irreducible matrices Definite matrices Digraphs Complete digraph
More informationMatrix period in max-drast fuzzy algebra
Matrix period in max-drast fuzzy algebra Martin Gavalec 1, Zuzana Němcová 2 Abstract. Periods of matrix power sequences in max-drast fuzzy algebra and methods of their computation are considered. Matrix
More informationNonnegative Matrices I
Nonnegative Matrices I Daisuke Oyama Topics in Economic Theory September 26, 2017 References J. L. Stuart, Digraphs and Matrices, in Handbook of Linear Algebra, Chapter 29, 2006. R. A. Brualdi and H. J.
More informationAn O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra
Discrete Applied Mathematics 127 (2003) 651 656 Short Note www.elsevier.com/locate/dam An O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra Martin Gavalec a;,jan Plavka b a Department
More informationCSR EXPANSIONS OF MATRIX POWERS IN MAX ALGEBRA
CSR EXPANSIONS OF MATRIX POWERS IN MAX ALGEBRA SERGEĭ SERGEEV AND HANS SCHNEIDER Abstract. We study the behavior of max-algebraic powers of a reducible nonnegative matrix A R n n +. We show that for t
More informationINTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
More informationThe Miracles of Tropical Spectral Theory
The Miracles of Tropical Spectral Theory Emmanuel Tsukerman University of California, Berkeley e.tsukerman@berkeley.edu July 31, 2015 1 / 110 Motivation One of the most important results in max-algebra
More informationIntroduction to Number Theory
Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility, greatest common divisors, least common multiples, and modular
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationAn Algorithm for Prime Factorization
An Algorithm for Prime Factorization Fact: If a is the smallest number > 1 that divides n, then a is prime. Proof: By contradiction. (Left to the reader.) A multiset is like a set, except repetitions are
More informationCISC-102 Fall 2017 Week 6
Week 6 page 1! of! 15 CISC-102 Fall 2017 Week 6 We will see two different, yet similar, proofs that there are infinitely many prime numbers. One proof would surely suffice. However, seeing two different
More informationProofs. Methods of Proof Divisibility Floor and Ceiling Contradiction & Contrapositive Euclidean Algorithm. Reading (Epp s textbook)
Proofs Methods of Proof Divisibility Floor and Ceiling Contradiction & Contrapositive Euclidean Algorithm Reading (Epp s textbook) 4.3 4.8 1 Divisibility The notation d n is read d divides n. Symbolically,
More informationIntermediate Math Circles Number Theory II Problems and Solutions
WWW.CEMC.UWATERLOO.CA The CENTRE for EDUCATION in MATHEMATICS and COMPUTING Intermediate Math Circles Number Theory II Problems and Solutions 1. The difference between the gcd and lcm of the numbers 10,
More informationLecture 7.4: Divisibility and factorization
Lecture 7.4: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More information2 Elementary number theory
2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},
More informationMath 547, Exam 1 Information.
Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:10-11:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationWriting Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationcse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska
cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say
More informationCS280, Spring 2004: Prelim Solutions
CS280, Spring 2004: Prelim Solutions 1. [3 points] What is the transitive closure of the relation {(1, 2), (2, 3), (3, 1), (3, 4)}? Solution: It is {(1, 2), (2, 3), (3, 1), (3, 4), (1, 1), (2, 2), (3,
More informationIntegers and Division
Integers and Division Notations Z: set of integers N : set of natural numbers R: set of real numbers Z + : set of positive integers Some elements of number theory are needed in: Data structures, Random
More information(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
More informationObjective Type Questions
DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014
More informationGeneralized GCD matrices
Acta Univ Sapientiae, Mathematica, 2, 2 (2010) 160 167 Generalized GCD matrices Antal Bege Sapientia Hungarian University of Transylvania Department of Mathematics and Informatics, Târgu Mureş, Romania
More information3 The fundamentals: Algorithms, the integers, and matrices
3 The fundamentals: Algorithms, the integers, and matrices 3.4 The integers and division This section introduces the basics of number theory number theory is the part of mathematics involving integers
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationMath 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6
Math 131 notes Jason Riedy 6 October, 2008 Contents 1 Modular arithmetic 2 2 Divisibility rules 3 3 Greatest common divisor 4 4 Least common multiple 4 5 Euclidean GCD algorithm 5 6 Linear Diophantine
More informationGreatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Greatest Common Divisor Benjamin V.C. Collins James A. Swenson The world s least necessary definition Definition Let a, b Z, not both zero. The largest integer d such that d a and d b is called
More informationDo not open this exam until you are told to begin. You will have 75 minutes for the exam.
Math 2603 Midterm 1 Spring 2018 Your Name Student ID # Section Do not open this exam until you are told to begin. You will have 75 minutes for the exam. Check that you have a complete exam. There are 5
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationMath.3336: Discrete Mathematics. Primes and Greatest Common Divisors
Math.3336: Discrete Mathematics Primes and Greatest Common Divisors Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationWednesday, February 21. Today we will begin Course Notes Chapter 5 (Number Theory).
Wednesday, February 21 Today we will begin Course Notes Chapter 5 (Number Theory). 1 Return to Chapter 5 In discussing Methods of Proof (Chapter 3, Section 2) we introduced the divisibility relation from
More informationSolutions Math 308 Homework 9 11/20/2018. Throughout, let a, b, and c be non-zero integers.
Throughout, let a, b, and c be non-zero integers. Solutions Math 308 Homework 9 11/20/2018 1. Consider the following statements: i. a is divisible by 3; ii. a is divisible by 9; iii. a is divisible by
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationChapter 2. Divisibility. 2.1 Common Divisors
Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition
More informationMath.3336: Discrete Mathematics. Chapter 9 Relations
Math.3336: Discrete Mathematics Chapter 9 Relations Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationQuestionnaire for CSET Mathematics subset 1
Questionnaire for CSET Mathematics subset 1 Below is a preliminary questionnaire aimed at finding out your current readiness for the CSET Math subset 1 exam. This will serve as a baseline indicator for
More informationDiscrete Structures Lecture Primes and Greatest Common Divisor
DEFINITION 1 EXAMPLE 1.1 EXAMPLE 1.2 An integer p greater than 1 is called prime if the only positive factors of p are 1 and p. A positive integer that is greater than 1 and is not prime is called composite.
More informationRelationships between the Completion Problems for Various Classes of Matrices
Relationships between the Completion Problems for Various Classes of Matrices Leslie Hogben* 1 Introduction A partial matrix is a matrix in which some entries are specified and others are not (all entries
More informationPREFERENCE MATRICES IN TROPICAL ALGEBRA
PREFERENCE MATRICES IN TROPICAL ALGEBRA 1 Introduction Hana Tomášková University of Hradec Králové, Faculty of Informatics and Management, Rokitanského 62, 50003 Hradec Králové, Czech Republic e-mail:
More information2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 12 Partially Ordered Sets Lattices Bounded Lattices Distributive Lattices Complemented Lattices
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationSection 1.7: Properties of the Leslie Matrix
Section 1.7: Properties of the Leslie Matrix Definition: A matrix A whose entries are nonnegative (positive) is called a nonnegative (positive) matrix, denoted as A 0 (A > 0). Definition: A square m m
More informationIntroduction to Cryptography CS 355 Lecture 3
Introduction to Cryptography CS 355 Lecture 3 Elementary Number Theory (1) CS 355 Fall 2005/Lecture 3 1 Review of Last Lecture Ciphertext-only attack: Known-plaintext attack: Chosen-plaintext: Chosen-ciphertext:
More informationExample: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)
Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative
More information2 IM Preprint series A, No. 1/2003 If vector x(k) = (x 1 (k) x 2 (k) ::: x n (k)) denotes the time instants in which all jobs started for the k th tim
Eigenvectors of interval matrices over max-plus algebra Katarna Cechlarova Institute of mathematics, Faculty ofscience, P.J. Safarik University, Jesenna 5, 041 54 Kosice, Slovakia, e-mail: cechlarova@science.upjs.sk
More informationCourse: CS1050c (Fall '03) Homework2 Solutions Instructor: Prasad Tetali TAs: Kim, Woo Young: Deeparnab Chakrabarty:
Course: CS1050c (Fall '03) Homework2 Solutions Instructor: Prasad Tetali TAs: Kim, Woo Young: wooyoung@cc.gatech.edu, Deeparn Chakrarty: deepc@cc.gatech.edu Section 3.7 Problem 10: Prove that 3p 2 is irrational
More informationChapter 14: Divisibility and factorization
Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2018
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2018 1. Please write your 1- or 2-digit exam number on
More informationALGEBRA+NUMBER THEORY +COMBINATORICS
ALGEBRA+NUMBER THEORY +COMBINATORICS COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming
More informationApplied Cryptography and Computer Security CSE 664 Spring 2017
Applied Cryptography and Computer Security Lecture 11: Introduction to Number Theory Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline What we ve covered so far: symmetric
More informationTheorems and Definitions in Group Theory
Theorems and Definitions in Group Theory Shunan Zhao Contents 1 Basics of a group 3 1.1 Basic Properties of Groups.......................... 3 1.2 Properties of Inverses............................. 3
More informationProf. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.
1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and
More informationCMPUT 403: Number Theory
CMPUT 403: Number Theory Zachary Friggstad February 26, 2016 Outline Factoring Sieve Multiplicative Functions Greatest Common Divisors Applications Chinese Remainder Theorem Factoring Theorem (Fundamental
More informationThe following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers:
Divisibility Euclid s algorithm The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers: Divide the smaller number into the larger, and
More informationThe Euclidean Algorithm and Multiplicative Inverses
1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2009 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.
More informationMath 5490 Network Flows
Math 90 Network Flows Lecture 8: Flow Decomposition Algorithm Stephen Billups University of Colorado at Denver Math 90Network Flows p./6 Flow Decomposition Algorithms Two approaches to modeling network
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationFINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1
Novi Sad J. Math. Vol. 40, No. 3, 2010, 83 87 Proc. 3rd Novi Sad Algebraic Conf. (eds. I. Dolinka, P. Marković) FINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1 Dragan Mašulović
More informationFormula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column
Math 20F Linear Algebra Lecture 18 1 Determinants, n n Review: The 3 3 case Slide 1 Determinants n n (Expansions by rows and columns Relation with Gauss elimination matrices: Properties) Formula for the
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
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 informationAlgorithmic number theory. Questions/Complaints About Homework? The division algorithm. Division
Questions/Complaints About Homework? Here s the procedure for homework questions/complaints: 1. Read the solutions first. 2. Talk to the person who graded it (check initials) 3. If (1) and (2) don t work,
More informationMathematics for Computer Science Exercises for Week 10
Mathematics for Computer Science Exercises for Week 10 Silvio Capobianco Last update: 7 November 2018 Problems from Section 9.1 Problem 9.1. Prove that a linear combination of linear combinations of integers
More informationNumber Theory and Divisibility
Number Theory and Divisibility Recall the Natural Numbers: N = {1, 2, 3, 4, 5, 6, } Any Natural Number can be expressed as the product of two or more Natural Numbers: 2 x 12 = 24 3 x 8 = 24 6 x 4 = 24
More informationPrimitive sets in a lattice
Primitive sets in a lattice Spyros. S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL 33431, U.S.A spyros@fau.unl.edu Tran van Trung Institute for Experimental
More information4 Number Theory and Cryptography
4 Number Theory and Cryptography 4.1 Divisibility and Modular Arithmetic This section introduces the basics of number theory number theory is the part of mathematics involving integers and their properties.
More information4. Number Theory (Part 2)
4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.
More informationDownloaded from
Topic : Real Numbers Class : X Concepts 1. Euclid's Division Lemma 2. Euclid's Division Algorithm 3. Prime Factorization 4. Fundamental Theorem of Arithmetic 5. Decimal expansion of rational numbers A
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationRings and modular arithmetic
Chapter 8 Rings and modular arithmetic So far, we have been working with just one operation at a time. But standard number systems, such as Z, have two operations + and which interact. It is useful to
More informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
More informationEUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)
Intro to Math Reasoning Grinshpan EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) We all know that every composite natural number is a product
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationUNM - PNM STATEWIDE MATHEMATICS CONTEST XLII. November 7, 2009 First Round Three Hours
UNM - PNM STATEWIDE MATHEMATICS CONTEST XLII November 7, 009 First Round Three Hours 1. Let f(n) be the sum of n and its digits. Find a number n such that f(n) = 009. Answer: 1990 If x, y, and z are digits,
More informationMATH 3240Q Introduction to Number Theory Homework 4
If the Sun refused to shine I don t mind I don t mind If the mountains fell in the sea Let it be it ain t me Now if six turned out to be nine Oh I don t mind I don t mind Jimi Hendrix If Six Was Nine from
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationIntermediate Math Circles February 29, 2012 Linear Diophantine Equations I
Intermediate Math Circles February 29, 2012 Linear Diophantine Equations I Diophantine equations are equations intended to be solved in the integers. We re going to focus on Linear Diophantine Equations.
More informationAn Introduction to Mathematical Thinking: Algebra and Number Systems. William J. Gilbert and Scott A. Vanstone, Prentice Hall, 2005
Chapter 2 Solutions An Introduction to Mathematical Thinking: Algebra and Number Systems William J. Gilbert and Scott A. Vanstone, Prentice Hall, 2005 Solutions prepared by William J. Gilbert and Alejandro
More informationSUPPOSE A is an n n matrix, A =[a i,j ]=[(i, j)],
Two Different Computing Methods of the Smith Arithmetic Determinant Xing-Jian Li Shen Qu Open Science Index Mathematical and Computational Sciences wasetorg/publication/9996770 Abstract The Smith arithmetic
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a Let a 975 and b161 Find d gcda, b and find s, t Z such that as + bt d Solution: The Euclidean Algorithm gives 161 975 1 + 86, 975 86 3 + 117, 86 117 + 5,
More informationDeformation of the `embedding'
Home Search Collections Journals About Contact us My IOPscience Deformation of the `embedding' This article has been downloaded from IOPscience. Please scroll down to see the full text article. 1997 J.
More informationNumber Theory Proof Portfolio
Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by
More informationMath 3013 Problem Set 6
Math 3013 Problem Set 6 Problems from 31 (pgs 189-190 of text): 11,16,18 Problems from 32 (pgs 140-141 of text): 4,8,12,23,25,26 1 (Problems 3111 and 31 16 in text) Determine whether the given set is closed
More information5.1. Primes, Composites, and Tests for Divisibility
CHAPTER 5 Number Theory 5.1. Primes, Composites, and Tests for Divisibility Definition. A counting number with exactly two di erent factors is called a prime number or a prime. A counting number with more
More informationMath 4377/6308 Advanced Linear Algebra
1.3 Subspaces Math 4377/6308 Advanced Linear Algebra 1.3 Subspaces Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377 Jiwen He, University of Houston
More informationEIGENVALUES AND EIGENVECTORS OF LATIN SQUARES IN MAX-PLUS ALGEBRA
J. Indones. Math. Soc. Vol. 20, No. 1 (2014), pp. 37 45. EIGENVALUES AND EIGENVECTORS OF LATIN SQUARES IN MAX-PLUS ALGEBRA Muhammad Syifa ul Mufid 1 and Subiono 2 1,2 Institut Teknologi Sepuluh Nopember
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 8 Random Walks, Matrices and PageRank Graphs
More informationSang Gu Lee and Jeong Mo Yang
Commun. Korean Math. Soc. 20 (2005), No. 1, pp. 51 62 BOUND FOR 2-EXPONENTS OF PRIMITIVE EXTREMAL MINISTRONG DIGRAPHS Sang Gu Lee and Jeong Mo Yang Abstract. We consider 2-colored digraphs of the primitive
More informationGeneralized Splines. Madeline Handschy, Julie Melnick, Stephanie Reinders. Smith College. April 1, 2013
Smith College April 1, 213 What is a Spline? What is a Spline? are used in engineering to represent objects. What is a Spline? are used in engineering to represent objects. What is a Spline? are used
More informationInteger and Polynomial Arithmetic First Steps towards Abstract Algebra. Arjeh M. Cohen Hans Cuypers Hans Sterk
Integer and Polynomial Arithmetic First Steps towards Abstract Algebra Arjeh M. Cohen Hans Cuypers Hans Sterk October 8, 2007 2 Contents 1 Integer arithmetic 7 1.1 Divisors and multiples......................
More informationFundamental gaps in numerical semigroups
Journal of Pure and Applied Algebra 189 (2004) 301 313 www.elsevier.com/locate/jpaa Fundamental gaps in numerical semigroups J.C. Rosales a;, P.A. Garca-Sanchez a, J.I. Garca-Garca a, J.A. Jimenez Madrid
More informationPyramids and monomial blowing-ups
Pyramids and monomial blowing-ups arxiv:math/0409446v1 [math.ac] 23 Sep 2004 M.J. Soto soto@us.es Departamento de Algebra Universidad de Sevilla October 4, 2018 José L. Vicente jlvc@us.es Departamento
More information