Polymerization and polymer size distribution

Similar documents
Section 19 Integral domains

Design of discrete-event simulations

monomer polymer polymeric network cell

Every time a measurement is taken, we must be aware of significant figures! Define significant figures.

CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier

Average Case Analysis. October 11, 2011

Math 40510, Algebraic Geometry

Measures of Location. Measures of position are used to describe the relative location of an observation

Name. Use Two-Color Counters to model each addition problem. Make pairs of red and yellow counters. Find the sum.

MAKING A BINARY HEAP

Discrete-event simulations

Molecular Weight. Nomenclature. Polymer Molecular Weight

At the start of the term, we saw the following formula for computing the sum of the first n integers:

Mathematics Higher Tier, June /1H (Paper 1, non-calculator)

MAKING A BINARY HEAP

1 Functions, Graphs and Limits

27 th Annual ARML Scrimmage

Notes on the prion model

Renormalization of the Yukawa Theory Physics 230A (Spring 2007), Hitoshi Murayama

Section 3.4 Writing the Equation of a Line

Sample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols

Allows us to work with very large or small numbers more easily. All numbers are a product of 10.

arxiv: v1 [math.co] 23 Sep 2016

UNIT #2 LINEAR EXPRESSIONS, EQUATIONS, AND INEQUALITIES REVIEW QUESTIONS

Repeating monomer of SiO(CH 3 ) units. Polymerization causes cross linking. Visco elastic polymer (Based on n ). Intrinsically hydrophobic.

Part V. Chapter 19. Congruence of integers

Intermediate Math Circles February 14, 2018 Contest Prep: Number Theory

The Advantage Testing Foundation Olympiad Solutions

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

Neville s Method. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Neville s Method

Contents. Counting Methods and Induction

Review problems solutions

Math 320-2: Final Exam Practice Solutions Northwestern University, Winter 2015

Carmen s Core Concepts (Math 135)

Induction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2

Introduction to Polymerization Kinetics

Invariant Manifold Reductions for Markovian Ion Channel Dynamics

UNIT #2 LINEAR EXPRESSIONS, EQUATIONS, AND INEQUALITIES REVIEW QUESTIONS

Going from graphic solutions to algebraic

Egyptian Fractions: Part I

MODULAR PERIODICITY OF LINEAR RECURRENCE SEQUENCES

WXML Final Report: Chinese Restaurant Process

Inverse Functions. N as a function of t. Table 1

Necessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix.

Properties of Rational and Irrational Numbers

F 2k 1 = F 2n. for all positive integers n.

Equations and Colorings: Rado s Theorem Exposition by William Gasarch

Computergrafik. Matthias Zwicker Universität Bern Herbst 2016

Increasing/Decreasing Test. Extreme Values and The First Derivative Test.

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Egyptian Fractions: Part I

Fall 2017 November 10, Written Homework 5

QUADRATIC EQUATIONS M.K. HOME TUITION. Mathematics Revision Guides Level: GCSE Higher Tier

Physics for Scientists & Engineers 2

MATH 580, midterm exam SOLUTIONS

Alternative Characterization of Ergodicity for Doubly Stochastic Chains

ECE 440 Lecture 28 : P-N Junction II Class Outline:

Lesson 11 S.95. A. Rewrite the inequality as a compound sentence and in interval notation. B. Graph the inequality on a number line.

Selecting an Orthogonal or Nonorthogonal Two-Level Design for Screening

Test 3 Review. y f(a) = f (a)(x a) y = f (a)(x a) + f(a) L(x) = f (a)(x a) + f(a)

Rubber elasticity. Marc R. Roussel Department of Chemistry and Biochemistry University of Lethbridge. February 21, 2009

+ 37,500. Discuss with your group how do you THINK you would represent 40 degrees below 0 as an integer?

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Math 016 Lessons Wimayra LUY

The Simplex and Policy Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount

BROWN UNIVERSITY MATH 0350 MIDTERM 19 OCTOBER 2017 INSTRUCTOR: SAMUEL S. WATSON

Chapter 1 Statistical Inference

Chapter 2. Measurements and Calculations

1 Backward and Forward Error

Your Thoughts. What is the difference between elastic collision and inelastic collision?

Exam 3 Review Sheet Math 2070

Announcements Wednesday, October 10

Efficient Numerical Schemes for Nucleation-Aggregation Models: Early Steps

Solution of ECE 315 Test #1 Su03

Here is a summary of our last chapter, where we express a periodic wave as a Fourier series.

MATH 18.01, FALL PROBLEM SET #5 SOLUTIONS (PART II)

CSE 331 Winter 2018 Homework 1

15.1 Proof of the Cook-Levin Theorem: SAT is NP-complete

Data Structures and Algorithm Analysis (CSC317) Randomized Algorithms (part 3)

3.3 Accumulation Sequences

Lecture 1 From Continuous-Time to Discrete-Time

Phys 450 Spring 2011 Solution set 6. A bimolecular reaction in which A and B combine to form the product P may be written as:

Computer Science & Engineering 423/823 Design and Analysis of Algorithms

G : Statistical Mechanics

A misère-play -operator

COUNTING STAIRCASES IN INTEGER COMPOSITIONS

CSE 101. Algorithm Design and Analysis Miles Jones Office 4208 CSE Building Lecture 20: Dynamic Programming

