MULTIPLE ZETA VALUES 45
|
|
- Jennifer Tyler
- 5 years ago
- Views:
Transcription
1 MULTIPLE ZETA VALUES The two-one conjectural formula In the introductory section the following alternative version of the multiple zeta values with non-strict inequalities was mentioned see.7: ζ s ζ s, s 2,..., s l : n n 2 n l n s n s 2 2 n s l Exercise.2 gives a simple recipe to pass from one model to the other. Relation.8 is an example of simple relations for the multiple zeta star values; its companion is ζ {2} k 2 2k ζ2k 2 n n n 2k. This expression can be compared with the one for ζ{2} k given in 5.4 and 2.. The starting goal of our joint project with Y. Ohno was finding a general form of the two families of identities for the MZSVs. On this way, we only succeeded in generalising.8 but conjecturally. The particular cases of our conjecture which we dubbed as the two-one formula were established by ourselves; there are some recent publications with some other particular instances proven. One of lucky accidents of our proofs is the weighted version 2.8 of Euler s original formula 2.7 the sum formula of depth 2 in the modern terminology. Conjecture 7 Two-one formula. For k 0,, 2,..., denote µ 2k+ {2} k,. Then for any admissible index s s, s 2,..., s l with odd entries s,..., s l, the following identities are valid: l. ζ µ s, µ s2,..., µ sl p p σp 2 l σp ζ p 4. 2 l σp ζp, 4.2 where, as in Exercise.2, p runs through all indices of the form s s 2 s l with being either the symbol, or the sign +, and the exponent σp denotes the number of signs + in p. Proof of the equality of the right-hand sides in 4. and 4.2. By Exercise.2 for the right-hand side in 4. we have {, or +} #{ +} 2 l #{ +} ζ s s 2 s l {, or +} { + or } l #{ } #{ }+ ζs s 2 s l
2 46 JONATHAN M. BORWEIN AND WADIM ZUDILIN which in the notation r #{ } + turns out to be l l n rn l n l n m0 l 2 n n {, or +} l n l r 2 r l r l n l n m #{ +}l n l #{ +}n l n m 2 n+m ζs s 2 s l 2 l #{ +} ζs s 2 s l, and this is exactly the right-hand side of 4.2. ζs s 2 s l #{ +}l n ζs s 2 s l On the right-hand side of 4. and 4.2 we have MZSVs and MZVs of length at most l, while the left-hand side involves a single zeta star attached to an index with entries 2 and only and the number of s is equal to l; the latter circumstance is the reason of dubbing the formula as the two-one formula. We stress that neither the two-one formula nor its special cases treated in Theorems 4. and 4.2 below are specializations of identities for polylogarithms 4.. In spite of a nicely simple but somehow unusual form of the two-one formula we cannot yet prove it in the full generality. Besides the case l given in.8, the following two particular cases l 2, and s 3, s 2 s n 2 with n l arbitrary as well as our experimental results for cases not included in the theorems below strongly support the validity of identities 4., 4.2. Theorem 4.. For any n and i n, ζ 2,..., 2,, 2,..., 2, 4ζ 2i +, 2n i + ζ2n i n i Theorem 4.2. For any n 3, ζ 2,,..., 2 n 2 #{ +} ζ3 } {{ } n 2 {, or +} n 3 n 2 n i ζ3 + e, + e 2, + e 3,..., + e n i, i2 e +e 2 + +e n i i 2 where all e j are non-negative integers. 4.4 Before giving some details of proofs of the theorems, let us make some comments on the two-one formula. The formula ζ {2, {} m } n, m + ζm + n +
3 MULTIPLE ZETA VALUES 47 for any positive integers m, n is known two different proofs are given by Zlobin and Ohno Wakabayashi. If m it is nothing but formula.8, while if m 2 then its left-hand side equals ζ {µ 3, {µ } m 2 } n, µ. This together with the twoone formula mean that the corresponding right-hand side in 4. equivalently, in 4.2 is expected to have a closed-form evaluation by means of the single zeta value m + ζm + n +, where the integers m 2 and n are arbitrary. Using the integral representation of MZSVs, ζ s [0,] s + +s l s + +s l l i t t s + +s i cf. 7.0 valid for any admissible index s s,..., s l, we can write the righthand side of 4. as follows: l i 2 + t t s + +s i l i t t s + +s i s + +s l. 4.5 [0,] s + +s l The change of variable u j t t j for j,..., s + + s l gives the integral l s + +s i du j 2 u j >u > >u s + +s l >0 i s + +s l js + +s l + js + +s i + + u s + +s i du s + +s i u s + +s i u s + +s i du j du s + +s l, 4.6 u j u s + +s l where the empty sum s + +s i for i is interpreted as 0. Therefore, any of the two integrals in 4.5, 4.6 may replace the right-hand sides of 4. or 4.2. The case l 2 Theorem 4. reads as ζ {2} s,, {2} s 2, 2ζ2s + 2s ζ2s +, 2s 2 +. In particular, the latter identity implies ζ {2} s,, {2} s 2, + ζ {2} s 2,, {2} s, 4ζ2s + 2s ζ2s +, 2s ζ2s 2 +, 2s + 4ζ2s + ζ2s 2 + ζ {2} s, ζ {2} s 2, whenever s and s 2. However, no further generalizations to cases l > 2 can be derived from Conjecture 7. The proof of Theorem 4. from the joint paper with Y. Ohno is an elaborate descending inductive argument on i. The following two exercises represent the summary of this proof given in eight lemmas. Exercise 4.. For a c > 0, define the harmonic sum c Ha, c a j j j a and interpret both H, c and Ha, 0 as zeroes.
4 48 JONATHAN M. BORWEIN AND WADIM ZUDILIN a If B C, we have a 2 c HB, c HA +, c c 2 Ha, C Ha, D a 2 + δ B,C 2 B 3, where δ B,C stands for Kronecker s delta. b For positive integers L and M satisfying L > M, the following identity is valid: M b HL, b l b c a al a M a Ha +, M +. Solution of part a. It follows that Ha, C Ha, D a c whenever a C, and a c a a c HB, c HA +, c + δ c,b c whenever c B. Furthermore, for a c the following partial fraction decomposition is valid: a 2 c a c a c 2 a c a. 2 Thus, under the condition B C, we get a 2 c a c a c 2 a c + δ a 2 B,C B 3 a c HB, c HA +, c c 2 which is the desired statement. l Ha, C Ha, D a 2 + δ B,C 2 B 3. Remark. The proof of the cyclic sum theorem Theorem 2.3 given by Ohno and Wakabayashi exploits the general forms of above partial-fraction identities: m a m+ l c l a c a c m a c a m
5 and m l a m+ l c l MULTIPLE ZETA VALUES 49 HB, c HA +, c c m Ha, C Ha, D a m + δ B,C m B m+, respectively, although the function Ha, c was not used there in an explicit form it was introduced later by Zagier in his unpublished note on the proof of Ohno Wakabayashi. It is an open question whether the two-one formula may be generalized further to some multiple cyclic level. Exercise 4.2. a For i and j 0, ζ 2i +, 2,..., 2, j a 0 >a a j+ a 0 a a j Ha 0 +, a j a 2i+ 0 a 2 a 2 j b For i and j 0, a 0 a j+ a 0 a 2i 0 a 2 a 2 j+ c Given n, for any i in the range i n, ζ 2,..., 2,, 2,..., 2, 4ζ 2i +, 2n i + i n i Ha 0, a i + a 2 0 a 2 n a n d We have a 0 a n a 0 a i+ a n ζ 2,..., 2,, 4ζ 2n +, ζ2n + 2. n a 0 a n + 2ζ 2i +, 2j +. 2ζ2i +, 2j +. Ha 0 +, a n a 2i+ 0 a 2 i e For i < n, Ha 0, a i Ha 0, a i+ Ha 0, a n 2 a 2 a 0 a n 0 a 2 n a n a 2i+ a 0 >a i+ a n 0 a 2 i+ Ha 0, a n Ha 0, a n a 2 0 a 2 i a ia 2 i+ a 2 0 a 2 i a i+a 2 i+2. f For 0 i < n, a 0 a n Ha 0, a n Ha 0, a n a 2 0 a 2 i a ia 2 i+ a 2 0 a 2 i a i+a 2 i+2 ζ 2,..., 2,, 2,..., 2, ζ2n + 2. i+ n i
6 50 JONATHAN M. BORWEIN AND WADIM ZUDILIN Proof of Theorem 4.. We will use the descending induction on i n, n,...,. In the case i n induction base the identity of the theorem is shown in Exercise 4.2 d. Therefore, we assume that i < n and that identity 4.3 is proved with i replaced by i +, that is, ζ 2,..., 2,, 2,..., 2, 4ζ 2i + 3, 2n i ζ2n i+ n i We substitute expressions a 0 >a i+ a n Ha 0, a n a 2i+ 0 a 2 i+ a 2i+ a 0 >a i+ a n + a 0 >a i+ a n a 0 >a i+ a n Ha 0 +, a n 0 a 2 i+ a 0 a n a 0 a 2i+ 0 a 2 i+ Ha 0 +, a n a 2i+ 0 a 2 i+ + 2ζ2i + 3, 2n i, followed from Exercise 4.2 b, and Ha 0, a n Ha 0, a n a 2 0 a 2 i a ia 2 i+ a 2 0 a 2 i a i+a 2 i+2 a 0 a n a 0 a n 4ζ 2i + 3, 2n i 4ζ2n + 2 4ζ2i + 3, 2n i, followed from Exercise 4.2 f and 4.8, into the identity of Exercise 4.2 e to get Ha 0, a i Ha 0, a i+ Ha 0 +, a n 2 a 2 0 a 2 n a n a 2i+ 0 a 2 i+ 2 a 0 a i+ a n Ha 0 +, a n a 2i+ 0 a 2 i+ The last identity may be written as Ha 0, a i a 2 0 a 2 n a n a 0 a n a 0 a n a 0 a n Ha 0, a i+ a 2 0 a 2 n a n a 0 a i+ a n a 0 >a i+ a n a 0 a i+2 a n a 0 a i+2 a n Ha 0 +, a n a 2i+ 0 a 2 i+ Ha 0 +, a n a 2i+3 0 a 2 i+2. Ha 0 +, a n a 2i+3 0 a 2 i+2, where the right-hand side equals 2ζ2n + 2 by Exercise 4.2 c applied to i + instead of i and 4.8, so does the left-hand side: Ha 0, a i Ha 0 +, a n a 2 0 a 2 n a n a 2i+ 0 a 2 i+ 2ζ2n a 0 a i+ a n
7 MULTIPLE ZETA VALUES 5 Finally, from 4.7 and 4.9 we obtain identity 4.3 for the given i, completing the proof of Theorem 4.. Proof of Theorem 4.2. For each i 2,..., n, the sum ζ3 + e, + e 2, + e 3,..., + e n i can be written as e +e 2 + +e n i i 2 e +e 2 i 2 i ζn i + + e, + e 2 ζn l, l by Theorem 8.4 Ohno s relations. Therefore, 2 n 2 ζ3,,..., + 2 n 3 ζ3 + e, + e 2,..., + e n 3 + n 3 e +e 2 + +e n n i ζ3 + e, + e 2,..., + e n i + + 2ζn n i2 2 n i i e +e 2 + +e n i i 2 n 2 ζn l, l l n 2 2 n l ζn l, l. l l n l i2 l 2 i ζn l, l Applying Euler s formula 2.7 and its weighted version 2.8, the latter sum becomes n 2 n 2 2 n l ζn l, l ζn l, l n ζn. l Finally, we use the formula l n ζn ζ 2,,,..., n 2 This im- which follows from Exercise.2 and the sum theorem Theorem 2.4. plies 4.4 and completes our proof of Theorem Reduction of double Euler sums Euler s original motivation to study double zeta sums was a possibility to reduce them to single zeta values. We have already discussed this problem in Section 3 for the standard multiple zeta values. Here we reproduce a result of Kentaro Ihara which addresses the alternating double Euler sums ζr, s;, σ n>m σ m n r m s,
8 52 JONATHAN M. BORWEIN AND WADIM ZUDILIN which in fact works for any choice of σ on the unit circle σ not just for σ {±}. First note the iterated integral representation ζr, s;, σ r r r+ r+s σ r+s t t r t r t r+ t r+s σt r+s >t > >t r+s >0 0 t r times t t s times σ σt, 5. which is given in the mnemonic form like in 4. in the second line. Theorem 5.. For k 2 and σ, ζk, ;, σ + ζk, ;, σ ζk ζ; σ + ζ; σ + kζk + k ζj; σζk j + ; σ. 5.2 j The particular case σ corresponds to the identity 2ζk, 2 where we use n>m m k n k m 2ζkζ + kζk + ζjζk j + ζk j 4 k ζk log 2 + kζk + k j j k ζjζk j +, 5.3 j2 { log 2 if k, k ζk if k >. Exercise 5.. Show that the limit of the right-hand side in 5.2 as σ, σ, exists and deduce the corresponding identity due to Euler k 2ζk, kζk + ζjζk j In order to prove Theorem 5. we use the shuffle and stuffle relations for the corresponding alternating double sums. j2 Lemma 5.. We have ζk ζ; σ + ζ; σ k ζj, k + j; σ, σ + ζk + j, j; σ, σ j + ζk, ;, σ + ζk, ;, σ.
9 Proof. The shuffle product of ζ; σ and ζk reads ζ; σζk MULTIPLE ZETA VALUES 53 0 k j σ σt 0 0 t j times t k times σ σt t t k j times t + 0 t σ t σt k times k ζj, k + j; σ, /σ + ζk, ;, σ. j It remains to add the equation obtained by replacing σ with σ. Lemma 5.2. The following identity is valid: k k ζj; σζk+ j; σ ζj, k+ j; σ, σ +ζk+ j, j; σ, σ +kζk+. j j Proof. By the shuffle product that is, term-by-term multiplication of the corresponding series, ζj; σζk + j; ε ζj, k + j; σ, ε + ζk + j, j; ε, σ + ζk + ; σε. Putting ε σ and summing for j from to k, the result follows. Proof of Theorem 5.. The identity follows by applying Lemmas 5. and 5.2.
Multiple Eisenstein series
Heilbronn Workshop on String Theory and Arithmetic Geometry University of Bristol - 5th September 2012 Multiple zeta-values Definition For natural numbers s 1 2, s 2,..., s l 1 the multiple zeta-value
More informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More informationAlgebra homework 8 Homomorphisms, isomorphisms
MATH-UA.343.005 T.A. Louis Guigo Algebra homework 8 Homomorphisms, isomorphisms For every n 1 we denote by S n the n-th symmetric group. Exercise 1. Consider the following permutations: ( ) ( 1 2 3 4 5
More informationMATH 425: BINOMIAL TREES
MATH 425: BINOMIAL TREES G. BERKOLAIKO Summary. These notes will discuss: 1-level binomial tree for a call, fair price and the hedging procedure 1-level binomial tree for a general derivative, fair price
More informationOn the Number of Permutations Avoiding a Given Pattern
On the Number of Permutations Avoiding a Given Pattern Noga Alon Ehud Friedgut February 22, 2002 Abstract Let σ S k and τ S n be permutations. We say τ contains σ if there exist 1 x 1 < x 2
More informationBest-Reply Sets. Jonathan Weinstein Washington University in St. Louis. This version: May 2015
Best-Reply Sets Jonathan Weinstein Washington University in St. Louis This version: May 2015 Introduction The best-reply correspondence of a game the mapping from beliefs over one s opponents actions to
More informationA class of coherent risk measures based on one-sided moments
A class of coherent risk measures based on one-sided moments T. Fischer Darmstadt University of Technology November 11, 2003 Abstract This brief paper explains how to obtain upper boundaries of shortfall
More informationTABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC
TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC THOMAS BOLANDER AND TORBEN BRAÜNER Abstract. Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known
More informationREMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7
REMARKS ON K3 SURFACES WTH NON-SYMPLECTC AUTOMORPHSMS OF ORDER 7 SHNGO TAK Abstract. n this note, we treat a pair of a K3 surface and a non-symplectic automorphism of order 7m (m = 1, 3 and 6) on it. We
More informationThe Binomial Theorem and Consequences
The Binomial Theorem and Consequences Juris Steprāns York University November 17, 2011 Fermat s Theorem Pierre de Fermat claimed the following theorem in 1640, but the first published proof (by Leonhard
More information3 Arbitrage pricing theory in discrete time.
3 Arbitrage pricing theory in discrete time. Orientation. In the examples studied in Chapter 1, we worked with a single period model and Gaussian returns; in this Chapter, we shall drop these assumptions
More informationδ j 1 (S j S j 1 ) (2.3) j=1
Chapter The Binomial Model Let S be some tradable asset with prices and let S k = St k ), k = 0, 1,,....1) H = HS 0, S 1,..., S N 1, S N ).) be some option payoff with start date t 0 and end date or maturity
More informationPricing theory of financial derivatives
Pricing theory of financial derivatives One-period securities model S denotes the price process {S(t) : t = 0, 1}, where S(t) = (S 1 (t) S 2 (t) S M (t)). Here, M is the number of securities. At t = 1,
More informationExistentially closed models of the theory of differential fields with a cyclic automorphism
Existentially closed models of the theory of differential fields with a cyclic automorphism University of Tsukuba September 15, 2014 Motivation Let C be any field and choose an arbitrary element q C \
More informationHints on Some of the Exercises
Hints on Some of the Exercises of the book R. Seydel: Tools for Computational Finance. Springer, 00/004/006/009/01. Preparatory Remarks: Some of the hints suggest ideas that may simplify solving the exercises
More informationChapter 1 Additional Questions
Chapter Additional Questions 8) Prove that n=3 n= n= converges if, and only if, σ >. nσ nlogn) σ converges if, and only if, σ >. 3) nlognloglogn) σ converges if, and only if, σ >. Can you see a pattern?
More informationDevelopment Separation in Lambda-Calculus
Development Separation in Lambda-Calculus Hongwei Xi Boston University Work partly funded by NSF grant CCR-0229480 Development Separation in Lambda-Calculus p.1/26 Motivation for the Research To facilitate
More informationFiscal Devaluations in a Model with Capital
Fiscal Devaluations in a Model with Capital Emmanuel Farhi Harvard University Gita Gopinath Harvard University Oleg Itskhoki Princeton University First Draft: June 3 2011 This Draft: September 25 2014
More informationLecture 14: Basic Fixpoint Theorems (cont.)
Lecture 14: Basic Fixpoint Theorems (cont) Predicate Transformers Monotonicity and Continuity Existence of Fixpoints Computing Fixpoints Fixpoint Characterization of CTL Operators 1 2 E M Clarke and E
More informationA relation on 132-avoiding permutation patterns
Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL, 205, 285 302 A relation on 32-avoiding permutation patterns Natalie Aisbett School of Mathematics and Statistics, University of Sydney,
More information2 Deduction in Sentential Logic
2 Deduction in Sentential Logic Though we have not yet introduced any formal notion of deductions (i.e., of derivations or proofs), we can easily give a formal method for showing that formulas are tautologies:
More informationLecture 2: The Simple Story of 2-SAT
0510-7410: Topics in Algorithms - Random Satisfiability March 04, 2014 Lecture 2: The Simple Story of 2-SAT Lecturer: Benny Applebaum Scribe(s): Mor Baruch 1 Lecture Outline In this talk we will show that
More informationTwo Equivalent Conditions
Two Equivalent Conditions The traditional theory of present value puts forward two equivalent conditions for asset-market equilibrium: Rate of Return The expected rate of return on an asset equals the
More informationThe Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.
The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write
More informationOrthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF
Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Will Johnson February 18, 2014 1 Introduction Let T be some C-minimal expansion of ACVF. Let U be the monster
More informationSublinear Time Algorithms Oct 19, Lecture 1
0368.416701 Sublinear Time Algorithms Oct 19, 2009 Lecturer: Ronitt Rubinfeld Lecture 1 Scribe: Daniel Shahaf 1 Sublinear-time algorithms: motivation Twenty years ago, there was practically no investigation
More informationOn equation. Boris Bartolomé. January 25 th, Göttingen Universität & Institut de Mathémathiques de Bordeaux
Göttingen Universität & Institut de Mathémathiques de Bordeaux Boris.Bartolome@mathematik.uni-goettingen.de Boris.Bartolome@math.u-bordeaux1.fr January 25 th, 2016 January 25 th, 2016 1 / 19 Overview 1
More informationLecture 5: Iterative Combinatorial Auctions
COMS 6998-3: Algorithmic Game Theory October 6, 2008 Lecture 5: Iterative Combinatorial Auctions Lecturer: Sébastien Lahaie Scribe: Sébastien Lahaie In this lecture we examine a procedure that generalizes
More informationlast problem outlines how the Black Scholes PDE (and its derivation) may be modified to account for the payment of stock dividends.
224 10 Arbitrage and SDEs last problem outlines how the Black Scholes PDE (and its derivation) may be modified to account for the payment of stock dividends. 10.1 (Calculation of Delta First and Finest
More informationLECTURE 2: MULTIPERIOD MODELS AND TREES
LECTURE 2: MULTIPERIOD MODELS AND TREES 1. Introduction One-period models, which were the subject of Lecture 1, are of limited usefulness in the pricing and hedging of derivative securities. In real-world
More informationLecture 6. 1 Polynomial-time algorithms for the global min-cut problem
ORIE 633 Network Flows September 20, 2007 Lecturer: David P. Williamson Lecture 6 Scribe: Animashree Anandkumar 1 Polynomial-time algorithms for the global min-cut problem 1.1 The global min-cut problem
More informationOctober An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution.
October 13..18.4 An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution. We now assume that the reservation values of the bidders are independently and identically distributed
More informationGame Theory: Normal Form Games
Game Theory: Normal Form Games Michael Levet June 23, 2016 1 Introduction Game Theory is a mathematical field that studies how rational agents make decisions in both competitive and cooperative situations.
More informationLecture l(x) 1. (1) x X
Lecture 14 Agenda for the lecture Kraft s inequality Shannon codes The relation H(X) L u (X) = L p (X) H(X) + 1 14.1 Kraft s inequality While the definition of prefix-free codes is intuitively clear, we
More informationA1: American Options in the Binomial Model
Appendix 1 A1: American Options in the Binomial Model So far we were dealing with options which can be excercised only at a fixed time, at their maturity date T. These are european options. In a complete
More informationComputing Unsatisfiable k-sat Instances with Few Occurrences per Variable
Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Department of Computer Science, University of Toronto, shlomoh,szeider@cs.toronto.edu Abstract.
More informationIEOR 3106: Introduction to OR: Stochastic Models. Fall 2013, Professor Whitt. Class Lecture Notes: Tuesday, September 10.
IEOR 3106: Introduction to OR: Stochastic Models Fall 2013, Professor Whitt Class Lecture Notes: Tuesday, September 10. The Central Limit Theorem and Stock Prices 1. The Central Limit Theorem (CLT See
More informationOn the Optimality of a Family of Binary Trees Techical Report TR
On the Optimality of a Family of Binary Trees Techical Report TR-011101-1 Dana Vrajitoru and William Knight Indiana University South Bend Department of Computer and Information Sciences Abstract In this
More informationA Translation of Intersection and Union Types
A Translation of Intersection and Union Types for the λ µ-calculus Kentaro Kikuchi RIEC, Tohoku University kentaro@nue.riec.tohoku.ac.jp Takafumi Sakurai Department of Mathematics and Informatics, Chiba
More information5 Deduction in First-Order Logic
5 Deduction in First-Order Logic The system FOL C. Let C be a set of constant symbols. FOL C is a system of deduction for the language L # C. Axioms: The following are axioms of FOL C. (1) All tautologies.
More information4 Martingales in Discrete-Time
4 Martingales in Discrete-Time Suppose that (Ω, F, P is a probability space. Definition 4.1. A sequence F = {F n, n = 0, 1,...} is called a filtration if each F n is a sub-σ-algebra of F, and F n F n+1
More informationTHE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES
THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES FU LIU AND BRIAN OSSERMAN Abstract. We study pure-cycle Hurwitz spaces, parametrizing covers of the projective line having only one ramified point
More informationDepartment of Mathematics. Mathematics of Financial Derivatives
Department of Mathematics MA408 Mathematics of Financial Derivatives Thursday 15th January, 2009 2pm 4pm Duration: 2 hours Attempt THREE questions MA408 Page 1 of 5 1. (a) Suppose 0 < E 1 < E 3 and E 2
More informationThe Binomial Theorem. Step 1 Expand the binomials in column 1 on a CAS and record the results in column 2 of a table like the one below.
Lesson 13-6 Lesson 13-6 The Binomial Theorem Vocabulary binomial coeffi cients BIG IDEA The nth row of Pascal s Triangle contains the coeffi cients of the terms of (a + b) n. You have seen patterns involving
More informationDisaster risk and its implications for asset pricing Online appendix
Disaster risk and its implications for asset pricing Online appendix Jerry Tsai University of Oxford Jessica A. Wachter University of Pennsylvania December 12, 2014 and NBER A The iid model This section
More informationEliminating Substitution Bias. One eliminate substitution bias by continuously updating the market basket of goods purchased.
Eliminating Substitution Bias One eliminate substitution bias by continuously updating the market basket of goods purchased. 1 Two-Good Model Consider a two-good model. For good i, the price is p i, and
More informationSupporting Information
Supporting Information Novikoff et al. 0.073/pnas.0986309 SI Text The Recap Method. In The Recap Method in the paper, we described a schedule in terms of a depth-first traversal of a full binary tree,
More informationLecture Quantitative Finance Spring Term 2015
implied Lecture Quantitative Finance Spring Term 2015 : May 7, 2015 1 / 28 implied 1 implied 2 / 28 Motivation and setup implied the goal of this chapter is to treat the implied which requires an algorithm
More informationAnnuities. Lecture: Weeks 8-9. Lecture: Weeks 8-9 (Math 3630) Annuities Fall Valdez 1 / 41
Annuities Lecture: Weeks 8-9 Lecture: Weeks 8-9 (Math 3630) Annuities Fall 2017 - Valdez 1 / 41 What are annuities? What are annuities? An annuity is a series of payments that could vary according to:
More informationDEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH
DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH Abstract. Suppose D is an ultrafilter on κ and λ κ = λ. We prove that if B i is a Boolean algebra for every i < κ and λ bounds the Depth of every
More informationPricing Dynamic Solvency Insurance and Investment Fund Protection
Pricing Dynamic Solvency Insurance and Investment Fund Protection Hans U. Gerber and Gérard Pafumi Switzerland Abstract In the first part of the paper the surplus of a company is modelled by a Wiener process.
More informationOptimal stopping problems for a Brownian motion with a disorder on a finite interval
Optimal stopping problems for a Brownian motion with a disorder on a finite interval A. N. Shiryaev M. V. Zhitlukhin arxiv:1212.379v1 [math.st] 15 Dec 212 December 18, 212 Abstract We consider optimal
More informationLevel by Level Inequivalence, Strong Compactness, and GCH
Level by Level Inequivalence, Strong Compactness, and GCH Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationINTERIM CORRELATED RATIONALIZABILITY IN INFINITE GAMES
INTERIM CORRELATED RATIONALIZABILITY IN INFINITE GAMES JONATHAN WEINSTEIN AND MUHAMET YILDIZ A. We show that, under the usual continuity and compactness assumptions, interim correlated rationalizability
More informationEcon 424/CFRM 462 Portfolio Risk Budgeting
Econ 424/CFRM 462 Portfolio Risk Budgeting Eric Zivot August 14, 2014 Portfolio Risk Budgeting Idea: Additively decompose a measure of portfolio risk into contributions from the individual assets in the
More informationAn Ascending Double Auction
An Ascending Double Auction Michael Peters and Sergei Severinov First Version: March 1 2003, This version: January 20 2006 Abstract We show why the failure of the affiliation assumption prevents the double
More informationOn Packing Densities of Set Partitions
On Packing Densities of Set Partitions Adam M.Goyt 1 Department of Mathematics Minnesota State University Moorhead Moorhead, MN 56563, USA goytadam@mnstate.edu Lara K. Pudwell Department of Mathematics
More informationCOMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS
COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence
More informationCollinear Triple Hypergraphs and the Finite Plane Kakeya Problem
Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Joshua Cooper August 14, 006 Abstract We show that the problem of counting collinear points in a permutation (previously considered by the
More informationArbitrage of the first kind and filtration enlargements in semimartingale financial models. Beatrice Acciaio
Arbitrage of the first kind and filtration enlargements in semimartingale financial models Beatrice Acciaio the London School of Economics and Political Science (based on a joint work with C. Fontana and
More informationPrice manipulation in models of the order book
Price manipulation in models of the order book Jim Gatheral (including joint work with Alex Schied) RIO 29, Búzios, Brasil Disclaimer The opinions expressed in this presentation are those of the author
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationarxiv: v1 [math.lo] 24 Feb 2014
Residuated Basic Logic II. Interpolation, Decidability and Embedding Minghui Ma 1 and Zhe Lin 2 arxiv:1404.7401v1 [math.lo] 24 Feb 2014 1 Institute for Logic and Intelligence, Southwest University, Beibei
More informationDerivative Securities
Derivative Securities he Black-Scholes formula and its applications. his Section deduces the Black- Scholes formula for a European call or put, as a consequence of risk-neutral valuation in the continuous
More informationOutline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.
Outline Coordinate Minimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University November 27, 208 Introduction 2 Algorithms Cyclic order with exact minimization
More informationStrong normalisation and the typed lambda calculus
CHAPTER 9 Strong normalisation and the typed lambda calculus In the previous chapter we looked at some reduction rules for intuitionistic natural deduction proofs and we have seen that by applying these
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Final Exam
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Final Exam PRINT your name:, (last) SIGN your name: (first) PRINT your Unix account login: Your section time (e.g., Tue 3pm): Name of the person
More informationGeneralising the weak compactness of ω
Generalising the weak compactness of ω Andrew Brooke-Taylor Generalised Baire Spaces Masterclass Royal Netherlands Academy of Arts and Sciences 22 August 2018 Andrew Brooke-Taylor Generalising the weak
More informationLecture Notes 1
4.45 Lecture Notes Guido Lorenzoni Fall 2009 A portfolio problem To set the stage, consider a simple nite horizon problem. A risk averse agent can invest in two assets: riskless asset (bond) pays gross
More information3 The Model Existence Theorem
3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe
More informationOutline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010
May 19, 2010 1 Introduction Scope of Agent preferences Utility Functions 2 Game Representations Example: Game-1 Extended Form Strategic Form Equivalences 3 Reductions Best Response Domination 4 Solution
More informationNOTES ON FIBONACCI TREES AND THEIR OPTIMALITY* YASUICHI HORIBE INTRODUCTION 1. FIBONACCI TREES
0#0# NOTES ON FIBONACCI TREES AND THEIR OPTIMALITY* YASUICHI HORIBE Shizuoka University, Hamamatsu, 432, Japan (Submitted February 1982) INTRODUCTION Continuing a previous paper [3], some new observations
More informationStructural Induction
Structural Induction Jason Filippou CMSC250 @ UMCP 07-05-2016 Jason Filippou (CMSC250 @ UMCP) Structural Induction 07-05-2016 1 / 26 Outline 1 Recursively defined structures 2 Proofs Binary Trees Jason
More informationPartial Fractions. A rational function is a fraction in which both the numerator and denominator are polynomials. For example, f ( x) = 4, g( x) =
Partial Fractions A rational function is a fraction in which both the numerator and denominator are polynomials. For example, f ( x) = 4, g( x) = 3 x 2 x + 5, and h( x) = x + 26 x 2 are rational functions.
More informationMaximizing the Spread of Influence through a Social Network Problem/Motivation: Suppose we want to market a product or promote an idea or behavior in
Maximizing the Spread of Influence through a Social Network Problem/Motivation: Suppose we want to market a product or promote an idea or behavior in a society. In order to do so, we can target individuals,
More informationIntegrating rational functions (Sect. 8.4)
Integrating rational functions (Sect. 8.4) Integrating rational functions, p m(x) q n (x). Polynomial division: p m(x) The method of partial fractions. p (x) (x r )(x r 2 ) p (n )(x). (Repeated roots).
More information6: MULTI-PERIOD MARKET MODELS
6: MULTI-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) 6: Multi-Period Market Models 1 / 55 Outline We will examine
More informationComputing Unsatisfiable k-sat Instances with Few Occurrences per Variable
Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Abstract (k, s)-sat is the propositional satisfiability problem restricted to instances where each
More informationSelf-organized criticality on the stock market
Prague, January 5th, 2014. Some classical ecomomic theory In classical economic theory, the price of a commodity is determined by demand and supply. Let D(p) (resp. S(p)) be the total demand (resp. supply)
More informationBargaining and Competition Revisited Takashi Kunimoto and Roberto Serrano
Bargaining and Competition Revisited Takashi Kunimoto and Roberto Serrano Department of Economics Brown University Providence, RI 02912, U.S.A. Working Paper No. 2002-14 May 2002 www.econ.brown.edu/faculty/serrano/pdfs/wp2002-14.pdf
More informationAn Ascending Double Auction
An Ascending Double Auction Michael Peters and Sergei Severinov First Version: March 1 2003, This version: January 25 2007 Abstract We show why the failure of the affiliation assumption prevents the double
More informationMTH6154 Financial Mathematics I Interest Rates and Present Value Analysis
16 MTH6154 Financial Mathematics I Interest Rates and Present Value Analysis Contents 2 Interest Rates 16 2.1 Definitions.................................... 16 2.1.1 Rate of Return..............................
More informationLecture 7: Computation of Greeks
Lecture 7: Computation of Greeks Ahmed Kebaier kebaier@math.univ-paris13.fr HEC, Paris Outline 1 The log-likelihood approach Motivation The pathwise method requires some restrictive regularity assumptions
More informationAbstract Algebra Solution of Assignment-1
Abstract Algebra Solution of Assignment-1 P. Kalika & Kri. Munesh [ M.Sc. Tech Mathematics ] 1. Illustrate Cayley s Theorem by calculating the left regular representation for the group V 4 = {e, a, b,
More informationFinancial Derivatives Section 5
Financial Derivatives Section 5 The Black and Scholes Model Michail Anthropelos anthropel@unipi.gr http://web.xrh.unipi.gr/faculty/anthropelos/ University of Piraeus Spring 2018 M. Anthropelos (Un. of
More informationThe Black-Scholes Model
IEOR E4706: Foundations of Financial Engineering c 2016 by Martin Haugh The Black-Scholes Model In these notes we will use Itô s Lemma and a replicating argument to derive the famous Black-Scholes formula
More information1.1 Basic Financial Derivatives: Forward Contracts and Options
Chapter 1 Preliminaries 1.1 Basic Financial Derivatives: Forward Contracts and Options A derivative is a financial instrument whose value depends on the values of other, more basic underlying variables
More informationANALYSIS OF N-CARD LE HER
ANALYSIS OF N-CARD LE HER ARTHUR T. BENJAMIN AND A.J. GOLDMAN Abstract. We present a complete solution to a card game with historical origins. Our analysis exploits convexity properties in the payoff matrix,
More information1 Cash-flows, discounting, interest rates and yields
Assignment 1 SB4a Actuarial Science Oxford MT 2016 1 1 Cash-flows, discounting, interest rates and yields Please hand in your answers to questions 3, 4, 5, 8, 11 and 12 for marking. The rest are for further
More informationSequences, Series, and Limits; the Economics of Finance
CHAPTER 3 Sequences, Series, and Limits; the Economics of Finance If you have done A-level maths you will have studied Sequences and Series in particular Arithmetic and Geometric ones) before; if not you
More informationHedging under Arbitrage
Hedging under Arbitrage Johannes Ruf Columbia University, Department of Statistics Modeling and Managing Financial Risks January 12, 2011 Motivation Given: a frictionless market of stocks with continuous
More informationNotes to The Resurrection Axioms
Notes to The Resurrection Axioms Thomas Johnstone Talk in the Logic Workshop CUNY Graduate Center September 11, 009 Abstract I will discuss a new class of forcing axioms, the Resurrection Axioms (RA),
More informationTall, Strong, and Strongly Compact Cardinals
Tall, Strong, and Strongly Compact Cardinals Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth Avenue New
More informationOn the h-vector of a Lattice Path Matroid
On the h-vector of a Lattice Path Matroid Jay Schweig Department of Mathematics University of Kansas Lawrence, KS 66044 jschweig@math.ku.edu Submitted: Sep 16, 2009; Accepted: Dec 18, 2009; Published:
More informationAmerican Foreign Exchange Options and some Continuity Estimates of the Optimal Exercise Boundary with respect to Volatility
American Foreign Exchange Options and some Continuity Estimates of the Optimal Exercise Boundary with respect to Volatility Nasir Rehman Allam Iqbal Open University Islamabad, Pakistan. Outline Mathematical
More informationE-companion to Coordinating Inventory Control and Pricing Strategies for Perishable Products
E-companion to Coordinating Inventory Control and Pricing Strategies for Perishable Products Xin Chen International Center of Management Science and Engineering Nanjing University, Nanjing 210093, China,
More informationOption Pricing. 1 Introduction. Mrinal K. Ghosh
Option Pricing Mrinal K. Ghosh 1 Introduction We first introduce the basic terminology in option pricing. Option: An option is the right, but not the obligation to buy (or sell) an asset under specified
More informationarxiv: v1 [math.oc] 23 Dec 2010
ASYMPTOTIC PROPERTIES OF OPTIMAL TRAJECTORIES IN DYNAMIC PROGRAMMING SYLVAIN SORIN, XAVIER VENEL, GUILLAUME VIGERAL Abstract. We show in a dynamic programming framework that uniform convergence of the
More informationArborescent Architecture for Decentralized Supervisory Control of Discrete Event Systems
Arborescent Architecture for Decentralized Supervisory Control of Discrete Event Systems Ahmed Khoumsi and Hicham Chakib Dept. Electrical & Computer Engineering, University of Sherbrooke, Canada Email:
More informationFor Online Publication Only. ONLINE APPENDIX for. Corporate Strategy, Conformism, and the Stock Market
For Online Publication Only ONLINE APPENDIX for Corporate Strategy, Conformism, and the Stock Market By: Thierry Foucault (HEC, Paris) and Laurent Frésard (University of Maryland) January 2016 This appendix
More information