Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
|
|
- Justina Harris
- 6 years ago
- Views:
Transcription
1 Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for every prie nuber p. I ll say a little about what linear algebra looks like over these fields, and why you ight care. First proble is the definition. One of the basic features of what you learned about in eleentary school about adding and ultiplying integers is that the last digit of the answer only depends on the last digits in the proble. So if I try to tell you that = 28, you know iediately that there s a proble: because 7 8 = 56, the answer ust end in 6. In this way we can define addition and ultiplication odulo ten. Definition. Suppose a 9 and b 9 are integers. Choose any positive integers A and B with last digits a and b respectively. Write for the last digit of X = A +B, and y for the last digit of Y = A B. Then addition and ultiplication odulo are defined by a + b =, a b = y. Write Z/Z for the set {,,..., 9} endowed with this addition and ultiplication. If the contet akes the unabiguous, one usually writes just + and for addition and ultiplication odulo. The content of the definition is that the su and product odulo ten are welldefined. Then we could say for eaple because 3 29 = 377, 3 9 = 7. It s an eleentary algebra eercise to check that addtion and ultiplication are really well-defined (that is, independent of the choices of A and B); I won t do that. The coutative, associative, and distributive laws are all inherited fro Z, so they are true in Z/Z. The eleent is an additive identity, and additive inverses eist; and is a ultiplicative identity. The only aio for a field that is issing is the eistence of ultiplicative inverses. Soe of these inverses eist, even for eleents having no ultiplicative inverse in Z: for eaple 3 7 =, so 7 is a ultiplicative inverse of 3 in Z/Z. But there is trouble right here in River City: 2 5 =, and it follows easily that the nonzero eleents 2 and 5 have no ultiplicative inverses. (Can you tell which eleents of Z/Z do have ultiplicative inverses?) So Z/Z is not a field. There was nothing special about in this discussion. If n is any integer greater than, we can ake
2 2 Definition 2. Suppose a < n and b < n are integers. Choose any positive integers A and B with last digits in base n equal to a and b respectively. (This eans that the reainder when A is divided by n is equal to a.) Write for the last base n digit of X = A + B, and y for the last base n digit of Y = A B. Then addition and ultiplication odulo n are defined by a + n b =, a n b = y. Another way to say this is that is the reainder when a +b (or A +B) is divided by n; and y is the reainder when a b (or A B) is divided by n. Write Z/nZ for the set {,,...,n } endowed with this addition and ultiplication. The addition and ultiplication in Z/nZ are coutative and associative and distributive, and we have identities = and additive inverses. (The reason = is that we are assuing n >.) The only question (for deciding whether Z/nZ is a field) is whether nonzero eleents have ultiplicative inverses. Theore 3. With the addition and ultiplication just defined, Z/nZ is a field if and only if n is a prie nuber. Proof. Suppose first that n is not prie: say n = r s, with < r,s < n. Then r n s =, and it follows easily that r and s cannot have ultiplicative inverses odulo n. So Z/nZ is not a field. Now assue that n = p is a prie nuber. We can t ake countereaples in this way, but there could be a ore subtle reason for Z/pZ not to be a field: we need to prove that every nonzero eleent of Z/pZ really has a ultiplicative inverse. A basic fact about prie nubers and ultiplication of integers is if and y are integers not divisible by p, then y is not divisible by p. In ters of ultiplication in Z/pZ, this eans if and y are nonzero in Z/pZ, then p y is not zero. Using the distributive law, we can translate this forulation to if = Z/pZ and z = z Z/pZ, then p z = p z. That is, if is not zero in Z/pZ, then the p ultiples of { p, p, p 2,... p (p )} ust all be distinct. Therefore they ust be all of the p eleents of Z/pZ. In particular, one of the ust be equal to : there is a z with p z =. This eleent z is the ultiplicative inverse of. QED The field Z/pZ is called F p. Here is a result which connects finite fields with counting probles, and is one of the reasons they are so interesting. Theore 4. Suppose V is an -diensional vector space over F p. a) The cardinality of V is V = p. Suppose T :V W is a linear ap. Write n for the diension of the null space of T, and r for the diension of the range.
3 3 r b) The cardinality of the range of T is p. n c) The preiage of every vector in the range of T has p eleents. r n This ehibits V as the union of p disjoint pieces, each of size p ; so V has r n n+r p p = p = p eleents, (where n + r = is Theore 3.4 in the tet). So what finite fields can eist? Suppose F is any finite field. Start with the eleent F and add F repeatedly, getting a string,, +, ++, +++,... of eleents of F. The first two eleents are distinct because of the aio = for a field. But the field is finite, so the string has to repeat itself eventually. It isn t hard to see that the string ust be periodic of soe period n > : that the first n ters (which could naturally be called (,, 2,...,n )) are all distinct, and then (n )+ =, and the sequence repeats. The nuber n defined in this way is called the characteristic of the finite field F. It s not hard to see Theore 5. Suppose n is the characteristic of the finite field F. Then F contains Z/nZ, with the addition and ultiplication given in Definition 2. In particular (because F has ultiplicative inverses) the characteristic ust be a prie nuber p, and so F contains F p. The field F is then a vector space of soe positive (since = ) diension over F p ; so F = p. This uch is easy. What s a bit ore subtle is Theore 6. Suppose p is a prie nuber, is a positive integer, and q = p. Then there is (up to isoorphis) eactly one field F q having p eleents. Neither the eistence nor the uniqueness of F q is obvious. Here are the addition and ultiplication tables for F 4 = {,,, +} Addition in F Multiplication in F 4
4 4 Coputing in finite fields Addition and ultiplication in F p can be done using the algoriths for Z, followed by coputing the reainder after division by p. In order to do linear algebra, you also need to be able to invert eleents of F p. Theproofaboveof theeistence of ultiplicative inverses isnot constructive. Ifyou want to write a progra to do linear algebra in F 37972, you don t want to calculate the inverse of 7 by trying all nonzero eleents of the field. One way to proceed is using the (etended) Euclidean algorith. This requires approiately logp steps, in each of which the ost coplicated is a division-with-reainder of integers saller than p (a calculation requiring a soe ultiple of log p steps). This could be a reasonable way to calculate inverses for p of size around 2 32 or For uch larger pries, the division-with-reainder steps can slow things down enough that other tricks are useful. There is a (not very difficult) theore saying that if = a F q, then q 2 a = a. So you can copute the inverse as a power. At first glance this looks slow, since it asks for q 3 ultiplications. But the right way to copute powers is to copute the 2 k powers using k+ k k a 2 = a 2 a 2 ; so log 2 q ultiplications to copute all of the 2 k powers of a for 2 k q 2. Now 2 write q 2 in base 2, and ultiply together the a k for k corresponding to the nonzero bits in q 2: for eaple, a = a a a. This is about log 2 q additional ultiplications, for a total of 2log 2 q ultiplications in F q to copute a. At first glance this looks coparable to the Euclidean algorith in speed, but I don t know anything about practice. For relatively sall finite fields (I ve seen this done with q 2 8 ) you can ake a double array of values of + and, and do arithetic by looking up eleents of the array. Why do this? Iknow of two copletely different reasons. First, any problesin atheatics concern integers: how any integer solutions are there to soe equation? An integer solution autoatically provides a solution in Z/nZ for every positive integer n, and in particular a solution in F p for every prie nuber p. So people study equations in F p and try to use what they learn to say soething about integer solutions. This idea has been fantastically successful, in etreely surprising ways. (My own research involves soe differential equations that can arise fro quantu echanics; I try to understand what kinds of solutions those equations can have atheatically, in the hope that the atheatically interesting solutions ight have soe eaning in physics. The best answers to those questions that we know involve counting solutions over finite fields.) Yogi Berra said, In theory there is no difference between theory and practice. In practice there is.
5 A second reasonis just asatrick forcoputational efficiency: coputations with big integers can be replaced by (ore) coputations with sall integers, saving eory. Here is an eaple. Suppose you want to solve a linear algebra proble (like a syste of a hundred siultaneous equations in a hundred unknowns, with integer coefficients). Suppose you know that all the (ten thousand) coefficients in your equations are saller than 2 63, and that your hundred integer solutions are all saller than You need 8 bytes of eory for each of the, coefficients, and 8 for each of the solutions: 8, 8 bytes of eory altogether. (That s not so uch, but you can change to a billion if you like.) Here s another way to proceed. Solve these sae equations in Z/nZ, for each of the nine values n = 229, 233, 239, 24, 247, 25, 253, 255, 256. At each step, each nuber in your calculation is saller than 256, and so fits in one byte of eory; so the calculation requires just, bytes of eory (saving a factor of eight). Because the arithetic involves saller nubers, you can hope that each calculation is faster than the original with 8-byte integers; but in any case you ve slowed down by no worse than a factor of nine. At the end, your nine solutions in Z/nZ can be cobined by the Chinese Reainder Theore to give a solution in Z/NZ, where N = This cobined solution is the reduction odule N of the actual integer solution you wanted. Because N > 2 64, there is no reduction: you have found an eact integer solution of your proble. So you have anaged to reduce your use of eory by a factor of 8 at the cost of increasing tie by a factor of about 9 (or less if you can do sall arithetic faster). This is soeties a good bargain. 5
6 MIT OpenCourseWare Linear Algebra Fall 23 For inforation about citing these aterials or our Ters of Use, visit:
1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationSupport Vector Machines MIT Course Notes Cynthia Rudin
Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More information16 Independence Definitions Potential Pitfall Alternative Formulation. mcs-ftl 2010/9/8 0:40 page 431 #437
cs-ftl 010/9/8 0:40 page 431 #437 16 Independence 16.1 efinitions Suppose that we flip two fair coins siultaneously on opposite sides of a roo. Intuitively, the way one coin lands does not affect the way
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationLesson 24: Newton's Second Law (Motion)
Lesson 24: Newton's Second Law (Motion) To really appreciate Newton s Laws, it soeties helps to see how they build on each other. The First Law describes what will happen if there is no net force. The
More informationNote-A-Rific: Mechanical
Note-A-Rific: Mechanical Kinetic You ve probably heard of inetic energy in previous courses using the following definition and forula Any object that is oving has inetic energy. E ½ v 2 E inetic energy
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationSome Perspective. Forces and Newton s Laws
Soe Perspective The language of Kineatics provides us with an efficient ethod for describing the otion of aterial objects, and we ll continue to ake refineents to it as we introduce additional types of
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationMath 1600A Lecture 3, Section 002
Math 1600 Lecture 3 1 of 5 Math 1600A Lecture 3, Section 002 Announceents: More texts, solutions anuals and packages coing soon. Read Section 1.3 for next class. Work through recoended hoework questions.
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationCHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS. Nicholas Wage Appleton East High School, Appleton, WI 54915, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS Nicholas Wage Appleton East High School, Appleton, WI 54915, USA
More information8.1 Force Laws Hooke s Law
8.1 Force Laws There are forces that don't change appreciably fro one instant to another, which we refer to as constant in tie, and forces that don't change appreciably fro one point to another, which
More informationCongruences and Modular Arithmetic
Congruenes and Modular Aritheti 6-17-2016 a is ongruent to b od n eans that n a b. Notation: a = b (od n). Congruene od n is an equivalene relation. Hene, ongruenes have any of the sae properties as ordinary
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More informationDonald Fussell. October 28, Computer Science Department The University of Texas at Austin. Point Masses and Force Fields.
s Vector Moving s and Coputer Science Departent The University of Texas at Austin October 28, 2014 s Vector Moving s Siple classical dynaics - point asses oved by forces Point asses can odel particles
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationReed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.
Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.
More informationKinematics and dynamics, a computational approach
Kineatics and dynaics, a coputational approach We begin the discussion of nuerical approaches to echanics with the definition for the velocity r r ( t t) r ( t) v( t) li li or r( t t) r( t) v( t) t for
More informationEgyptian Mathematics Problem Set
(Send corrections to cbruni@uwaterloo.ca) Egyptian Matheatics Proble Set (i) Use the Egyptian area of a circle A = (8d/9) 2 to copute the areas of the following circles with given diaeter. d = 2. d = 3
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationProblem Set 2. Chapter 1 Numerical:
Chapter 1 Nuerical: roble Set 16. The atoic radius of xenon is 18 p. Is that consistent with its b paraeter of 5.15 1 - L/ol? Hint: what is the volue of a ole of xenon atos and how does that copare to
More informationOne Dimensional Collisions
One Diensional Collisions These notes will discuss a few different cases of collisions in one diension, arying the relatie ass of the objects and considering particular cases of who s oing. Along the way,
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More information26 Impulse and Momentum
6 Ipulse and Moentu First, a Few More Words on Work and Energy, for Coparison Purposes Iagine a gigantic air hockey table with a whole bunch of pucks of various asses, none of which experiences any friction
More informationROTH S THEOREM ON ARITHMETIC PROGRESSIONS
ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ADAM LOTT ABSTRACT. The goal of this paper is to present a self-contained eposition of Roth s celebrated theore on arithetic progressions. We also present two
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationUSEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta
1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve
More informationi ij j ( ) sin cos x y z x x x interchangeably.)
Tensor Operators Michael Fowler,2/3/12 Introduction: Cartesian Vectors and Tensors Physics is full of vectors: x, L, S and so on Classically, a (three-diensional) vector is defined by its properties under
More informationMULTIPLAYER ROCK-PAPER-SCISSORS
MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationModule #1: Units and Vectors Revisited. Introduction. Units Revisited EXAMPLE 1.1. A sample of iron has a mass of mg. How many kg is that?
Module #1: Units and Vectors Revisited Introduction There are probably no concepts ore iportant in physics than the two listed in the title of this odule. In your first-year physics course, I a sure that
More informationCharacterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone
Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns
More informationM098 Carson Elementary and Intermediate Algebra 3e Section 11.1
M098 Carson Eleentary and Interediate Algebra e Section 11.1 Objectives 1. Use the square root principle to solve quadratic equations.. Solve quadratic equations by copleting the square. Vocabulary Pri
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More information27 Oscillations: Introduction, Mass on a Spring
Chapter 7 Oscillations: Introduction, Mass on a Spring 7 Oscillations: Introduction, Mass on a Spring If a siple haronic oscillation proble does not involve the tie, you should probably be using conservation
More informationDimensions and Units
Civil Engineering Hydraulics Mechanics of Fluids and Modeling Diensions and Units You already know how iportant using the correct diensions can be in the analysis of a proble in fluid echanics If you don
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 17th February 2010 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion
More informationNB1140: Physics 1A - Classical mechanics and Thermodynamics Problem set 2 - Forces and energy Week 2: November 2016
NB1140: Physics 1A - Classical echanics and Therodynaics Proble set 2 - Forces and energy Week 2: 21-25 Noveber 2016 Proble 1. Why force is transitted uniforly through a assless string, a assless spring,
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationA Division Algorithm Using Bisection Method in Residue Number System
International Journal of Coputer, Consuer and Control IJ3C), Vol., No. 03) 59 A Division Algorith Using Bisection Method in Residue Nuber Syste * Chin-Chen Chang and Jen-Ho Yang Abstract. Introduction
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationBisection Method 8/11/2010 1
Bisection Method 8/11/010 1 Bisection Method Basis of Bisection Method Theore An equation f()=0, where f() is a real continuous function, has at least one root between l and u if f( l ) f( u ) < 0. f()
More informationChem/Biochem 471 Exam 3 12/18/08 Page 1 of 7 Name:
Che/Bioche 47 Exa /8/08 Pae of 7 Please leave the exa paes stapled toether. The forulas are on a separate sheet. This exa has 5 questions. You ust answer at least 4 of the questions. You ay answer ore
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 9th February 011 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion of
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationPhysics 139B Solutions to Homework Set 3 Fall 2009
Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationOn Certain C-Test Words for Free Groups
Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More informationALGEBRA REVIEW. MULTINOMIAL An algebraic expression consisting of more than one term.
Page 1 of 6 ALGEBRAIC EXPRESSION A cobination of ordinary nubers, letter sybols, variables, grouping sybols and operation sybols. Nubers reain fixed in value and are referred to as constants. Letter sybols
More informationLecture 8 Symmetries, conserved quantities, and the labeling of states Angular Momentum
Lecture 8 Syetries, conserved quantities, and the labeling of states Angular Moentu Today s Progra: 1. Syetries and conserved quantities labeling of states. hrenfest Theore the greatest theore of all ties
More informationI. Understand get a conceptual grasp of the problem
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departent o Physics Physics 81T Fall Ter 4 Class Proble 1: Solution Proble 1 A car is driving at a constant but unknown velocity,, on a straightaway A otorcycle is
More informationNational 5 Summary Notes
North Berwick High School Departent of Physics National 5 Suary Notes Unit 3 Energy National 5 Physics: Electricity and Energy 1 Throughout the Course, appropriate attention should be given to units, prefixes
More informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationarxiv:math/ v1 [math.nt] 6 Apr 2005
SOME PROPERTIES OF THE PSEUDO-SMARANDACHE FUNCTION arxiv:ath/05048v [ath.nt] 6 Apr 005 RICHARD PINCH Abstract. Charles Ashbacher [] has posed a nuber of questions relating to the pseudo-sarandache function
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationPHY307F/407F - Computational Physics Background Material for Expt. 3 - Heat Equation David Harrison
INTRODUCTION PHY37F/47F - Coputational Physics Background Material for Expt 3 - Heat Equation David Harrison In the Pendulu Experient, we studied the Runge-Kutta algorith for solving ordinary differential
More informationA DISCRETE ZAK TRANSFORM. Christopher Heil. The MITRE Corporation McLean, Virginia Technical Report MTR-89W00128.
A DISCRETE ZAK TRANSFORM Christopher Heil The MITRE Corporation McLean, Virginia 22102 Technical Report MTR-89W00128 August 1989 Abstract. A discrete version of the Zak transfor is defined and used to
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationForce and dynamics with a spring, analytic approach
Force and dynaics with a spring, analytic approach It ay strie you as strange that the first force we will discuss will be that of a spring. It is not one of the four Universal forces and we don t use
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationThe Fundamental Basis Theorem of Geometry from an algebraic point of view
Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article
More informationTABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS. By William W. Chen
TABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS By Willia W. Chen The distribution of the non-null characteristic roots of a atri derived fro saple observations
More information13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization
3 Haronic oscillator revisited: Dirac s approach and introduction to Second Quantization. Dirac cae up with a ore elegant way to solve the haronic oscillator proble. We will now study this approach. The
More informationTHE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n
THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra
More informationMassachusetts Institute of Technology Quantum Mechanics I (8.04) Spring 2005 Solutions to Problem Set 4
Massachusetts Institute of Technology Quantu Mechanics I (8.04) Spring 2005 Solutions to Proble Set 4 By Kit Matan 1. X-ray production. (5 points) Calculate the short-wavelength liit for X-rays produced
More informationFirst of all, because the base kets evolve according to the "wrong sign" Schrödinger equation (see pp ),
HW7.nb HW #7. Free particle path integral a) Propagator To siplify the notation, we write t t t, x x x and work in D. Since x i, p j i i j, we can just construct the 3D solution. First of all, because
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationPrincipal Components Analysis
Principal Coponents Analysis Cheng Li, Bingyu Wang Noveber 3, 204 What s PCA Principal coponent analysis (PCA) is a statistical procedure that uses an orthogonal transforation to convert a set of observations
More informationMidterm 1 Sample Solution
Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a
More informationORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS
#A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa jkritsch@iastateedu Adriana Salerno
More informationBloom Filters. filters: A survey, Internet Mathematics, vol. 1 no. 4, pp , 2004.
Bloo Filters References A. Broder and M. Mitzenacher, Network applications of Bloo filters: A survey, Internet Matheatics, vol. 1 no. 4, pp. 485-509, 2004. Li Fan, Pei Cao, Jussara Aleida, Andrei Broder,
More informationLean Walsh Transform
Lean Walsh Transfor Edo Liberty 5th March 007 inforal intro We show an orthogonal atrix A of size d log 4 3 d (α = log 4 3) which is applicable in tie O(d). By applying a rando sign change atrix S to the
More informationArithmetic Unit for Complex Number Processing
Abstract Arithetic Unit or Coplex Nuber Processing Dr. Soloon Khelnik, Dr. Sergey Selyutin, Alexandr Viduetsky, Inna Doubson, Seion Khelnik This paper presents developent o a coplex nuber arithetic unit
More informationHandout 6 Solutions to Problems from Homework 2
CS 85/185 Fall 2003 Lower Bounds Handout 6 Solutions to Probles fro Hoewor 2 Ait Charabarti Couter Science Dartouth College Solution to Proble 1 1.2: Let f n stand for A 111 n. To decide the roerty f 3
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationPrinciples of Optimal Control Spring 2008
MIT OpenCourseWare http://ocw.it.edu 16.323 Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 16.323 Lecture 10 Singular
More informationIntroduction to Optimization Techniques. Nonlinear Programming
Introduction to Optiization echniques Nonlinear Prograing Optial Solutions Consider the optiization proble in f ( x) where F R n xf Definition : x F is optial (global iniu) for this proble, if f( x ) f(
More informationAnalysis of Polynomial & Rational Functions ( summary )
Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationTHE KALMAN FILTER: A LOOK BEHIND THE SCENE
HE KALMA FILER: A LOOK BEHID HE SCEE R.E. Deain School of Matheatical and Geospatial Sciences, RMI University eail: rod.deain@rit.edu.au Presented at the Victorian Regional Survey Conference, Mildura,
More informationHomotopy Analysis Method for Solving Fuzzy Integro-Differential Equations
Modern Applied Science; Vol. 7 No. 3; 23 ISSN 93-844 E-ISSN 93-82 Published by Canadian Center of Science Education Hootopy Analysis Method for Solving Fuzzy Integro-Differential Equations Ean A. Hussain
More information