Linear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey

Inflorescence. A plant molecular biology game

6.4 Factoring Polynomials

Measurement 4: Scientific Notation

2011 Cayley Contest. The CENTRE for EDUCATION in MATHEMATICS and COMPUTING. Solutions. Thursday, February 24, (Grade 10)

MATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by

Computer Science & Engineering 423/823 Design and Analysis of Algorithms

Unit 9 Study Sheet Rational Expressions and Types of Equations

Advanced Combinatorial Optimization September 22, Lecture 4

ECON The Simple Regression Model

Conjectures and proof. Book page 24-30

EULER S THEOREM KEITH CONRAD

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH

Transcription:

Chapter 6 Polymerization and polymer size distribution The purpose of this summary is to show how to arrive at the correct equation (66) for monomer depletion in a model for size distribution of polymers 61 Polymerization Equations We define p i (t) to be the (mean) number of polymers with i monomer subunits at time t Think of setting up a large number of experimental replicates and measuring p i (t) for each, then averaging the data to see that p i need not be an integer We also let c be concentration of monomers Suppose the smallest polymer that can exist is made up of m monomer subunits Then, by the Law of Mass Action, the rate of formation of that smallest size satisfies an equation of the form dp m = k init c m γp m ck f p m +k r p m+1 Here we have assumed initiation at some rate k init and complete disassembly at rate γ We also use the notation k r for the reverse and k f for the forward rates constants For larger size classes, p i we take dp i = ck fp i 1 (ck f +k r )p i +k r p i+1 About units, let us note that k r,ck f must have units of 1/time The total number of polymer pieces is N(t) = p i (t) 1

2CHAPTER 6 POLYMERIZATION AND POLYMER SIZE DISTRIBUTION k f k f p i 1 k r p i k r p i+1 Figure 61: Keeping track of polymers of all sizes This is not necessarily constant, since new polymers can be nucleated from monomers The total mass of the system is M(t) = c(t)+ ip i (t) We take usually one of two scenarios: (i) The monomer pool is so large that it never gets depleted or (ii) The total mass M is constant Here we consider scenario II 62 Constant total mass In this case, the mass (which consists of the sum of all free subunits plus those inside polymers) is: M = c(t)+ Then constant mass means that ip i (t) = Constant dm = + (t) = 0 so in this case = (t) We can arrive at the correct equation for monomers using mass conservation Form the system of equations for the number of polymers in each size class

62 CONSTANT TOTAL MASS 3 621 Number of polymers of size i dp m = k init c m γp m ck f p m +k r p m+1, (61a) dp i 1 = ck f p i 2 (ck f +k r )p i 1 +k r p i, (61b) dp i = ck fp i 1 (ck f +k r )p i +k r p i+1, (61c) dp i+1 = ck f p i (ck f +k r )p i+1 +k r p i+2, (61d) 622 Mass of polymers of size i The massin size classiis ip i (t), since each polymerin that class hasimonomers in it From the above, we can get the equation for the mass in class i as follows: = ick fp i 1 i(ck f +k r )p i +ik r p i+1 We regroup terms and rewrite this as or simply = ick fp i 1 (i 1+1)k r p i (i+1 1)ck f p i +ik r p i+1 = ick fp i 1 (i 1)k r p i (i+1)ck f p i +ik r p i+1 Using this idea on each of the mass equations leads to a system that looks like (62a) = ick fp i 1 (i 1)k r p i (i+1)ck f p i +ik r p i+1 (62b) (62c)

4CHAPTER 6 POLYMERIZATION AND POLYMER SIZE DISTRIBUTION 623 Simplifying the mass equations Now observe that when we sum all these equations we get cancellations of terms shown in same color below (63a) = ick fp i 1 (i 1)k r p i (i+1)ck f p i +ik r p i+1 (63b) (63c) Analogous terms will cancel out with earlier or later equations when we sum the whole set, leaving only the terms (ck f k r )p i from the ith equation for each i = (m+1) Using the same kind of idea for the smallest size class we get: m dp m = mk init c m (mγ +k r )p m (m+1)ck f p m +mk r p m+1 +[(ck f k r )p m ] (64) Now here is the entire system, showing in blue which terms will drop out once the equations are added: m dp m = mk init c m (mγ +k r )p m (m+1)ck f p m +mk r p m+1 +[(ck f k r )p m ] (65a) = ick fp i 1 (i 1)k r p i (i+1)ck f p i +ik r p i+1 (65b) (65c) 624 Using mass balance to get the equation for monomers When we add these up, we get the following: d ip i (t) = [mk init c m (mγ +k r )p m ]+ (ck f k r )p i

62 CONSTANT TOTAL MASS 5 d ip i (t) = [mk init c m (mγ +k r )p m ]+(ck f k r )N(t) Where we have used the number of pieces N(t) Now by mass conservation, we get = [mk initc m (mγ +k r )p m ] (ck f k r )N(t) (66) This completes the system and allows us to ensure we satisfy mass conservation Now we observe that in the early part of the process, starting with only monomers, c(0) = M, the first terms mk init c m (mγ + k r )p m will be most important, and in particular at the very beginning we expect to see mk initc m Much later, when there is less monomer, and fewer small polymers, we d expect to see (ck f k r )N(t)