# Math 31 Lesson Plan. Day 27: Fundamental Theorem of Finite Abelian Groups. Elizabeth Gillaspy. November 11, 2011

Save this PDF as:

Size: px
Start display at page:

Download "Math 31 Lesson Plan. Day 27: Fundamental Theorem of Finite Abelian Groups. Elizabeth Gillaspy. November 11, 2011"

## Transcription

1 Math 31 Lesson Plan Day 27: Fundamental Theorem of Fnte Abelan Groups Elzabeth Gllaspy November 11, 2011 Supples needed: Colored chal Quzzes Homewor 4 envelopes: evals, HW, presentaton rubrcs, * probs Goals for Students: Students wll: Understand the statement and applcatons of the Fund Thm of Fnte Abelan Groups 1

2 [Lecture Notes: Wrte everythng n blue, and every equaton, on the board. [Square bracets] ndcate antcpated student responses. Italcs are nstructons to myself.] Return quzzes, HW 5. collect homewor 6 I ve been hntng at ths Fundamental Theorem of Fnte Abelan Groups for most of the term, and now we fnally meet t. We re not gong to dscuss the proof n class you can read t n the textboo, or n Gallan, f you re so nclned but snce t s such a cool (and useful!) theorem I wanted to at least state t. I thought t would be a nce way to end the group theory part of ths course. Whch means that we ll be startng wth rng theory on Monday or perhaps today, f we have tme. Are there any questons about Secton 13, or the homewor, before we get started? I thn the Fundamental Theorem wll mae most sense f we start wth an Example: How many dfferent abelan groups are there of sze 180? To fgure ths out, we start by factorng 180: 180 = The Fundamental Theorem tells us that the possble groups of order 180 are Z 2 Z 2 Z 3 Z 3 Z 5 Z 4 Z 3 Z 3 Z 5 Z 2 Z 2 Z 9 Z 5 Z 4 Z 9 Z 5 Can anyone tell me how I fgured ths out? don t wat too long for an answer Snce 180 = , f we want to wrte a group of sze 180 as a drect product, we wll 2

3 need a factor of sze 4, a factor of sze 9, and a factor of sze 5. There are two possble 2-groups (groups whose order s a power of 2) of sze 2 2 = 4 Z 2 Z 2 and Z 4. Smlarly, there are two possble 3-groups of sze 3 2 = 9.] How many 5-groups are there of sze 5? [one] Snce there s only one possble 5-group of sze 5, the groups lsted above are the only ways to wrte 180 as a drect product of cyclc groups. The Fundamental Theorem tells us that every abelan group s somorphc to a drect product of cyclc groups. In other words, we don t have to thn of any other possbltes for abelan groups of sze 180 nothng more complcated than drect products! Ths s most defntely NOT true n the non-abelan case. People have managed to classfy all fnte smple groups abelan and not but ths was a massve undertang! To get a better understandng of the Fundamental Theorem, we need some more tools e, defntons. Def: If p s a prme, a p-power group s a group G such that G = p for some postve nteger. How many abelan groups of sze p are there n general? Def If s a postve nteger, we say that the number of parttons of, wrtten p(), s the number of ways to wrte as a sum of postve ntegers. (Order doesn t matter.) For example, p(4) = 5. Grab a partner and try to fnd all 5 parttons! Parttons of 4: ; ; 1 + 3; 2 + 2; 4. The number of abelan groups of sze p s the number of parttons of. So, how many abelan groups are there of sze 3 4 = 81? What are they? Wor wth your partner to fgure t out. Once you now one, please come wrte t on the board. 3

4 The abelan groups of sze 3 4 are: Z 3 Z 3 Z 3 Z 3 ; Z 3 Z 3 Z 9 ; Z 3 Z 27 Z 9 Z 9 Z 81 We say that order doesn t matter for parttons, because order doesn t matter for drect products. A B = B A always. Algorthm for fndng all the abelan groups of order n: 1. Factor n nto prmes: n = p r 1 1 p r p rm m. 2. Fnd all the parttons of r Fnd all the abelan groups of sze p r 1 1 there wll be p(r 1 ) of them. 4. Repeat for all the prme factors of n. 5. Buld drect products of these p -groups n all the ways possble to end up wth a group of sze n. Questons about ths algorthm? Please get nto groups of 3 or 4. Try to mae sure there s one person n your group that you haven t wored wth before. Use the Fundamental Theorem (e, the algorthm above) to fnd all the abelan groups of the followng szes:

5 = = once everyone has fnshed the frst two, dscuss at board. Prme factorzaton of 168 : Parttons of 3: , 1 + 2, 3. Abelan groups of sze 168: Z 2 Z 2 Z 2 Z 3 Z 7 Z 4 Z 2 Z 3 Z 7 Z 8 Z 3 Z 7 Prme factorzaton of 1125 : Parttons of 2: 1 + 1, 2. Abelan groups of sze 1125: Z 3 Z 3 Z 5 Z 5 Z 5 Z 3 Z 3 Z 25 Z 5 Z 3 Z 3 Z 125 Z 9 Z 5 Z 5 Z 5 Z 9 Z 25 Z 5 Z 9 Z 125 In none of these examples above (well, except 3 4 ) do we see Z n. However, we now that t s an abelan group of sze n. In the examples above, whch one s somorphc to Z n? Please try to fgure ths out n your groups. 5

6 [In the examples above, Z n s always somorphc to the last drect product n the lst. Example 2 on page 134 tells us that a cyclc group of order n s somorphc to the drect product of two cyclc subgroups of szes, l ff l = n and (, l) = 1. So, n general, the abelan group of sze n that s a drect product of cyclc p-groups s the one that s somorphc to Z n.] Are there more questons about the Fundamental Theorem of Fnte Abelan Groups? I want to tal brefly about Corollary Some of you mentoned that we ve seen theorems le t before. So let s put all these relevant statements on the board so we can compare: Corollary 14.5 states that f G s an abelan group of order n, and m n s any dvsor of n, then G has a subgroup of order m. Theorem 11.7 states that f G s an abelan group and p G s a prme, then G has a subgroup of sze p. Theorem 5.5 states that f G s a cyclc group of order n, then G has a unque subgroup of sze m for any m n. What are some advantages of Corollary 14.5 over our prevous results? Thn-par-share Corollary 14.5 s cool because t doesn t requre ether that G be cyclc or that the dvsor of G be prme. Proof of Corollary 14.5: If G s an abelan group of sze n, then the Fundamental Theorem says t can be wrtten as a drect product of cyclc groups of prme-power order. In other words, we can wrte G = Z p r 1 1 Z p r Z p r, where the p s are all prmes but not necessarly all dfferent prmes. Note that snce G = n, we must have n = p r 1 1 p r p r. 6

7 If m n, then each of the prme factors of m s also a prme factor of n. Can the power of a prme factor of m be bgger than ts power n n? [no] Moreover, each prme factor of m s rased to a lower power n m than t s n n. In other words, we can wrte m = p s 1 1 p s p s, where 0 s r for all. Note that Z r p s cyclc for each, and also that p s Z p r, snce ps pr. Hence, by Theorem 5.5, we now that each Z r p has a cyclc subgroup of sze p s call t P. Then, P 1 P 2... P G = Z p r 1 1 Z p r Z p r, and snce P = p s we now that P 1 P 2... P = p s 1 1 p s p s = m. So we have found a subgroup of G of sze m, as desred. Do an example! Introduce rngs f tme 7

### We are now ready to answer the question: What are the possible cardinalities for finite fields?

Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

### Recurrence. 1 Definitions and main statements

Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

### greatest common divisor

4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no

### n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

### Graph Theory and Cayley s Formula

Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll

### 1 Example 1: Axis-aligned rectangles

COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

### Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

### PLANAR GRAPHS. Plane graph (or embedded graph) A graph that is drawn on the plane without edge crossing, is called a Plane graph

PLANAR GRAPHS Basc defntons Isomorphc graphs Two graphs G(V,E) and G2(V2,E2) are somorphc f there s a one-to-one correspondence F of ther vertces such that the followng holds: - u,v V, uv E, => F(u)F(v)

### Solution : (a) FALSE. Let C be a binary one-error correcting code of length 9. Then it follows from the Sphere packing bound that.

