Wilf-equivalence on k-ary words, compositions, and parking functions
|
|
- Bryce Payne
- 5 years ago
- Views:
Transcription
1 Wilf-equivalene on k-ary ords, ompositions, and parking funtions Vít Jelínek Department of Applied Mathematis, Charles University, Prague Toufik Mansour Department of Mathematis, Haifa University, Haifa, Israel Submitted: May 9, 2008; Aepted: May 4, 2009; Published: May 11, 2009 Mathematis Subjet Classifiation: Primary 05A18; Seondary 05E10, 05A17, 05A19 Abstrat In this paper, e study pattern-avoidane in the set of ords over the alphabet [k]. We say that a ord [k] n ontains a pattern τ [l] m, if ontains a subsequene order-isomorphi to τ. This notion generalizes pattern-avoidane in permutations. We determine all the Wilf-equivalene lasses of ord patterns of length at most six. We also onsider analogous problems ithin the set of integer ompositions and the set of parking funtions, hih may both be regarded as speial types of ords, and hih ontain all permutations. In both these restrited settings, e determine the equivalene lasses of all patterns of length at most five. As it turns out, the full lassifiation of these short patterns an be obtained ith only a fe general bijetive arguments, hih are appliable to patterns of arbitrary size. 1 Introdution In this paper, e study patterns avoidane in the domains of ords, integer partitions, and parking funtions. This an be seen as an extension of the frequently studied onept of pattern avoidane of permutation patterns. Our results extend previous ork of Burstein [4], ho desribed the equivalene lasses of k-ary ords of length at most 3, and Supported by the projet MSM of the Czeh Ministry of Eduation, and by the grant GD201/05/H014 of the Czeh Siene Foundation. the eletroni journal of ombinatoris 16 (2009), #R58 1
2 of Savage and Wilf [14], ho desribed the equivalene lasses of integer ompositions of length at most 3. Our lassifiation is largely based on several ne bijetive arguments, inspired by the ideas from Krattenthaler [11], Bakelin, West and Xin [3], and Jelínek and Mansour [9]. 1.1 k-ary ords Let [k] = {1, 2,..., k} be a totally ordered alphabet of k letters, and let [k] n denote the set of ords of length n over this alphabet. Consider to ords, σ [k] n and τ [l] m. Assume additionally that τ ontains all letters 1 through l (a ord ith this property ill be alled a pattern). We say that σ ontains an ourrene of τ, or simply that σ ontains τ, if σ has a subsequene orderisomorphi to τ, i.e., if there exist 1 i 1 <... < i m n suh that, for any to indies 1 a, b m, σ ia < σ ib if and only if τ a < τ b. If σ ontains no ourrenes of τ, e say that σ avoids τ. For a pattern τ, let [k] n (τ) denote the set of k-ary ords of length n hih avoid the pattern τ. Let f τ (n, k) be the number of τ-avoiding ords in [k] n, i.e., f τ (n, k) = [k] n (τ). We say that to patterns τ and τ are ord-equivalent (or, more briefly, -equivalent), and e rite τ τ, if for all values of k and n, e have f τ (n, k) = f τ (n, k). There are to operations on ords hih trivially preserve the -equivalene, alled the reversal and the omplement. The reversal of a ord τ [k] m, denoted by r(τ), is obtained by riting the letters of τ in the reverse order, i.e., the i-th letter of r(τ) is equal to the (m i+1)-th letter of τ. The omplement of a ord τ, denoted by (τ), is obtained by turning τ upside-don, i.e., a letter j is replaed by the letter l j+1, here l is the largest letter of τ. For example, if l = 3, m = 4, then r(1232) = 2321, (1232) = 3212, r((1232)) = (r(1232)) = Clearly, r = r and r 2 = 2 = ( r) 2 = id, so r, is a group of symmetries of a retangle. Several authors have previously onsidered pattern avoidane in ords [1, 2, 4, 5, 10, 13]. In 1998, Burstein [4] proved that In 2002, Burstein and Mansour [5] proved that By these to results e obtain that there are 3 -equivalene lasses of patterns of length three: 111, , Compositions A omposition σ = σ 1 σ 2... σ m of n N is an ordered olletion of one or more positive integers hose sum is n. The numbers σ 1,...,σ m are alled parts of the omposition. We let C n denote set of all ompositions of n. We say that the omposition σ C n ontains a pattern τ [l] s, if σ ontains a subsequene order-isomorphi to τ. Let C n (τ) denote the set of all the ompositions in the eletroni journal of ombinatoris 16 (2009), #R58 2
3 C n that avoid τ. We say that to patterns τ and τ are omposition-equivalent (or just -equivalent), and e rite τ τ, if for all values of n, e have C n (τ) = C n (τ ). It is easy to see that every pattern is -equivalent to its reversal. Hoever, a pattern does not need to be -equivalent to its omplement. Savage and Wilf [14] onsidered pattern avoidane in ompositions for a single pattern τ S 3 (S 3 is the set of the permutations on three letters), and shoed that the number of ompositions of n avoiding τ S 3 is independent of τ, that is, Reently, Heubah, Mansour and Munagi [7] shoed that and These to results omplete the lassifiation of patterns of length three in ompositions, and sho they form exatly 4 -equivalene lasses: , , , Parking funtions A ord σ [k] n is alled a parking funtion if for every i = 1,..., n, σ has at least i letters smaller or equal to i. Let PF n denote the set of parking funtions of length n, and let PF n (τ) be the set of the parking funtions of length n that avoid a pattern τ. We say that to patterns τ, τ are p-equivalent, denoted by τ p τ, if for every n, the to sets PF n (τ) and PF n (τ ) have the same ardinality. Clearly, eah pattern is p-equivalent to its reversal. Although some enumerative aspets of parking funtions have been previously studied [6, 12, 15], e are not aare of any previous results dealing ith pattern avoidane in this setting. 1.4 Strong equivalene of ords We no introdue an equivalene relation on ords, hih refines all the equivalenes mentioned above. For a ord σ of length n, the ontent of σ is the unordered multiset of the n letters appearing in σ. In partiular, to ords have the same ontent, if one an be obtained from the other by a suitable rearrangement of letters. We say that to patterns τ, τ are strongly equivalent, denoted by τ s τ, if for every k, n there is a bijetion f beteen [k] n (τ) and [k] n (τ ) ith the property that for every σ [k] n (τ), the ord f(σ) has the same ontent as σ. Clearly, if to patterns are strongly equivalent, then they are also -equivalent, -equivalent and p-equivalent. Eah pattern is strongly equivalent to its reversal, and if to patterns τ and τ are strongly equivalent, then their omplements (τ) and (τ ) are strongly equivalent as ell. In this note, e adapt previous results on fillings of diagrams [11], as ell as results on pattern-avoidane in set partitions [9] to desribe several types of ontent-preserving the eletroni journal of ombinatoris 16 (2009), #R58 3
4 bijetions beteen pattern-avoiding families of ords. Using systemati omputer enumeration of small patterns, e verify that these bijetions, together ith the reversal and omplement operations, are suffiient to desribe all the -equivalent patterns of length at most six. Similarly, e verify that our results on strong equivalene desribe all the -equivalene and p-equivalene lasses of patterns of size at most five. In partiular, for patterns of size at most five, -equivalene lasses oinide ith p-equivalene lasses (but not ith -equivalene lasses, beause -equivalene is losed under omplementation and reversal, hereas p- and -equivalene is only losed under reversal). In the appendix, e briefly summarize the equivalene lasses of small patterns, ith respet to -, -, and p-equivalene. The full enumeration data and the soure odes of the omputer programs e used are available on the ebsite of the seond author [16, 17, 18, 19, 20, 21]. 2 Strongly equivalent families In this setion, e use several tehniques previously applied in the ontext of fillings of Ferrers diagrams to obtain lasses of strongly equivalent ords. We may represent k-ary ords of length n as 0 1 matries ith k ros and n olumns and exatly one 1-ell in eah olumn. We assume that the ros of a matrix are numbered bottom-to-top, and the olumns are numbered left-to-right. For a ord σ of length n over the alphabet [k], let M(σ, k) be the k n matrix ith a 1-ell in ro i and olumn j if and only the j-th letter of σ is equal to i. With this representation, e may use knon bijetions on fillings of diagrams to obtain diretly ne equivalenes among ords. A Ferrers diagram is an array of ells hose olumns have noninreasing length, and the bottom ells of the olumns appear in the same ro. A filling of a Ferrers diagram is an assignment of zeros and ones into its ells suh that every olumn has exatly one 1-ell. We say that a filling of a Ferrers shape F ontains a matrix M if F has a (not neessarily ontiguous) retangular subshape hih indues a filling idential to M. We ill say that to matries M and M are Ferrersequivalent if for every Ferrers shape F the number of M-avoiding fillings is equal to the number of M -avoiding fillings. We say that M and M are strongly Ferrers-equivalent if for every Ferrers shape F there is a bijetion beteen M-avoiding and M -avoiding fillings of F that preserves the number of 1-ells in eah ro. The folloing lemma allos us to translate results about fillings of Ferrers shapes into results about ords. The lemma is based on an idea hih is often applied in the ontext of pattern-avoiding permutations [3], graphs [8] or set partitions [9]. For a ord ρ [l] n and an integer k, e let ρ + k denote the ord obtained by inreasing eah letter of ρ by k. Lemma 2.1. Let τ and τ be to patterns ith k letters, let ρ be a pattern ith l letters. If M(τ, k) and M(τ, k) are strongly Ferrers-equivalent then the to (k +l)-letter patterns τ(ρ + k) and τ (ρ + k) are strongly equivalent. (Here τ(ρ + k) denotes the onatenation of τ and ρ + k.) the eletroni journal of ombinatoris 16 (2009), #R58 4
5 Proof. Let us rite σ = τ(ρ + k) and σ = τ (ρ + k). For a given m and n, hoose a ord x [m] n (σ), and let M = M(x, m) be its orresponding matrix. Note that M avoids the matrix M(σ, k + l). Color the ells of M red and green, here a ell is green if and only if the submatrix of M stritly to the right and stritly to the top of ontains M(ρ, l), otherise the ell is red. Note that the green ells form a Ferrers diagram and that the nonzero olumns of this diagram indue an M(τ, k)-avoiding filling. Using the strong Ferrers-equivalene of M(τ, k) and M(τ, k), e may transform this filling into a M(τ, k)-avoiding filing. This operation transforms M into a matrix M representing a σ -avoiding ord x ith the same ontent as x. To see that this operation an be inverted, observe that the operation has only modified the filling of the green ells of M. Observe also that for every green ell of M, there is a opy of M(ρ, l) stritly to the right and stritly above hih only onsists of red ells. Thus the red ells of M oinide ith the red ells of M. We thus have a bijetion shoing that σ s σ. Using knon results about Ferrers equivalene [8, 9, 11], e obtain the folloing equivalenes, valid for any pattern ρ. Fat 2.2. M(12 k, k) is strongly Ferrers equivalent to M(k(k 1) 1, k) [11]. This implies that 12 k(ρ + k) s k(k 1) 1(ρ + k). Fat 2.3. M(2 i 12 j, 2) is strongly Ferrers-equivalent to M(12 i+j, 2), for any i, j 0 [9, Lemma 39]. This implies that 2 i 12 j (ρ + 2) s 12 i+j (ρ + 2). The above-mentioned results do not aount for all the equivalenes among ordpatterns of small length. To omplete our lassifiation, e need another lemma, hose proof uses an idea that has been previously applied in the ontext of pattern-avoiding set partitions [9, Theorem 48]. Lemma 2.4. For any k, all the patterns that onsist of a single symbol 1, a single symbol 3 and k 2 symbols 2 are strongly equivalent. Proof. Let k be fixed. Let τ(i, j) denote the ord of length k hose i-th symbol is 1, the j-th symbol is 3 and the remaining symbols are equal to 2. Our aim is to sho that all the patterns in the set {τ(i, j), i j, 1 i, j k} are strongly equivalent. Sine eah ord is strongly equivalent to its reversal, e only need to deal ith the ords τ(i, j) ith i < j. From Fat 2.3, e dedue that the ords {τ(1, j), j = 2,...,k} are all strongly equivalent, and the ords {τ(i, k), i = 1,..., k 1} are all strongly equivalent as ell. To prove the lemma, it suffies to sho that for every i < j < k, the ord τ(i, j) is strongly equivalent to the ord τ(i + 1, j + 1). Let m be an integer. We ill say that a ord σ ontains τ(i, j) at level m if there is a pair of symbols l, h suh that l < m < h, and suh that the ord σ ontains a subord over the alphabet {l, m, h} hih is orderisomorphi to τ(i, j). For example, the ord ontains the pattern 1223 at level 3 (due to the subord 1334), hile it avoids 1223 at level 2. the eletroni journal of ombinatoris 16 (2009), #R58 5
6 Assume no that e are given a fixed pair of indies i, j, ith i < j < k, and e ant to provide a ontent-preserving bijetion beteen τ(i, j)-avoiding and τ(i+1, j +1)- avoiding ords of length n. We ill say that a ord σ is an m-hybrid if for every m < m, the ord σ avoids τ(i, j) at level m, hile for every m m, σ avoids τ(i+1, j+1) at level m. We ill present, for any m 1, a ontent-preserving bijetion beteen m-hybrids and (m + 1)-hybrids. By omposing these bijetions, e obtain the required bijetion beteen τ(i, j)-avoiding and τ(i + 1, j + 1)-avoiding ords. Let m 1 be fixed. Let σ be an arbitrary ord. A letter of σ is alled lo if it is smaller than m, and a letter is alled high if it is greater than m. A lo luster of σ is a maximal blok of onseutive lo symbols of σ. A high luster is defined analogously. Thus, every symbol of σ different from m belongs to a unique luster. The landsape of σ is a ord over the alphabet {L, m, H} obtained by replaing every lo luster of σ by a single symbol L, and every high luster of σ by a single symbol H. Note that σ ontains τ(i, j) at level m if and only if the landsape of σ ontains the subsequene m i 1 Lm j i 1 Hm k j. We ill no desribe the bijetion beteen m-hybrids and (m + 1)-hybrids. Let σ be an m-hybrid ord, let X be its landsape. We split X into three parts X = P ms, here P is the prefix of X formed by all the symbols of X that appear before the first ourrene of m in X, and S is the suffix of all the symbols that appear after the first ourrene of m. Let us define a ord X by X = SmP. Note that X ontains a subsequene m i 1 Lm j i 1 Hm k j if and only if X ontains a subsequene m i Lm j i 1 Hm k j 1. Thus, sine X is a landsape of a ord that avoids τ(i + 1, j + 1) at level m, e kno that any ord ith landsape X must avoid τ(i, j) at level m. Let us define a ord σ by the folloing three rules. 1. The ord σ has landsape X. 2. For any p, the p-th lo luster of σ onsists of the same sequene of symbols as the p-th lo luster of σ. 3. For any q, the q-th high luster of σ onsists of the same sequene of symbols as the q-th high luster of σ. Clearly, there is a unique ord σ satisfying these properties. Note that the subsequene of all the lo symbols of σ is the same as the subsequene of all the lo symbols of σ, and these sequenes are partitioned into lo lusters in the same ay. An analogous property holds for the high symbols too. We laim that σ is an (m + 1)-hybrid. We have already pointed out that σ avoids τ(i, j) at level m. Let us no argue that σ avoids τ(i, j) at level m, for every m < m. For ontradition, assume that σ ontains a subsequene T = m i 1 lm j i 1 hm k j, for some l < m < h. If h < m, then all the symbols of T are lo, and sine σ has the same subsequene of lo symbols as σ, e kno that σ also ontains T as a subsequene, ontraditing the assumption that σ is an m-hybrid. Assume no that h m. Let x and y be the to symbols adjaent to h in the sequene T (note that h is not the last symbol of T, so x and y are ell defined). Both x and y are the eletroni journal of ombinatoris 16 (2009), #R58 6
7 lo, and they belong to distint lo lusters of σ, beause the symbol h is not lo. Sine the lo symbols of σ are the same as the lo symbols of σ, and they are partitioned into lusters in the same ay, e kno that σ ontains a subsequene m i 1 lm j i 1 h m k j, here h is a non-lo symbol. This shos that σ ontains τ(i, j) at level m, hih is impossible, beause σ is an m-hybrid. By an analogous argument, e may sho that σ avoids τ(i + 1, j + 1) at any level m > m. We onlude that the mapping desribed above transforms an m-hybrid σ into an (m + 1)-hybrid σ. It is lear that the mapping is reversible and provides the required bijetion beteen m-hybrids and (m + 1)-hybrids. Appendix A: the -equivalene lasses In Tables 1, 2 and 3, e list the nontrivial -equivalene lasses of patterns of size 4, 5 and 6, respetively. From eah symmetry lass (i.e., a lass generated by reversal and omplement of a single pattern) e only list the lexiographially minimal pattern. We only list the -equivalene lasses that have at least to nonsymmetri elements Table 1: -equivalene lasses of patterns of size Table 2: -equivalene lasses of patterns of size Table 3: -equivalene lasses of patterns of size 6 the eletroni journal of ombinatoris 16 (2009), #R58 7
8 Appendix B: p-equivalene and -equivalene lasses In Tables 4 and 5, e list the nontrivial -equivalene lasses for patterns of size 4 and 5, respetively. For patterns of these sizes, the -equivalene lasses oinide ith p- equivalene lasses. A symmetry lass of a pattern is generated by the reversal operation. We again onsider only one representative of eah symmetry lass, and e only list the -equivalene lasses ith at least to nonsymmetri elements Table 4: -equivalene lasses of patterns of size Table 5: -equivalene lasses of patterns of size 5 Referenes [1] M. Albert, R. Aldred, M.D. Atkinson, C. Handley, and D. Holton, Permutations of a multiset avoiding permutations of length 3, Europ. J. Combin. 22 (2001) [2] N. Alon and E. Friedgut, On the number of permutations avoiding a given pattern, J. Combin. Theory Series A 89 (2000) [3] J. Bakelin, J. West, and G. Xin, Wilf-equivalene for singleton lasses, Adv. Appl. Math. 32:2 (2007) [4] A. Burstein, Enumeration of ords ith forbidden patterns, Ph.D. thesis, University of Pennsylvania, [5] A. Burstein and T. Mansour, Words restrited by patterns ith at most 2 distint letters, Eletron. J. Combin. 9:2 (2002), #R3. [6] S.-P. Eu, T.-S. Fu, and C.-J. Lai, On the enumeration of parking funtions by leading terms, Adv. in Appl. Math. 35:4 (2005) [7] S. Heubah, T. Mansour, and A. Munagi, Avoiding permutation patterns of type (2, 1) in ompositions, preprint. [8] A. de Mier, k-nonrossing and k-nonnesting graphs and fillings of Ferrers diagrams, Eletroni Notes in Disrete Mathematis 28 (2007) the eletroni journal of ombinatoris 16 (2009), #R58 8
9 [9] V. Jelínek and T. Mansour, On pattern-avoiding partitions Elet. J. Combin. 15:1 (2008), #R39. [10] M. Klazar, The Füredi-Hajnal onjeture implies the Stanley-Wilf onjeture, Formal poer series and algebrai ombinatoris (Moso,2000), Springer, Berlin (2000) [11] C. Krattenthaler, Groth diagrams, and inreasing and dereasing hains in fillings of Ferrers shapes, Adv. Appl. Math. 37:3 (2006) [12] A. Rattan, Permutation fatorizations and prime parking funtions, Ann. Comb. 10:2 (2006) [13] A. Regev, Asymptotis of the number of k-ords ith an l-desent, Elet. J. Combin. 5 (1998), #R15. [14] C. D. Savage and H. S. Wilf, Pattern avoidane in ompositions and multiset permutations, Adv. Appl. Math. 36:2 (2006) [15] C. Zara, Parking funtions, stak-sortable permutations, and spaes of paths in the Johnson graph, Eletron. J. Combin. 9:2 (2002/03) #R11. [16] [17] [18] [19] ords.html [20] ompositions.html [21] parkings.html the eletroni journal of ombinatoris 16 (2009), #R58 9
Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm
Properties of the nonsymmetri Roinson-Shensted-Knuth algorithm James Haglund Department of Mathematis University of Pennsylvania, Philadelphia, PA 90. USA jhaglund@math.upenn.edu Sarah Mason Department
More informationRanking dynamics and volatility. Ronald Rousseau KU Leuven & Antwerp University, Belgium
Ranking dynamis and volatility Ronald Rousseau KU Leuven & Antwerp University, Belgium ronald.rousseau@kuleuven.be Joint work with Carlos Garía-Zorita, Sergio Marugan Lazaro and Elias Sanz-Casado Department
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 informationEconomics 2202 (Section 05) Macroeconomic Theory Practice Problem Set 3 Suggested Solutions Professor Sanjay Chugh Fall 2014
Department of Eonomis Boston College Eonomis 2202 (Setion 05) Maroeonomi Theory Pratie Problem Set 3 Suggested Solutions Professor Sanjay Chugh Fall 2014 1. Interation of Consumption Tax and Wage Tax.
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 informationTransport tax reforms, two-part tariffs, and revenue recycling. - A theoretical result
Transport tax reforms, to-part tariffs, and revenue reyling - A theoretial result Abstrat Jens Erik Nielsen Danish Transport Researh Institute We explore the interation beteen taxes on onership and on
More informationTOTAL PART 1 / 50 TOTAL PART 2 / 50
Department of Eonomis University of Maryland Eonomis 35 Intermediate Maroeonomi Analysis Midterm Exam Suggested Solutions Professor Sanjay Chugh Fall 009 NAME: Eah problem s total number of points is shown
More informationTechnische Universität Ilmenau Institut für Mathematik
Tehnishe Universität Ilmenau Institut für Mathematik Preprint No. M 09/23 The Repeater Tree Constrution Problem Bartoshek, Christoph; Held, Stephan; Maßberg, Jens; Rautenbah, Dieter; Vygen, Jens 2009 Impressum:
More informationThe Government of the State of Israel and the Government of the Republi of Argentina, hereinafter referred to as the "Contrating Parties," DESIRING to
AGREEMENT BETWEEN THE GOVERNMENT OF THE STATE OF ISRAEL AND.. THE GOVERNMENT OF THE REPUBLIC OF ARGENTINA FOR THE PROMOTION AND RECIPROCAL PROTECTION OF INVESTMENTS E if> The Government of the State of
More informationEconomics 325 Intermediate Macroeconomic Analysis Practice Problem Set 1 Suggested Solutions Professor Sanjay Chugh Spring 2011
Department of Eonomis Universit of Marland Eonomis 35 Intermediate Maroeonomi Analsis Pratie Problem Set Suggested Solutions Professor Sanja Chugh Spring 0. Partial Derivatives. For eah of the following
More informationOn Packing Densities of Set Partitions
On Packing Densities of Set Partitions arxiv:1301.1303v1 [math.co] 7 Jan 2013 Adam M.Goyt 1 Department of Mathematics Minnesota State University Moorhead Moorhead, MN 56563, USA goytadam@mnstate.edu Lara
More informationOptimal Disclosure Decisions When There are Penalties for Nondisclosure
Optimal Dislosure Deisions When There are Penalties for Nondislosure Ronald A. Dye August 16, 2015 Abstrat We study a model of the seller of an asset who is liable for damages to buyers of the asset if,
More informationSay you have $X today and can earn an annual interest rate r by investing it. Let FV denote the future value of your investment and t = time.
Same as with Labor Supply, maximizing utility in the ontext of intertemporal hoies is IDEN- TICAL to what we ve been doing, just with a different budget onstraint. Present and Future Value Say you have
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 informationLecture 6 International Trade Theory 1/2008 The Specific Factor Model Kornkarun Kungpanidchakul, Ph.D
Leture 6 International Trade Theory 1/2008 The Seii Fator Model Kornkarun Kunganidhakul, Ph.D The seii ator model is one o the attemt to imrove the Heksher- Ohlin model by removing the assumtion that both
More informationValuation of Bermudan-DB-Underpin Option
Valuation of Bermudan-DB-Underpin Option Mary, Hardy 1, David, Saunders 1 and Xiaobai, Zhu 1 1 Department of Statistis and Atuarial Siene, University of Waterloo Marh 31, 2017 Abstrat The study of embedded
More informationRobust portfolio optimization using second-order cone programming
1 Robust portfolio optimization using second-order cone programming Fiona Kolbert and Laurence Wormald Executive Summary Optimization maintains its importance ithin portfolio management, despite many criticisms
More informationQuadrant marked mesh patterns in 123-avoiding permutations
Quadrant marked mesh patterns in 23-avoiding permutations Dun Qiu Department of Mathematics University of California, San Diego La Jolla, CA 92093-02. USA duqiu@math.ucsd.edu Jeffrey Remmel Department
More informationDynamic Pricing of Di erentiated Products
Dynami Priing of Di erentiated Produts Rossitsa Kotseva and Nikolaos Vettas August 6, 006 Abstrat We examine the dynami priing deision of a rm faing random demand while selling a xed stok of two di erentiated
More informationON TRANSACTION COSTS IN STOCK TRADING
QUANTITATIVE METHODS IN ECONOMICS Volume XVIII, No., 07, pp. 58 67 ON TRANSACTION COSTS IN STOCK TRADING Marek Andrzej Koiński Faulty of Applied Informatis and Mathematis Warsaw University of Life Sienes
More informationProblem Set 8 Topic BI: Externalities. a) What is the profit-maximizing level of output?
Problem Set 8 Topi BI: Externalities 1. Suppose that a polluting firm s private osts are given by TC(x) = 4x + (1/100)x 2. Eah unit of output the firm produes results in external osts (pollution osts)
More informationNash Bargaining Part I - The Continuous Case
Nash Bargaining Part I - The Continuous Case Prajit K. Dutta Satoru Takahashi January 15, 2013 Abstrat This paper onsiders finite horizon alternating move two player bargaining with a ontinuum of agreements.
More informationAnnual Return/Report of Employee Benefit Plan
Form 5500 Department of the Treasury Internal Revenue Servie Department of Labor Employee Benefits Seurity Administration Pension Benefit Guaranty Corporation Annual Return/Report of Employee Benefit Plan
More informationPage 80. where C) refers to estimation cell (defined by industry and, for selected industries, region)
Nonresponse Adjustment in the Current Statistis Survey 1 Kennon R. Copeland U.S. Bureau of Labor Statistis 2 Massahusetts Avenue, N.E. Washington, DC 20212 (Copeland.Kennon@bls.gov) I. Introdution The
More informationThe Impact of Capacity Costs on Bidding Strategies in Procurement Auctions
Review of Aounting Studies, 4, 5 13 (1999) 1999 Kluwer Aademi Publishers, Boston. Manufatured in The Netherlands. The Impat of Capaity Costs on Bidding Strategies in Prourement Autions JÖRG BUDDE University
More informationImportantly, note that prices are not functions of the expenditure on advertising that firm 1 makes during the first period.
ECONS 44 STRATEGY AND GAME THEORY HOMEWORK #4 ANSWER KEY Exerise - Chapter 6 Watson Solving by bakward indution:. We start from the seond stage of the game where both firms ompete in pries. Sine market
More informationLimiting Limited Liability
Limiting Limited Liability Giuseppe Dari-Mattiai Amsterdam Center for Law & Eonomis Working Paper No. 2005-05 This paper an be downloaded without harge from the Soial Siene Researh Network Eletroni Paper
More informationPublic Sector Rationing and Private Sector Selection
Publi Setor Rationing and Private Setor Seletion Simona Grassi Faulty of Business and Eonomis Institut d Eonomie et de Management de la Santé Université de Lausanne simona.grassi@unil.h Ching-to Albert
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 informationLaurence Boxer and Ismet KARACA
SOME PROPERTIES OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we study digital versions of some properties of covering spaces from algebraic topology. We correct and
More informationP C. w a US PT. > 1 a US LC a US. a US
And let s see hat happens to their real ages ith free trade: Autarky ree Trade P T = 1 LT P T = 1 PT > 1 LT = 1 = 1 rom the table above, it is clear that the purchasing poer of ages of American orkers
More informationi e SD No.2015/0206 PAYMENT SERVICES REGULATIONS 2015
i e SD No.2015/0206 PAYMENT SERVICES REGULATIONS 2015 Payment Servies Regulations 2015 Index PAYMENT SERVICES REGULATIONS 2015 Index Regulation Page PART 1 INTRODUCTION 7 1 Title... 7 2 Commenement...
More informationGRAPH: A network of NODES (or VERTICES) and ARCS (or EDGES) joining the nodes with each other
GRPH: network of NS (or VRTIS) and RS (or GS) joining the nodes with eah other IGRPH: graph where the ars have an RINTTIN (or IRTIN). a Graph a igraph d e d HIN etween two nodes is a sequene of ars where
More informationFree Space Path Loss of UWB Communications
Free Spae Path Loss of UWB Communiations Pihaya Supanakoon 1, Sathit Aroonpraparat 1, Sathaporn Promwong 1 and Jun-ihi Takada 1 Department of Information Engineering, Faulty of Engineering, King Mongkut
More informationPrices, Social Accounts and Economic Models
Paper prepared for the 10th Global Eonomi Analysis Conferene, "Assessing the Foundations of Global Eonomi Analysis", Purdue University, Indiana, USA, June 2007 Pries, Soial Aounts and Eonomi Models Sott
More informationA solution by stochastic iteration method for nonlinear Black- Scholes equation with transaction cost and volatile portfolio risk in Hilbert space
International Journal of Mathematial Analysis and Appliations 2014; 1(3): 43-48 Published online August 20, 2014 (http://www.aasit.org/journal/ijmaa) A solution by stohasti iteration method for nonlinear
More informationEcon 101A Midterm 2 Th 6 November 2003.
Econ 101A Midterm 2 Th 6 November 2003. You have approximately 1 hour and 20 minutes to anser the questions in the midterm. I ill collect the exams at 12.30 sharp. Sho your k, and good luck! Problem 1.
More informationSAMPLE CHAPTERS UNESCO EOLSS INVESTMENT MODELS. Ulrich Rieder University of Ulm, Germany
INVESMEN MODELS Ulrih Rieder University of Ulm, Germany Keywords: meanvariane ortfolio seletion, Markowitz model, minimum variane ortfolio, twofund searation, HARAutility, BlakSholes model, stohasti dynami
More informationGeneral Registry (Miscellaneous Fees) Order 2016 GENERAL REGISTRY (MISCELLANEOUS FEES) ORDER 2016
General Registry (Misellaneous Fees) Order 2016 Index GENERAL REGISTRY (MISCELLANEOUS FEES) ORDER 2016 Index Artile Page 1 Title... 3 2 Commenement... 3 3 Misellaneous Fees in the General Registry... 3
More informationClipping Coupons: Redemption of Offers with Forward-Looking Consumers
Clipping Coupons: Redemption of Offers with Forward-Looking Consumers Kissan Joseph Oksana Loginova Marh 6, 2019 Abstrat Consumer redemption behavior pertaining to oupons, gift ertifiates, produt sampling,
More informationState of New Mexico Participation Agreement for Deferred Compensation Plan
State of New Mexio Partiipation Agreement for Deferred Compensation Plan DC-4068 (06/2016) For help, please all 1-866-827-6639 www.newmexio457d.om 1 Things to Remember Please print Payroll Center/Plan
More informationBonus-Malus System with the Claim Frequency Distribution is Geometric and the Severity Distribution is Truncated Weibull
IOP Conferene Series: Earth and Environmental Siene PAPER OPEN ACCESS Bonus-Malus System with the Claim Frequeny Distribution is Geometri and the Severity Distribution is Trunated Weibull To ite this artile:
More informationarxiv: v1 [math.co] 31 Mar 2009
A BIJECTION BETWEEN WELL-LABELLED POSITIVE PATHS AND MATCHINGS OLIVIER BERNARDI, BERTRAND DUPLANTIER, AND PHILIPPE NADEAU arxiv:0903.539v [math.co] 3 Mar 009 Abstract. A well-labelled positive path of
More informationSocial Network Games with Obligatory Product Selection
Social Netork Games ith Obligatory Product Selection Krzysztof R. Apt Centre for Mathematics and Computer Science (CWI), ILLC, University of Amsterdam, The Netherlands k.r.apt@ci.nl Sunil Simon Centre
More informationRoad Transport Regulations 2018 ROAD TRANSPORT REGULATIONS Title Commencement Interpretation... 5
Road Transport Regulations 2018 Index ROAD TRANSPORT REGULATIONS 2018 Index Regulation Page 1 Title... 5 2 Commenement... 5 3 Interpretation... 5 PART 2 ROAD TRANSPORT LICENSING COMMITTEE 6 MEETINGS OF
More informationBidding for network size
MPRA Munih Personal RePE Arhive Bidding for network size Renaud Fouart and Jana Friedrihsen Humboldt University, Berlin, BERA and BCCP, DIW, Berlin, Humboldt University, Berlin, BERA and BCCP 21 June 2016
More informationInversion Formulae on Permutations Avoiding 321
Inversion Formulae on Permutations Avoiding 31 Pingge Chen College of Mathematics and Econometrics Hunan University Changsha, P. R. China. chenpingge@hnu.edu.cn Suijie Wang College of Mathematics and Econometrics
More informationSequential Procurement Auctions and Their Effect on Investment Decisions
Sequential Prourement Autions and Their Effet on Investment Deisions Gonzalo isternas Niolás Figueroa November 2007 Abstrat In this paper we haraterize the optimal prourement mehanism and the investment
More informationProblem Set #3 (15 points possible accounting for 3% of course grade) Due in hard copy at beginning of lecture on Wednesday, March
Department of Economics M. Doell California State University, Sacramento Spring 2011 Intermediate Macroeconomics Economics 100A Problem Set #3 (15 points possible accounting for 3% of course grade) Due
More informationInformation Acquisition in Financial Markets: a Correction
Information Acquisition in Financial Markets: a Correction Gadi Barlevy Federal Reserve Bank of Chicago 30 South LaSalle Chicago, IL 60604 Pietro Veronesi Graduate School of Business University of Chicago
More informationAvailability Analysis with Opportunistic Maintenance of a Two Component Deteriorating System
Analysis with Maintenane of a Two Component Deteriorating System Joel P. Varghese and Girish Kumar Abstrat This paper desribes the opportunisti maintenane model for availability analysis of two omponent
More informationUsing the Average of the Extreme Values of a Triangular Distribution for a Transformation, and Its Approximant via the Continuous Uniform Distribution
British Journal of Mathematis & Computer Siene 4(4):., 014 ISSN: 31-0851 SCIENCEDOMAIN international www.sienedomain.org Using the Average of the Extreme Values of a Triangular Distribution for a Transformation,
More informationPermutation Factorizations and Prime Parking Functions
Permutation Factorizations and Prime Parking Functions Amarpreet Rattan Department of Combinatorics and Optimization University of Waterloo Waterloo, ON, Canada N2L 3G1 arattan@math.uwaterloo.ca June 10,
More informationState of New Mexico Distribution Request for Deferred Compensation Plan
State of New Mexio Distribution Request for Deferred Compensation Plan DC-4075 (12/2015) For help, please all 1-866-827-6639 www.newmexio457d.om 1 Things to Remember Complete all of the setions on the
More informationCalculus VCT plc. For investors looking for regular, tax-free income. Please send completed application packs to:
Calulus VCT pl For investors looking for regular, tax-free inome Please send ompleted appliation paks to: Calulus EIS Fund, 104 Park Street, London, W1K 6NF A portfolio of entrepreneurial, growing UK ompanies
More informationFORCING AND THE HALPERN-LÄUCHLI THEOREM. 1. Introduction This document is a continuation of [1]. It is intended to be part of a larger paper.
FORCING AND THE HALPERN-LÄUCHLI THEOREM NATASHA DOBRINEN AND DAN HATHAWAY Abstract. We will show the various effects that forcing has on the Halpern-Läuchli Theorem. We will show that the the theorem at
More informationCounty of San Diego Participation Agreement for 457(b) Deferred Compensation Plan
County of San Diego Partiipation Agreement for 457(b) Deferred Compensation Plan DC-4769 (07/16) For help, please all 1-888-DC4-LIFE www.mydcplan.om 1 Things to Remember Complete all of the setions on
More informationMidterm Exam 2. Tuesday, November 1. 1 hour and 15 minutes
San Francisco State University Michael Bar ECON 302 Fall 206 Midterm Exam 2 Tuesday, November hour and 5 minutes Name: Instructions. This is closed book, closed notes exam. 2. No calculators of any kind
More informationGENERAL DESCRIPTION OF THE DB GLOBAL SOVEREIGN INDICES
Dated: 20 July 2010 GENERAL DESCRIPTION OF THE DB GLOBAL SOVEREIGN INDICES ALTHOUGH THE INDEX SPONSOR WILL OBTAIN INFORMATION FOR INCLUSION IN OR FOR USE IN THE CALCULATION OF AN INDEX FROM SOURCES WHICH
More informationMaximum Contiguous Subsequences
Chapter 8 Maximum Contiguous Subsequences In this chapter, we consider a well-know problem and apply the algorithm-design techniques that we have learned thus far to this problem. While applying these
More informationFOREST CITY INDUSTRIAL PARK FIN AN CIAL RETURNS EXECUTIVE SUMMARY
FOREST CITY INDUSTRIAL PARK FIN AN CIAL RETURNS EXECUTIVE SUMMARY The City of London is engagedl in industrial land development for the sole purpose of fostering eonomi growth. The dynamis of industrial
More informationChapter 17: Vertical and Conglomerate Mergers
Chapter 17: Vertical and Conglomerate Mergers Learning Objectives: Students should learn to: 1. Apply the complementary goods model to the analysis of vertical mergers.. Demonstrate the idea of double
More informationD Accounting for management
QU EST IONS ounting for management 17 mins 1.1 Whih of the following statements about qualities of good information is false? It should be relevant for its purposes It should be ommuniated to the right
More informationMATHICSE Mathematics Institute of Computational Science and Engineering School of Basic Sciences - Section of Mathematics
MATHICSE Mathematis Institute of Computational Siene and Engineering Shool of Basi Sienes - Setion of Mathematis MATHICSE Tehnial Report Nr. 17.211 April 211 Boosted hybrid method for solving hemial reation
More informationA Dynamic Model of Mixed Duopolistic Competition: Open Source vs. Proprietary Innovation
A Dynamic Model of Mixed Duopolistic Competition: Open Source vs. Proprietary Innovation Suat Akbulut Murat Yılmaz August 015 Abstract Open source softare development has been an interesting investment
More informationEconomics 602 Macroeconomic Theory and Policy Problem Set 4 Suggested Solutions Professor Sanjay Chugh Summer 2010
Department of Applied Eonomis Johns Hopkins University Eonomis 6 Maroeonomi Theory and Poliy Prolem Set 4 Suggested Solutions Professor Sanjay Chugh Summer Optimal Choie in the Consumption-Savings Model
More informationOn Models for Object Lifetime Distributions
On Models for Objet Lifetime Distributions Darko Stefanović Department of Eletrial Engineering Prineton University Prineton, NJ 8544 darko@am.org Kathryn S. MKinley Department of Computer Siene University
More informationAnnual Return/Report of Employee Benefit Plan
Form 5500 Department of the Treasury Internal Revenue Servie Department of Labor Employee Benefits Seurity Administration Pension Benefit Guaranty Corporation Annual Return/Report of Employee Benefit Plan
More informationPalindromic Permutations and Generalized Smarandache Palindromic Permutations
arxiv:math/0607742v2 [mathgm] 8 Sep 2007 Palindromic Permutations and Generalized Smarandache Palindromic Permutations Tèmítópé Gbóláhàn Jaíyéọlá Department of Mathematics, Obafemi Awolowo University,
More informationCONSUMPTION-LEISURE FRAMEWORK SEPTEMBER 20, 2010 THE THREE MACRO (AGGREGATE) MARKETS. The Three Macro Markets. Goods Markets.
CONSUMPTION-LEISURE FRAMEWORK SEPTEMBER 20, 2010 The Three Maro Markets THE THREE MACRO (AGGREGATE) MARKETS Goods Markets P Labor Markets Capital/Savings/Funds/Asset Markets interest rate labor Will put
More informationCATEGORICAL SKEW LATTICES
CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most
More informationHealth Savings Account Application
Health Savings Aount Appliation FOR BANK USE ONLY: ACCOUNT # CUSTOMER # Health Savings Aount (HSA) Appliation ALL FIELDS MUST BE COMPLETED. Missing fields may delay the aount opening proess and possibly
More informationTitle: Bertrand-Edgeworth Competition, Demand Uncertainty, and Asymmetric Outcomes * Authors: Stanley S. Reynolds Bart J. Wilson
Title: Bertrand-Edgeworth Competition, Demand Unertainty, and Asymmetri Outomes * Authors: Stanley S. Reynolds Bart J. Wilson Department of Eonomis Eonomi Siene Laboratory College of Business & Publi Admin.
More informationAn Estimation of the Size of Non-Compact Suffix Trees
Ata Cyernetia 22 (2016) 823 832. An Estimation of the Size of Non-Compat Suffix Trees Bálint Vásárhelyi Astrat A suffix tree is a data struture used mainly for pattern mathing. It is known that the spae
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 informationValue Added Tax (Flat-rate Valuation of Supplies of Fuel for Private Use) Order 2013
Index VALUE ADDED TAX (FLAT-RATE VALUATION OF SUPPLIES OF FUEL FOR PRIVATE USE) ORDER 2013 Index Artile Page 1 Title... 3 2 Commenement... 3 3 Flat-rate basis of valuation of supplies of fuel for private
More informationFirst-price equilibrium and revenue equivalence in a sequential procurement auction model
Eon Theory (200) 43:99 4 DOI 0.007/s0099-008-0428-7 RESEARCH ARTICLE First-prie equilibrium and revenue equivalene in a sequential prourement aution model J. Philipp Reiß Jens Robert Shöndube Reeived:
More informationStudy on Rural Microfinance System s Defects and Risk Control Based on Operational Mode
International Business and Management Vol. 10, No. 2, 2015, pp. 43-47 DOI:10.3968/6807 ISSN 1923-841X [Print] ISSN 1923-8428 [Online] www.sanada.net www.sanada.org Study on Rural Mirofinane System s Defets
More informationCONSUMPTION-LABOR FRAMEWORK SEPTEMBER 19, (aka CONSUMPTION-LEISURE FRAMEWORK) THE THREE MACRO (AGGREGATE) MARKETS. The Three Macro Markets
CONSUMPTION-LABOR FRAMEWORK (aka CONSUMPTION-LEISURE FRAMEWORK) SEPTEMBER 19, 2011 The Three Maro Markets THE THREE MACRO (AGGREGATE) MARKETS Goods Markets P Labor Markets Finanial/Capital/Savings/Asset
More informationMath 1313 Test 3 Supplemental Review. For questions 1 12, state the type of problem and calculate the answer.
Math 1313 Test 3 Supplemental Review For questions 1 12, state the type of problem and alulate the answer. 1. Parents of a ollege student wish to set up an aount that will pay $350 per month to the student
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationMath-Stat-491-Fall2014-Notes-V
Math-Stat-491-Fall2014-Notes-V Hariharan Narayanan December 7, 2014 Martingales 1 Introduction Martingales were originally introduced into probability theory as a model for fair betting games. Essentially
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 informationA Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks
A Truthful Budget Feasible Multi-Armed Bandit Mehanism for Crowdsouring Time Critial Tasks ABSTRACT Arpita Biswas Xerox Researh Centre India Bangalore, India arpita.biswas@xerox.om Debmalya Mandal Shool
More informationThe literature on purchasing power parity (PPP) relates free trade to price equalization.
Price Equalization Does Not Imply Free Trade Piyusha Mutreja, B Ravikumar, Raymond G Riezman, and Michael J Sposi In this article, the authors demonstrate the possibility of price equalization in a to-country
More informationLECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS
LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS Recall from Lecture 2 that if (A, φ) is a non-commutative probability space and A 1,..., A n are subalgebras of A which are free with respect to
More informationAt a cost-minimizing input mix, the MRTS (ratio of marginal products) must equal the ratio of factor prices, or. f r
ECON 311 NAME: KEY Fall Quarter, 2011 Prof. Hamilton Final Exam 200 points 1. (30 points). A firm in Los Angeles produes rubber gaskets using labor, L, and apital, K, aording to a prodution funtion Q =
More informationarxiv: v1 [cs.cv] 11 Nov 2015
A Continuous Max-Flow Approah to Cyli Field Reonstrution John S.H. Baxter a,b, Jonathan MLeod a,b, and Terry M. Peters a,b a Robarts Researh Institute, London, Ontario, Canada; b Western University, London,
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 informationDamage, Death and Downtime Risk Attenuation in the 2011 Christchurch Earthquake
Damage, Death and Downtime Risk Attenuation in the 2011 Christhurh Earthquake J.B. Mander & Y. Huang Zahry Department of Civil Engineering, Texas A&M University, College Station, TX 77843 USA. 2012 NZSEE
More informationTHE NEGATIVE BINOMIAL-ERLANG DISTRIBUTION WITH APPLICATIONS. Kasetsart University Chatuchak, Bangkok, 10900, THAILAND
International Journal of Pure and Applied Mathematis Volume 92 No. 3 2014, 389-401 ISSN: 1311-8080 (printed version; ISSN: 1314-3395 (on-line version url: http://www.ipam.eu doi: http://d.doi.org/10.12732/ipam.v92i3.7
More information3. The Dynamic Programming Algorithm (cont d)
3. The Dynamic Programming Algorithm (cont d) Last lecture e introduced the DPA. In this lecture, e first apply the DPA to the chess match example, and then sho ho to deal ith problems that do not match
More informationINTRODUCTION TO MATHEMATICAL MODELLING LECTURES 3-4: BASIC PROBABILITY THEORY
9 January 2004 revised 18 January 2004 INTRODUCTION TO MATHEMATICAL MODELLING LECTURES 3-4: BASIC PROBABILITY THEORY Project in Geometry and Physics, Department of Mathematics University of California/San
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 informationClass Notes: Week 6. Multinomial Outcomes
Ronald Hek Class Notes: Week 6 1 Class Notes: Week 6 Multinomial Outomes For the next ouple of weeks or so, we will look at models where there are more than two ategories of outomes. Multinomial logisti
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 informationLicensing and Patent Protection
Kennesaw State University DigitalCommons@Kennesaw State University Faulty Publiations 00 Liensing and Patent Protetion Arijit Mukherjee University of Nottingham Aniruddha Baghi Kennesaw State University,
More informationDecision-making Method for Low-rent Housing Construction Investment. Wei Zhang*, Liwen You
5th International Conferene on Civil Enineerin and Transportation (ICCET 5) Deision-makin Method for Low-rent Housin Constrution Investment Wei Zhan*, Liwen You University of Siene and Tehnoloy Liaonin,
More informationSupplementary material Expanding vaccine efficacy estimation with dynamic models fitted to cross-sectional prevalence data post-licensure
Supplementary material Expanding vaccine efficacy estimation ith dynamic models fitted to cross-sectional prevalence data post-licensure Erida Gjini a, M. Gabriela M. Gomes b,c,d a Instituto Gulbenkian
More informationA simple Consumption-based Capital Asset Pricing Model
simle Consumtion-based Caital sset Priing Model Integrated wit MCandless and Wallae Kjetil Storesletten Setember 3, 200 6 Introdution Purose of leture: understand te onsumtion-based aital asset riing model
More information