MATH 29T Exam : Part I Solutons. TRUE/FALSE? Prove your answer! (a) (5 pts) There exsts a bnary one-error correctng code of length 9 wth 52 codewords. (b) (5 pts) There exsts a ternary one-error correctng

### 8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

### A linear recurrence sequence of composite numbers

LMS J Comput Math 15 (2012) 360 373 C 2012 Author do:101112/s1461157012001143 A lnear recurrence sequence of composte numbers Jonas Šurys Abstract We prove that for each postve nteger k n the range 2 k

### New bounds in Balog-Szemerédi-Gowers theorem

New bounds n Balog-Szemeréd-Gowers theorem By Tomasz Schoen Abstract We prove, n partcular, that every fnte subset A of an abelan group wth the addtve energy κ A 3 contans a set A such that A κ A and A

### Moment of a force about a point and about an axis

3. STATICS O RIGID BODIES In the precedng chapter t was assumed that each of the bodes consdered could be treated as a sngle partcle. Such a vew, however, s not always possble, and a body, n general, should

### Lossless Data Compression

Lossless Data Compresson Lecture : Unquely Decodable and Instantaneous Codes Sam Rowes September 5, 005 Let s focus on the lossless data compresson problem for now, and not worry about nosy channel codng

### Using Series to Analyze Financial Situations: Present Value

2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated

### Solution of Algebraic and Transcendental Equations

CHAPTER Soluton of Algerac and Transcendental Equatons. INTRODUCTION One of the most common prolem encountered n engneerng analyss s that gven a functon f (, fnd the values of for whch f ( = 0. The soluton

### Formula of Total Probability, Bayes Rule, and Applications

1 Formula of Total Probablty, Bayes Rule, and Applcatons Recall that for any event A, the par of events A and A has an ntersecton that s empty, whereas the unon A A represents the total populaton of nterest.

### SOME MATHEMATICAL FOUNDATIONS OF CRYPTOGRAPHY

SOME MATHEMATICAL FOUNDATIONS OF CRYPTOGRAPHY PARKER HAVIZA Abstract. Ths paper ntroduces three mathematcal methods of sharng encrypted nformaton: the Pohlg-Hellman Key Exchange and the ElGamal and RSA

### + + + - - This circuit than can be reduced to a planar circuit

MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

### Lecture 3. 1 Largest singular value The Behavior of Algorithms in Practice 2/14/2

18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

### II. PROBABILITY OF AN EVENT

II. PROBABILITY OF AN EVENT As ndcated above, probablty s a quantfcaton, or a mathematcal model, of a random experment. Ths quantfcaton s a measure of the lkelhood that a gven event wll occur when the

### 9 Arithmetic and Geometric Sequence

AAU - Busness Mathematcs I Lecture #5, Aprl 4, 010 9 Arthmetc and Geometrc Sequence Fnte sequence: 1, 5, 9, 13, 17 Fnte seres: 1 + 5 + 9 + 13 +17 Infnte sequence: 1,, 4, 8, 16,... Infnte seres: 1 + + 4

### BERNSTEIN POLYNOMIALS

On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

### Section 5.3 Annuities, Future Value, and Sinking Funds

Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme

### What is Candidate Sampling

What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

### A Note on the Decomposition of a Random Sample Size

A Note on the Decomposton of a Random Sample Sze Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract Ths note addresses some results of Hess 2000) on the decomposton

### Passive Filters. References: Barbow (pp 265-275), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called

### 6. EIGENVALUES AND EIGENVECTORS 3 = 3 2

EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a non-zero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :

### Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process

Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer

### Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

### Chapter 3 Group Theory p. 1 - Remark: This is only a brief summary of most important results of groups theory with respect

Chapter 3 Group Theory p. - 3. Compact Course: Groups Theory emark: Ths s only a bref summary of most mportant results of groups theory wth respect to the applcatons dscussed n the followng chapters. For

### Getting Started. with Penfriend XP. 1 Installing 2 Trying it out! 3 Word Prediction. Reviewing Lexicons 5 Preferences 6 Finding More Help 7

Gettng Started wth Penfrend XP Installng Tryng t out! Word Predcton Other Features Revewng Lexcons 5 Preferences 6 Fndng More Help 7 Installng 5 6 7 Before you can use Penfrend XP on your computer the

### Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.

Lecture 3: Annuty Goals: Learn contnuous annuty and perpetuty. Study annutes whose payments form a geometrc progresson or a arthmetc progresson. Dscuss yeld rates. Introduce Amortzaton Suggested Textbook

### Extending Probabilistic Dynamic Epistemic Logic

Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

### PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

### Electric circuit components. Direct Current (DC) circuits

Electrc crcut components Capactor stores charge and potental energy, measured n Farads (F) Battery generates a constant electrcal potental dfference ( ) across t. Measured n olts (). Resstor ressts flow

### Aryabhata s Root Extraction Methods. Abhishek Parakh Louisiana State University Aug 31 st 2006

Aryabhata s Root Extracton Methods Abhshek Parakh Lousana State Unversty Aug 1 st 1 Introducton Ths artcle presents an analyss of the root extracton algorthms of Aryabhata gven n hs book Āryabhatīya [1,

### The OC Curve of Attribute Acceptance Plans

The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

### Online Learning from Experts: Minimax Regret

E0 370 tatstcal Learnng Theory Lecture 2 Nov 24, 20) Onlne Learnng from Experts: Mn Regret Lecturer: hvan garwal crbe: Nkhl Vdhan Introducton In the last three lectures we have been dscussng the onlne

### Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces

### FINITE-STATE MARKOV CHAINS

Chapter 4 FINITE-STATE MARKOV CHAINS 4.1 Introducton The countng processes {N(t); t > 0} descrbed n Secton 2.1.1 have the property that N(t) changes at dscrete nstants of tme, but s defned for all real

### The k-binomial Transforms and the Hankel Transform

1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 9 (2006, Artcle 06.1.1 The k-bnomal Transforms and the Hankel Transform Mchael Z. Spvey Department of Mathematcs and Computer Scence Unversty of Puget

### Experiment 8 Two Types of Pendulum

Experment 8 Two Types of Pendulum Preparaton For ths week's quz revew past experments and read about pendulums and harmonc moton Prncples Any object that swngs back and forth can be consdered a pendulum

### VLSI Technology Dr. Nandita Dasgupta Department of Electrical Engineering Indian Institute of Technology, Madras

VLI Technology Dr. Nandta Dasgupta Department of Electrcal Engneerng Indan Insttute of Technology, Madras Lecture - 11 Oxdaton I netcs of Oxdaton o, the unt process step that we are gong to dscuss today

### Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

### Lecture 2: Absorbing states in Markov chains. Mean time to absorption. Wright-Fisher Model. Moran Model.

Lecture 2: Absorbng states n Markov chans. Mean tme to absorpton. Wrght-Fsher Model. Moran Model. Antonna Mtrofanova, NYU, department of Computer Scence December 8, 2007 Hgher Order Transton Probabltes

### Section 5.4 Annuities, Present Value, and Amortization

Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

### Texas Instruments 30X IIS Calculator

Texas Instruments 30X IIS Calculator Keystrokes for the TI-30X IIS are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the

### v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

### The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

### Types of Injuries. (20 minutes) LEARNING OBJECTIVES MATERIALS NEEDED

U N I T 3 Types of Injures (20 mnutes) PURPOSE: To help coaches learn how to recognze the man types of acute and chronc njures. LEARNING OBJECTIVES In ths unt, coaches wll learn how most njures occur,

### Section C2: BJT Structure and Operational Modes

Secton 2: JT Structure and Operatonal Modes Recall that the semconductor dode s smply a pn juncton. Dependng on how the juncton s based, current may easly flow between the dode termnals (forward bas, v

### Ring structure of splines on triangulations

www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

### State function: eigenfunctions of hermitian operators-> normalization, orthogonality completeness

Schroednger equaton Basc postulates of quantum mechancs. Operators: Hermtan operators, commutators State functon: egenfunctons of hermtan operators-> normalzaton, orthogonalty completeness egenvalues and

### EE 4343 Lab#1 Identification of Static Motor Module Parameters

EE 4343 Lab# Identfcaton of Statc Motor Module Parameters Prepared by: Stacy Cason Updated: Wednesday, May 26, 999 The block dagram for the DC motor module to be used n today s lab s shown below. (Fgure

### THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

### DEFINING %COMPLETE IN MICROSOFT PROJECT

CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

### High-Speed Decoding of the Binary Golay Code

Hgh-Speed Decodng of the Bnary Golay Code H. P. Lee *1, C. H. Chang 1, S. I. Chu 2 1 Department of Computer Scence and Informaton Engneerng, Fortune Insttute of Technology, Kaohsung 83160, Tawan *hpl@fotech.edu.tw

### b) The mean of the fitted (predicted) values of Y is equal to the mean of the Y values: c) The residuals of the regression line sum up to zero: = ei

Mathematcal Propertes of the Least Squares Regresson The least squares regresson lne obeys certan mathematcal propertes whch are useful to know n practce. The followng propertes can be establshed algebracally:

### SIMPLE LINEAR CORRELATION

SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.

### Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

### 9.1 The Cumulative Sum Control Chart

Learnng Objectves 9.1 The Cumulatve Sum Control Chart 9.1.1 Basc Prncples: Cusum Control Chart for Montorng the Process Mean If s the target for the process mean, then the cumulatve sum control chart s

### Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

### Support Vector Machines

Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

### J. Parallel Distrib. Comput.

J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

### U.C. Berkeley CS270: Algorithms Lecture 4 Professor Vazirani and Professor Rao Jan 27,2011 Lecturer: Umesh Vazirani Last revised February 10, 2012

U.C. Berkeley CS270: Algorthms Lecture 4 Professor Vazran and Professor Rao Jan 27,2011 Lecturer: Umesh Vazran Last revsed February 10, 2012 Lecture 4 1 The multplcatve weghts update method The multplcatve

### 8 Algorithm for Binary Searching in Trees

8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

### Project Networks With Mixed-Time Constraints

Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

### 2.4 Bivariate distributions

page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together

### Question 2: What is the variance and standard deviation of a dataset?

Queston 2: What s the varance and standard devaton of a dataset? The varance of the data uses all of the data to compute a measure of the spread n the data. The varance may be computed for a sample of

### CIRCUIT ELEMENTS AND CIRCUIT ANALYSIS

EECS 4 SPING 00 Lecture 9 Copyrght egents of Unversty of Calforna CICUIT ELEMENTS AND CICUIT ANALYSIS Lecture 5 revew: Termnology: Nodes and branches Introduce the mplct reference (common) node defnes

### z(t) = z 1 (t) + t(z 2 z 1 ) z(t) = 1 + i + t( 2 3i (1 + i)) z(t) = 1 + i + t( 3 4i); 0 t 1

(4.): ontours. Fnd an admssble parametrzaton. (a). the lne segment from z + to z 3. z(t) z (t) + t(z z ) z(t) + + t( 3 ( + )) z(t) + + t( 3 4); t (b). the crcle jz j 4 traversed once clockwse startng at

### QUESTIONS, How can quantum computers do the amazing things that they are able to do, such. cryptography quantum computers

2O cryptography quantum computers cryptography quantum computers QUESTIONS, Quantum Computers, and Cryptography A mathematcal metaphor for the power of quantum algorthms Mark Ettnger How can quantum computers

### 1. Math 210 Finite Mathematics

1. ath 210 Fnte athematcs Chapter 5.2 and 5.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210

### A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

### 1. The scalar-valued function of a second order tensor φ ( T) , m an integer, is isotropic. T, m an integer is an isotropic function.

ecton 4. 4. ppendx to Chapter 4 4.. Isotropc Functons he scalar- vector- and tensor-valued functons φ a and of the scalar varable φ vector varable v and second-order tensor varable B are sotropc functons

### The Mathematical Derivation of Least Squares

Pscholog 885 Prof. Federco The Mathematcal Dervaton of Least Squares Back when the powers that e forced ou to learn matr algera and calculus, I et ou all asked ourself the age-old queston: When the hell

### Math 131: Homework 4 Solutions

Math 3: Homework 4 Solutons Greg Parker, Wyatt Mackey, Chrstan Carrck October 6, 05 Problem (Munkres 3.) Let {A n } be a sequence of connected subspaces of X such that A n \ A n+ 6= ; for all n. Then S

### How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

### A Probabilistic Theory of Coherence

A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

### 21 Vectors: The Cross Product & Torque

21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl

### Lesson 2 Chapter Two Three Phase Uncontrolled Rectifier

Lesson 2 Chapter Two Three Phase Uncontrolled Rectfer. Operatng prncple of three phase half wave uncontrolled rectfer The half wave uncontrolled converter s the smplest of all three phase rectfer topologes.

### Expected Value. Background

Please note: Before I slam you wth the notaton from Chapter 9 - Secton, I want you to understand how smple Mathematcal Expectaton really s. My frst smplfcaton: I wll refer to t as Expected Value (E )from

### Thursday, December 10, 2009 Noon - 1:50 pm Faraday 143

1. ath 210 Fnte athematcs Chapter 5.2 and 4.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210

### The Magnetic Field. Concepts and Principles. Moving Charges. Permanent Magnets

. The Magnetc Feld Concepts and Prncples Movng Charges All charged partcles create electrc felds, and these felds can be detected by other charged partcles resultng n electrc force. However, a completely

### IDEAL FACTORIZATION KEITH CONRAD

IDEAL FACTORIZATION KEITH CONRAD 1. Introducton We wll prove here the fundamental theorem of deal theory n number felds: every nonzero proper deal n the ntegers of a number feld admts unque factorzaton

### COSC 6385 Computer Architecture. - Pipelining (II)

COSC 6385 Computer Archtecture - Ppelnng (II) Sprng 2011 Performance evaluaton of ppelnes (I) General Speedup Formula: Tme Speedup = Tme = IC IC ClockCycle ClockClycle CPI CPI For a fxed applcaton lets

### Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

### Simple Interest Loans (Section 5.1) :

Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part

### Chapter 7. Random-Variate Generation 7.1. Prof. Dr. Mesut Güneş Ch. 7 Random-Variate Generation

Chapter 7 Random-Varate Generaton 7. Contents Inverse-transform Technque Acceptance-Rejecton Technque Specal Propertes 7. Purpose & Overvew Develop understandng of generatng samples from a specfed dstrbuton

### Series Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3

Royal Holloway Unversty of London Department of Physs Seres Solutons of ODEs the Frobenus method Introduton to the Methodology The smple seres expanson method works for dfferental equatons whose solutons

### Inter-Ing 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007.

Inter-Ing 2007 INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007. UNCERTAINTY REGION SIMULATION FOR A SERIAL ROBOT STRUCTURE MARIUS SEBASTIAN

### Basics of Counting. A note on combinations. Recap. 22C:19, Chapter 6.5, 6.7 Hantao Zhang

Bscs of Countng 22C:9, Chpter 6.5, 6.7 Hnto Zhng A note on comntons An lterntve (nd more common) wy to denote n r-comnton: n n C ( n, r) r I ll use C(n,r) whenever possle, s t s eser to wrte n PowerPont

### ESA Study Guide Year 10 Science

ES Study Gude Year 10 Scence Chapter 10: Electrc crcuts Conductors nsulators Questons from page 131 of ES Study Gude Year 10 Scence Understng 1. Explan the dfference between a good conductor of electrcty

### Abstract # 015-0399 Working Capital Exposure: A Methodology to Control Economic Performance in Production Environment Projects

Abstract # 015-0399 Workng Captal Exposure: A Methodology to Control Economc Performance n Producton Envronment Projects Dego F. Manotas. School of Industral Engneerng and Statstcs, Unversdad del Valle.

### CLUSTER SAMPLING DR. SHALABH DEPARTMENT OF MATHEMATICS AND STATISTICS INDIAN INSTITUTE OF TECHNOLOGY KANPUR 1

amplng Theory MODULE IX LECTURE - 30 CLUTER AMPLIG DR HALABH DEPARTMET OF MATHEMATIC AD TATITIC IDIA ITITUTE OF TECHOLOGY KAPUR It s one of the asc assumptons n any samplng procedure that the populaton

### 1 Approximation Algorithms

CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons

### Skim Section 1 of your text. Read the title and subheads. List three concepts that you think will be discussed in this section.

Secton 81 Formng Chemcal Bonds Skm Secton 1 of your text Read the ttle and subheads Lst three concepts that you thnk wll be dscussed n ths secton 1 2 3 New chemcal bond caton Use your text to defne each