Secant Varieties, Symbolic Powers, Statistical Models

Size: px
Start display at page:

Download "Secant Varieties, Symbolic Powers, Statistical Models"

Transcription

1 Secant Varieties, Symbolic Powers, Statistical Models Seth Sullivant North Carolina State University November 19, 2012 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

2 Joins and Secant Varieties Given V, W P n 1, the join is V W := v, w P n 1 v V,w W W V w v Given V P n 1, the r-th secant variety of V is given by Sec 1 (V ) = V, and Sec r (V ) := V Sec r 1 (V ) = v 1,...,v r V < v 1, v 2,..., v r > P n 1 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

3 Joins and Secant Ideals Definition Let I, J K[x 1,..., x n ] homogeneous ideals. The join of I and J is I J := (I(y) + J(z) + x i y i z i : i = 1,..., n ) K[x 1,..., x n ]. i.e. f I J f (y + z) I(y) + J(z). Definition The r-th secant ideal I K[x 1,..., x n ] is defined by 1 I {1} = I 2 I {r} = I I {r 1}, r > 1. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

4 Matrices of Bounded Rank Consider K[X] := K[x ij : 1 i m, 1 j n] Let I be the ideal of 2 2 minors of generic matrix x 11 x 12 x 1n X = x m1 x m2 x mn V (I) P mn 1 is the set of rank 1 matrices. (aka Seg(P m 1 P n 1 )) Sec r (V (I)) is the set of all matrices of rank r. I {r} = I(Sec r (V (I))) is the ideal of (r + 1) (r + 1) minors of X. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

5 When is the Secant Ideal Nice? Question For which ideals I does I {2} = 0? i.e. When is V (I) {2} = P n 1? Theorem (Zak 1994) If V (I) is a linearly nondegenerate, smooth irreducible variety of codimension 1 3 n + 1, then I{2} = 0 unless V (I) is one of ν 2 (P 2 ), Seg(P 2 P 2 ), Gr(2, 6), or the Cartan variety. Question For which ideals I is I {r} generated by polynomials of degree r + 1? Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

6 Symbolic Powers Definition The rth symbolic power of I R is the ideal I (r) = (R 1 I I r ) R where R I is the complement of the union of the minimal primes of I. If P is a prime ideal, P (r) is the P-primary component of P r. Theorem ((Special case of) Zariski-Nagata) If I C[x 1,..., x n ] is radical then I (r) = I <r> := f a f x a I for all a Nn with n a i r 1. i=1 Symbolic power gives equations vanishing to high order on V (I). Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

7 Ideal of 2 2 minors Consider K[X] := K[x ij : 1 i m, 1 j n] Let I be the ideal of 2 2 minors of generic matrix X. The partial derivatives of minors of a generic matrix are themselves minors of a generic matrix. e.g. x 11 x 12 x 13 x x 21 x 22 x 23 = x 22 x x 31 x 32 x 33 x 32 x 33 I (2) generated by 3 3 minors and products of minors of X. Note, if m = 2, then I (2) = I 2. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

8 When are the Symbolic Powers Nice? I Definition A radical ideal I is normally torsion free if I (r) = I r for all r 1. Complete intersections, Maximal minors Theorem (Ein-Lazarsfeld-Smith, Hochster-Huneke) I (codim(i)r) I r for all r in an equal characteristic regular ring. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

9 Secant Ideals and Symbolic Powers Proposition For I C[x 1,..., x n ], I <r> = I x 1,..., x n r. Proposition (Catalano-Johnson) If I C[x 1,..., x n ], homogeneous and I x 1,..., x n 2, then Proof. I {r} I <r>. I {r} = I I {r 1} I x 1,..., x n r = I <r>. Proposition (Landsberg-Manivel, Sidman-Sullivant) If I C[x 1,..., x n ], homogeneous and I x 1,..., x n d, then I <(d 1)(r 1)+1> (d 1)r+1 = I {r} (d 1)r+1 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

10 When are the Symbolic Powers nice? II Catalano-Johnson says I {r} I <r>. Product rule gives I <r i> I <i> I <r>, i = 1,..., r 1. Putting together gives I {λ 1} I {λ l } I <r> λ r where the sum is over all partitions of r. Definition An ideal I C[x 1,..., x n ] is differentially perfect if and only if I <r> = λ r I {λ 1} I {λ l } for all r 1. Normally torsion free ideal, determinantal and Pfaffian ideals Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

11 Secants and Symbolic Powers of Monomial Ideals Definition Let G be an undirected graph, with vertex set [n] = {1, 2,..., n}. The edge ideal of G is I(G) = x i x j : ij E(G) I(G) = x 1 x 2, x 2 x 3, x 3 x 4, x 4 x 5, x 5 x 6, x 1 x 6, x 2 x 4 5 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

12 Secants of Edge Ideals and Colorings Given a graph G and subset of vertices V, G V is the induced subgraph of G with vertex set V. The chromatic number χ(g) is the smallest number of colors to properly color the vertices of a graph. Theorem (Sturmfels-Sullivant) The secant ideals of an edge ideal I(G) are generated by I(G) {r} = i V x i : χ(g V ) > r. Minimal generators of I(G) {r} are minimal obstructions to r-coloring G I(G) {2} = x 2 x 3 x 4, x 1 x 2 x 4 x 5 x 6 5 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

13 Nice Secant Ideals of Edge Ideals Proposition I(G) {2} = 0 if and only if G is a bipartite graph. Proposition I(G) {r} is generated in degree r + 1 for all r if and only if G is a perfect graph Not perfect I(G) {2} = x 2 x 3 x 4, x 1 x 2 x 4 x 5 x 6 5 Perfect I(G) {2} = x 1 x 2 x 5, x 1 x 5 x 6, x 2 x 3 x 4, x 2 x 4 x 5 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

14 Symbolic Powers of Edge Ideals and Coverings The covering number τ(g) is the size of the smallest vertex cover of G. 5 a = (1, 2, 1, 1, 0, 0) For a vector a N n the parallelization G a is the graph with each vertex i replicated a i times. Theorem I(G) <r> = x a : τ(g a ) r Generators of symbolic powers are minimal obstructions to covering. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

15 Nice Symbolic Powers of Edge Ideals Theorem (Simis-Vasconcelos-Villarreal) I(G) <r> = I(G) r for all r if and only if G is a bipartite graph. Theorem (Villarreal, Sullivant) I(G) is differentially perfect, i.e. I(G) <r> = I(G) {λ 1} I(G) {λ l } λ r for all r if and only if G is a perfect graph. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

16 Statistical Models Definition A statistical model is a set of probability distributions or densities. Independence model for two discrete random variables: M X Y = P = (p ij) R m n : p ij = 1, p ij 0, rank P = 1 i,j (Zariski closure of ) many statistical models have structure of algebraic varieties Many of those varieties are secant varieties or joins Mixture models Factor analysis Can use that algebraic structure to answer statistical questions. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

17 Join vs. Mixture Join W V w v Mixture W V w v Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

18 Identifiability of Phylogenetic Mixture Models Theorem (Rhodes-Sullivant) The unrooted tree and numerical parameters in a r-class, same tree phylogenetic mixture model on n-leaf trivalent trees are generically identifiable, if r < 4 n/4. Identifiability for Secant Varieties: Does a generic point on the r th secant variety Sec r (V ) lie on a unique secant r 1 plane to V? Proof uses: Relation to identifiability problem for Sec 4r (Seg(P a P b P c )) Knowledge of generators of the secant ideals I {r} T Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

19 Factor Analysis A centered Gaussian random vector X R n has density function ( 1 f (x) = (2π) n/2 exp 1 ) Σ 1/2 2 x T Σ 1 x with Σ PD n R n(n+1)/2. Set of all centered Gaussian r.v. s parametrized by PD n. A Gaussian statistical model is a subset Θ PD n. Definition (Factor Analysis Model) Θ r,n = {Ψ + ΛΛ T Ψ > 0 diagonal, Λ R r n } PD n Diagonal plus rank r PSD matrix. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

20 Factor Analysis Model assumptions: X 1,..., X n are observable covariates. Y 1,..., Y r are fewer unobservable (hidden) factors, which explain the correlation among X 1,..., X n. For all i, j, X i X j Y 1,..., Y r For all i, j Y i Y j Y 1 Y 2 Example (g-theory) X i are test scores, and Y j are underlying types of intelligence. X 1 X 2 X 3 X 4 X 5 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

21 Model Selection: How Many Factors? What is r? Statistical Approach Mathematical Problem Wald-Type Test Find generators of I(Θ r,n ) Likelihood Ratio Test Compute tangent cone TC p (Θ r,n ) at p Θ r 1,n. Information Criteria (AIC, BIC, WAIC) Determine the Real Log-Canonical Threshold of singular fibers of Θ r,n. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

22 The Second Hypersimplex Observation Θ r,n = Sec r (Θ 1,n ) Θ 1,n is a toric variety called the second hypersimplex. φ : P 2n 1 P n(n+1)/2 1 Definition { λi λ φ ij (ψ, λ) = j if i j ψ i + λ 2 i if i = j I 1,n = I(im φ) toric ideal of second hypersimplex I r,n = I {r} 1,n = vanishing ideal of r-factor model Quadratic Gröbner basis of I 1,n computed by De Loera-Sturmfels-Thomas Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

23 Theorem (Sullivant) The secant ideal I 2,n = I {2} 1,n has a Gröbner basis, with squarefree initial terms, consisting of polynomials of all odd degrees between 3 and n, with respect to a circular term order. Proof idea: Degenerative strategy: Hope that in (I {2} 1,n ) = (in (I 1,n )) {2} Lemma (Simis-Ulrich) For any I and any term order in (I {r} ) (in (I)) {r} Just need to construct polynomials in I {r} whose initial terms generate (in (I)) {r}. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

24 Initial Ideal Structure and Symbolic Powers The initial ideal in (I 1,n ) is an edge ideal. The graph G n such that in (I 1,n ) = I(G n ) is the non-crossing pair graph of the cyclically embedded complete graph K n. [De Loera-Sturmfels-Thomas] in (I 1,n ) {2} is generated by the odd cycles in G n. Construct polynomials in I 2,n having those cycles as initial terms. σ 12 σ 15 σ 23 σ 34 σ 45 σ 12 σ 13 σ 25 σ 34 σ 45 σ 12 σ 14 σ 23 σ 35 σ 45 +σ 12 σ 14 σ 25 σ 34 σ 35 +σ 12 σ 13 σ 24 σ 35 σ 45 σ 12 σ 15 σ 24 σ 34 σ 35 +σ 13 σ 14 σ 23 σ 25 σ 45 σ 13 σ 14 σ 24 σ 25 σ 35 σ 13 σ 15 σ 23 σ 24 σ 45 +σ 13 σ 15 σ 24 σ 25 σ 34 σ 14 σ 15 σ 23 σ 25 σ 34 +σ 14 σ 15 σ 23 σ 24 σ 35 Prove that these generalized pentads are in I {2} 1,n using symbolic powers. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

25 Summary Secant varieties and symbolic powers are intimately related. Symbolic powers shed light on equations for secant varieties. In special cases, symbolic powers structure complete determined by secant ideals. Nice combinatorial and computational structure. Secant varieties make frequent appearance in statistics. Mixture models Factor analysis model Theoretical advances on secant varieties lead to advances in statistics. Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

26 References M. Catalano-Johnson. The homogeneous ideals of higher secant varieties. J. Pure Appl. Algebra 158 (2001), no. 2-3, J. de Loera, B. Sturmfels, R. Thomas. Gröbner bases and triangulations of the second hypersimplex. Combinatorica 15 (1995), no. 3, L. Ein, R. Lazarsfeld, K. Smith. Uniform bounds and symbolic powers on smooth varieties. Invent. Math. 144 (2001), no. 2, D. Eisenbud and M. Hochster. A Nullstellensatz with nilpotents and Zariski s main lemma on holomorphic functions. J. Algebra 58 (1979), no. 1, M. Haiman. Commutative algebra of n points in the plane. With an appendix by Ezra Miller. Math. Sci. Res. Inst. Publ., 51, Trends in commutative algebra, , Cambridge Univ. Press, Cambridge, M. Hochster, C. Huneke. Comparison of symbolic and ordinary powers of ideals. Invent. Math. 147 (2002), no. 2, J. Landsberg, L. Manivel. On the projective geometry of rational homogeneous varieties. Comment. Math. Helv. 78 (2003), no. 1, J. A. Rhodes and S. Sullivant, Identifiability of large phylogenetic mixture models. Bull. Math. Biol. 74 (2012), no. 1, J. Sidman and S. Sullivant. Prolongations and computational algebra. Canadian Journal of Mathematics 61 no. 4 (2009) A. Simis, B. Ulrich. On the ideal of an embedded join. J. Algebra 226 (2000), no. 1, Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

27 A. Simis, W. Vasconcelos. R. Villarreal. On the ideal theory of graphs. J. Algebra 167 (1994), no. 2, B. Sturmfels and S. Sullivant. Combinatorial secant varieties. Quarterly Journal of Pure and Applied Mathematics 2 (2006) S. Sullivant Combinatorial symbolic powers. J. Algebra 319 (2008), no. 1, S. Sullivant. A Gröbner basis for the secant ideal of the second hypersimplex. Journal of Commutative Algebra 1 no.2 (2009) R. H. Villarreal, Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs, J. Algebraic Combin. 27 (2008), no. 3, F. L. Zak. Tangents and secants of algebraic varieties, Translations of Mathematical Monographs, 127, AMS Press, Seth Sullivant (NCSU) Secant Varieties, etc. November 19, / 27

Algebraic Problems in Graphical Modeling

Algebraic Problems in Graphical Modeling Algebraic Problems in Graphical Modeling Mathias Drton Department of Statistics University of Chicago Outline 1 What (roughly) are graphical models? a.k.a. Markov random fields, Bayesian networks,... 2

More information

Decompositions of Binomial Ideals

Decompositions of Binomial Ideals Decompositions of Binomial Ideals Laura Felicia Matusevich Texas A&M University AMS Spring Central Sectional Meeting, April 17, 2016 Polynomial Ideals R = k[x 1 ; : : : ; x n ] the polynomial ring over

More information

Applied Mathematics Letters

Applied Mathematics Letters Applied Mathematics Letters 23 (2010) 286 290 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml The number of spanning trees of a graph Jianxi

More information

On the h-vector of a Lattice Path Matroid

On 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 information

DENSITY OF PERIODIC GEODESICS IN THE UNIT TANGENT BUNDLE OF A COMPACT HYPERBOLIC SURFACE

DENSITY OF PERIODIC GEODESICS IN THE UNIT TANGENT BUNDLE OF A COMPACT HYPERBOLIC SURFACE DENSITY OF PERIODIC GEODESICS IN THE UNIT TANGENT BUNDLE OF A COMPACT HYPERBOLIC SURFACE Marcos Salvai FaMAF, Ciudad Universitaria, 5000 Córdoba, Argentina. e-mail: salvai@mate.uncor.edu Abstract Let S

More information

Strong Subgraph k-connectivity of Digraphs

Strong Subgraph k-connectivity of Digraphs Strong Subgraph k-connectivity of Digraphs Yuefang Sun joint work with Gregory Gutin, Anders Yeo, Xiaoyan Zhang yuefangsun2013@163.com Department of Mathematics Shaoxing University, China July 2018, Zhuhai

More information

A Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs

A Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs A Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles, USA Email: dliu@calstatela.edu Xuding Zhu

More information

Course Information and Introduction

Course Information and Introduction August 20, 2015 Course Information 1 Instructor : Email : arash.rafiey@indstate.edu Office : Root Hall A-127 Office Hours : Tuesdays 12:00 pm to 1:00 pm in my office (A-127) 2 Course Webpage : http://cs.indstate.edu/

More information

Permutation Factorizations and Prime Parking Functions

Permutation 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 information

Cumulants and triangles in Erdős-Rényi random graphs

Cumulants and triangles in Erdős-Rényi random graphs Cumulants and triangles in Erdős-Rényi random graphs Valentin Féray partially joint work with Pierre-Loïc Méliot (Orsay) and Ashkan Nighekbali (Zürich) Institut für Mathematik, Universität Zürich Probability

More information

ON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH

ON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH Discussiones Mathematicae Graph Theory 37 (2017) 623 632 doi:10.7151/dmgt.1941 ON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH WITH GIVEN k-connectivity Yuefang Sun Department of Mathematics Shaoxing University

More information

CURVATURE AND TORSION FORMULAS FOR CONFLICT SETS

CURVATURE AND TORSION FORMULAS FOR CONFLICT SETS GEOMETRY AND TOPOLOGY OF CAUSTICS CAUSTICS 0 BANACH CENTER PUBLICATIONS, VOLUME 6 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 004 CURVATURE AND TORSION FORMULAS FOR CONFLICT SETS MARTIJN

More information

Financial Mathematics III Theory summary

Financial Mathematics III Theory summary Financial Mathematics III Theory summary Table of Contents Lecture 1... 7 1. State the objective of modern portfolio theory... 7 2. Define the return of an asset... 7 3. How is expected return defined?...

More information

Robustness, Canalyzing Functions and Systems Design

Robustness, Canalyzing Functions and Systems Design Robustness, Canalyzing Functions and Systems Design Johannes Rauh Nihat Ay SFI WORKING PAPER: 2012-11-021 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily

More information

Chapter 7: Portfolio Theory

Chapter 7: Portfolio Theory Chapter 7: Portfolio Theory 1. Introduction 2. Portfolio Basics 3. The Feasible Set 4. Portfolio Selection Rules 5. The Efficient Frontier 6. Indifference Curves 7. The Two-Asset Portfolio 8. Unrestriceted

More information

Geometric tools for the valuation of performance-dependent options

Geometric tools for the valuation of performance-dependent options Computational Finance and its Applications II 161 Geometric tools for the valuation of performance-dependent options T. Gerstner & M. Holtz Institut für Numerische Simulation, Universität Bonn, Germany

More information

REMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7

REMARKS 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 information

A relation on 132-avoiding permutation patterns

A 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 information

Decision theoretic estimation of the ratio of variances in a bivariate normal distribution 1

Decision theoretic estimation of the ratio of variances in a bivariate normal distribution 1 Decision theoretic estimation of the ratio of variances in a bivariate normal distribution 1 George Iliopoulos Department of Mathematics University of Patras 26500 Rio, Patras, Greece Abstract In this

More information

Modeling and Estimation of

Modeling and Estimation of Modeling and of Financial and Actuarial Mathematics Christian Doppler Laboratory for Portfolio Risk Management Vienna University of Technology PRisMa 2008 29.09.2008 Outline 1 2 3 4 5 Credit ratings describe

More information

MATH 121 GAME THEORY REVIEW

MATH 121 GAME THEORY REVIEW MATH 121 GAME THEORY REVIEW ERIN PEARSE Contents 1. Definitions 2 1.1. Non-cooperative Games 2 1.2. Cooperative 2-person Games 4 1.3. Cooperative n-person Games (in coalitional form) 6 2. Theorems and

More information

MAT 4250: Lecture 1 Eric Chung

MAT 4250: Lecture 1 Eric Chung 1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose

More information

The Probabilistic Method - Probabilistic Techniques. Lecture 7: Martingales

The Probabilistic Method - Probabilistic Techniques. Lecture 7: Martingales The Probabilistic Method - Probabilistic Techniques Lecture 7: Martingales Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2015-2016 Sotiris Nikoletseas, Associate

More information

1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH Genyuan Wang and Xiang-Gen Xia, Senior Member, IEEE

1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH Genyuan Wang and Xiang-Gen Xia, Senior Member, IEEE 1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 51, NO 3, MARCH 2005 On Optimal Multilayer Cyclotomic Space Time Code Designs Genyuan Wang Xiang-Gen Xia, Senior Member, IEEE Abstract High rate large

More information

Brouwer, A.E.; Koolen, J.H.

Brouwer, A.E.; Koolen, J.H. Brouwer, A.E.; Koolen, J.H. Published in: European Journal of Combinatorics DOI: 10.1016/j.ejc.008.07.006 Published: 01/01/009 Document Version Publisher s PDF, also known as Version of Record (includes

More information

Realizability of n-vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree

Realizability of n-vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree Realizability of n-vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree Lewis Sears IV Washington and Lee University 1 Introduction The study of graph

More information

Lecture 19: March 20

Lecture 19: March 20 CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 19: March 0 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may

More information

Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem

Collinear 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 information

ROM SIMULATION Exact Moment Simulation using Random Orthogonal Matrices

ROM SIMULATION Exact Moment Simulation using Random Orthogonal Matrices ROM SIMULATION Exact Moment Simulation using Random Orthogonal Matrices Bachelier Finance Society Meeting Toronto 2010 Henley Business School at Reading Contact Author : d.ledermann@icmacentre.ac.uk Alexander

More information

LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS

LECTURE 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 information

Portfolio Management and Optimal Execution via Convex Optimization

Portfolio Management and Optimal Execution via Convex Optimization Portfolio Management and Optimal Execution via Convex Optimization Enzo Busseti Stanford University April 9th, 2018 Problems portfolio management choose trades with optimization minimize risk, maximize

More information

GPD-POT and GEV block maxima

GPD-POT and GEV block maxima Chapter 3 GPD-POT and GEV block maxima This chapter is devoted to the relation between POT models and Block Maxima (BM). We only consider the classical frameworks where POT excesses are assumed to be GPD,

More information

On the Pentagon Relations of Valued Quivers

On the Pentagon Relations of Valued Quivers International Journal of Algebra, Vol. 9, 2015, no. 8, 355-369 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2015.5745 On the Pentagon Relations of Valued Quivers Yousuf A. Alkhezi Public

More information

Yao s Minimax Principle

Yao 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 information

MATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS

MATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS MATH307/37 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS School of Mathematics and Statistics Semester, 04 Tutorial problems should be used to test your mathematical skills and understanding of the lecture material.

More information

THE DEODHAR DECOMPOSITION OF THE GRASSMANNIAN AND THE REGULARITY OF KP SOLITONS

THE DEODHAR DECOMPOSITION OF THE GRASSMANNIAN AND THE REGULARITY OF KP SOLITONS THE DEODHAR DECOMPOSITION OF THE GRASSMANNIAN AND THE REGULARITY OF KP SOLITONS YUJI KODAMA AND LAUREN WILLIAMS Abstract. Given a point A in the real Grassmannian, it is well-known that one can construct

More information

Mathematics in Finance

Mathematics in Finance Mathematics in Finance Steven E. Shreve Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 USA shreve@andrew.cmu.edu A Talk in the Series Probability in Science and Industry

More information

Bounds on coloring numbers

Bounds on coloring numbers Ben-Gurion University, Beer Sheva, and the Institute for Advanced Study, Princeton NJ January 15, 2011 Table of contents 1 Introduction 2 3 Infinite list-chromatic number Assuming cardinal arithmetic is

More information

Cartesian Product of Two S-Valued Graphs

Cartesian Product of Two S-Valued Graphs Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 9, Number 3 (2017), pp. 347-355 International Research Publication House http://www.irphouse.com Cartesian Product of

More information

u (x) < 0. and if you believe in diminishing return of the wealth, then you would require

u (x) < 0. and if you believe in diminishing return of the wealth, then you would require Chapter 8 Markowitz Portfolio Theory 8.7 Investor Utility Functions People are always asked the question: would more money make you happier? The answer is usually yes. The next question is how much more

More information

Higher Order Freeness: A Survey. Roland Speicher Queen s University Kingston, Canada

Higher Order Freeness: A Survey. Roland Speicher Queen s University Kingston, Canada Higher Order Freeness: A Survey Roland Speicher Queen s University Kingston, Canada Second order freeness and fluctuations of random matrices: Mingo + Speicher: I. Gaussian and Wishart matrices and cyclic

More information

LECTURE 2: MULTIPERIOD MODELS AND TREES

LECTURE 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 information

Modelling strategies for bivariate circular data

Modelling strategies for bivariate circular data Modelling strategies for bivariate circular data John T. Kent*, Kanti V. Mardia, & Charles C. Taylor Department of Statistics, University of Leeds 1 Introduction On the torus there are two common approaches

More information

PORTFOLIO THEORY. Master in Finance INVESTMENTS. Szabolcs Sebestyén

PORTFOLIO THEORY. Master in Finance INVESTMENTS. Szabolcs Sebestyén PORTFOLIO THEORY Szabolcs Sebestyén szabolcs.sebestyen@iscte.pt Master in Finance INVESTMENTS Sebestyén (ISCTE-IUL) Portfolio Theory Investments 1 / 60 Outline 1 Modern Portfolio Theory Introduction Mean-Variance

More information

arxiv: v1 [math.co] 31 Mar 2009

arxiv: 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 information

Alain Hertz 1 and Sacha Varone 2. Introduction A NOTE ON TREE REALIZATIONS OF MATRICES. RAIRO Operations Research Will be set by the publisher

Alain Hertz 1 and Sacha Varone 2. Introduction A NOTE ON TREE REALIZATIONS OF MATRICES. RAIRO Operations Research Will be set by the publisher RAIRO Operations Research Will be set by the publisher A NOTE ON TREE REALIZATIONS OF MATRICES Alain Hertz and Sacha Varone 2 Abstract It is well known that each tree metric M has a unique realization

More information

Mathematics of Finance Final Preparation December 19. To be thoroughly prepared for the final exam, you should

Mathematics of Finance Final Preparation December 19. To be thoroughly prepared for the final exam, you should Mathematics of Finance Final Preparation December 19 To be thoroughly prepared for the final exam, you should 1. know how to do the homework problems. 2. be able to provide (correct and complete!) definitions

More information

Higher Order Freeness: A Survey. Roland Speicher Queen s University Kingston, Canada

Higher Order Freeness: A Survey. Roland Speicher Queen s University Kingston, Canada Higher Order Freeness: A Survey Roland Speicher Queen s University Kingston, Canada Second order freeness and fluctuations of random matrices: Mingo + Speicher: I. Gaussian and Wishart matrices and cyclic

More information

MULTISTATIONARITY IN STRUCTURED REACTION NETWORKS

MULTISTATIONARITY IN STRUCTURED REACTION NETWORKS MULTISTATIONARITY IN STRUCTURED REACTION NETWORKS ALICIA DICKENSTEIN, MERCEDES PÉREZ MILLÁN, ANNE SHIU, AND XIAOXIAN TANG Abstract Many dynamical systems arising in biology and other areas exhibit multistationarity

More information

EE/AA 578 Univ. of Washington, Fall Homework 8

EE/AA 578 Univ. of Washington, Fall Homework 8 EE/AA 578 Univ. of Washington, Fall 2016 Homework 8 1. Multi-label SVM. The basic Support Vector Machine (SVM) described in the lecture (and textbook) is used for classification of data with two labels.

More information

Martingales. by D. Cox December 2, 2009

Martingales. by D. Cox December 2, 2009 Martingales by D. Cox December 2, 2009 1 Stochastic Processes. Definition 1.1 Let T be an arbitrary index set. A stochastic process indexed by T is a family of random variables (X t : t T) defined on a

More information

Kodaira dimensions of low dimensional manifolds

Kodaira dimensions of low dimensional manifolds University of Minnesota July 30, 2013 1 The holomorphic Kodaira dimension κ h 2 3 4 Kodaira dimension type invariants Roughly speaking, a Kodaira dimension type invariant on a class of n dimensional manifolds

More information

Transcendental lattices of complex algebraic surfaces

Transcendental lattices of complex algebraic surfaces Transcendental lattices of complex algebraic surfaces Ichiro Shimada Hiroshima University November 25, 2009, Tohoku 1 / 27 Introduction Let Aut(C) be the automorphism group of the complex number field

More information

Optimizing Portfolios

Optimizing Portfolios Optimizing Portfolios An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan 2010 Introduction Investors may wish to adjust the allocation of financial resources including a mixture

More information

On equation. Boris Bartolomé. January 25 th, Göttingen Universität & Institut de Mathémathiques de Bordeaux

On 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 information

Idiosyncratic risk, insurance, and aggregate consumption dynamics: a likelihood perspective

Idiosyncratic risk, insurance, and aggregate consumption dynamics: a likelihood perspective Idiosyncratic risk, insurance, and aggregate consumption dynamics: a likelihood perspective Alisdair McKay Boston University June 2013 Microeconomic evidence on insurance - Consumption responds to idiosyncratic

More information

Geometry of orthogonally invariant matrix varieties

Geometry of orthogonally invariant matrix varieties Geometry of orthogonally invariant matrix varieties Dmitriy Drusvyatskiy Mathematics, University of Washington Joint work with H.-L. Lee (UW), G. Ottaviano (Florence), and R.R. Thomas (UW) UC Davis Algebra

More information

Equilibrium Asset Pricing: With Non-Gaussian Factors and Exponential Utilities

Equilibrium Asset Pricing: With Non-Gaussian Factors and Exponential Utilities Equilibrium Asset Pricing: With Non-Gaussian Factors and Exponential Utilities Dilip Madan Robert H. Smith School of Business University of Maryland Madan Birthday Conference September 29 2006 1 Motivation

More information

Hints on Some of the Exercises

Hints 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 information

Chapter 3 Common Families of Distributions. Definition 3.4.1: A family of pmfs or pdfs is called exponential family if it can be expressed as

Chapter 3 Common Families of Distributions. Definition 3.4.1: A family of pmfs or pdfs is called exponential family if it can be expressed as Lecture 0 on BST 63: Statistical Theory I Kui Zhang, 09/9/008 Review for the previous lecture Definition: Several continuous distributions, including uniform, gamma, normal, Beta, Cauchy, double exponential

More information

Chapter 3. Dynamic discrete games and auctions: an introduction

Chapter 3. Dynamic discrete games and auctions: an introduction Chapter 3. Dynamic discrete games and auctions: an introduction Joan Llull Structural Micro. IDEA PhD Program I. Dynamic Discrete Games with Imperfect Information A. Motivating example: firm entry and

More information

Research Statement. Dapeng Zhan

Research Statement. Dapeng Zhan Research Statement Dapeng Zhan The Schramm-Loewner evolution (SLE), first introduced by Oded Schramm ([12]), is a oneparameter (κ (0, )) family of random non-self-crossing curves, which has received a

More information

SYLLABUS AND SAMPLE QUESTIONS FOR MSQE (Program Code: MQEK and MQED) Syllabus for PEA (Mathematics), 2013

SYLLABUS AND SAMPLE QUESTIONS FOR MSQE (Program Code: MQEK and MQED) Syllabus for PEA (Mathematics), 2013 SYLLABUS AND SAMPLE QUESTIONS FOR MSQE (Program Code: MQEK and MQED) 2013 Syllabus for PEA (Mathematics), 2013 Algebra: Binomial Theorem, AP, GP, HP, Exponential, Logarithmic Series, Sequence, Permutations

More information

Valuation of performance-dependent options in a Black- Scholes framework

Valuation of performance-dependent options in a Black- Scholes framework Valuation of performance-dependent options in a Black- Scholes framework Thomas Gerstner, Markus Holtz Institut für Numerische Simulation, Universität Bonn, Germany Ralf Korn Fachbereich Mathematik, TU

More information

A No-Arbitrage Theorem for Uncertain Stock Model

A No-Arbitrage Theorem for Uncertain Stock Model Fuzzy Optim Decis Making manuscript No (will be inserted by the editor) A No-Arbitrage Theorem for Uncertain Stock Model Kai Yao Received: date / Accepted: date Abstract Stock model is used to describe

More information

CHOICE THEORY, UTILITY FUNCTIONS AND RISK AVERSION

CHOICE THEORY, UTILITY FUNCTIONS AND RISK AVERSION CHOICE THEORY, UTILITY FUNCTIONS AND RISK AVERSION Szabolcs Sebestyén szabolcs.sebestyen@iscte.pt Master in Finance INVESTMENTS Sebestyén (ISCTE-IUL) Choice Theory Investments 1 / 65 Outline 1 An Introduction

More information

Dynamic Portfolio Execution Detailed Proofs

Dynamic Portfolio Execution Detailed Proofs Dynamic Portfolio Execution Detailed Proofs Gerry Tsoukalas, Jiang Wang, Kay Giesecke March 16, 2014 1 Proofs Lemma 1 (Temporary Price Impact) A buy order of size x being executed against i s ask-side

More information

MS-E2114 Investment Science Lecture 5: Mean-variance portfolio theory

MS-E2114 Investment Science Lecture 5: Mean-variance portfolio theory MS-E2114 Investment Science Lecture 5: Mean-variance portfolio theory A. Salo, T. Seeve Systems Analysis Laboratory Department of System Analysis and Mathematics Aalto University, School of Science Overview

More information

Hyperidentities in (xx)y xy Graph Algebras of Type (2,0)

Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) Int. Journal of Math. Analysis, Vol. 8, 2014, no. 9, 415-426 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.312299 Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) W. Puninagool

More information

Objective Bayesian Analysis for Heteroscedastic Regression

Objective Bayesian Analysis for Heteroscedastic Regression Analysis for Heteroscedastic Regression & Esther Salazar Universidade Federal do Rio de Janeiro Colóquio Inter-institucional: Modelos Estocásticos e Aplicações 2009 Collaborators: Marco Ferreira and Thais

More information

Distributed Function Calculation via Linear Iterations in the Presence of Malicious Agents Part I: Attacking the Network

Distributed Function Calculation via Linear Iterations in the Presence of Malicious Agents Part I: Attacking the Network 8 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 8 WeC34 Distributed Function Calculation via Linear Iterations in the Presence of Malicious Agents Part I: Attacking

More information

CS134: Networks Spring Random Variables and Independence. 1.2 Probability Distribution Function (PDF) Number of heads Probability 2 0.

CS134: Networks Spring Random Variables and Independence. 1.2 Probability Distribution Function (PDF) Number of heads Probability 2 0. CS134: Networks Spring 2017 Prof. Yaron Singer Section 0 1 Probability 1.1 Random Variables and Independence A real-valued random variable is a variable that can take each of a set of possible values in

More information

Supplementary Material for Combinatorial Partial Monitoring Game with Linear Feedback and Its Application. A. Full proof for Theorems 4.1 and 4.

Supplementary Material for Combinatorial Partial Monitoring Game with Linear Feedback and Its Application. A. Full proof for Theorems 4.1 and 4. Supplementary Material for Combinatorial Partial Monitoring Game with Linear Feedback and Its Application. A. Full proof for Theorems 4.1 and 4. If the reader will recall, we have the following problem-specific

More information

Existentially 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 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 information

An orderly algorithm to enumerate finite (semi)modular lattices

An orderly algorithm to enumerate finite (semi)modular lattices An orderly algorithm to enumerate finite (semi)modular lattices BLAST 23 Chapman University October 6, 23 Outline The original algorithm: Generating all finite lattices Generating modular and semimodular

More information

Outline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.

Outline. 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 information

Wada s Representations of the. Pure Braid Group of High Degree

Wada s Representations of the. Pure Braid Group of High Degree Theoretical Mathematics & Applications, vol2, no1, 2012, 117-125 ISSN: 1792-9687 (print), 1792-9709 (online) International Scientific Press, 2012 Wada s Representations of the Pure Braid Group of High

More information

Non replication of options

Non replication of options Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial

More information

ME3620. Theory of Engineering Experimentation. Spring Chapter III. Random Variables and Probability Distributions.

ME3620. Theory of Engineering Experimentation. Spring Chapter III. Random Variables and Probability Distributions. ME3620 Theory of Engineering Experimentation Chapter III. Random Variables and Probability Distributions Chapter III 1 3.2 Random Variables In an experiment, a measurement is usually denoted by a variable

More information

Log-linear Dynamics and Local Potential

Log-linear Dynamics and Local Potential Log-linear Dynamics and Local Potential Daijiro Okada and Olivier Tercieux [This version: November 28, 2008] Abstract We show that local potential maximizer ([15]) with constant weights is stochastically

More information

Theorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice.

Theorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice. CONGRUENCE-PRESERVING EXTENSIONS OF FINITE LATTICES TO SEMIMODULAR LATTICES G. GRÄTZER AND E.T. SCHMIDT Abstract. We prove that every finite lattice hasa congruence-preserving extension to a finite semimodular

More information

BARUCH COLLEGE MATH 2003 SPRING 2006 MANUAL FOR THE UNIFORM FINAL EXAMINATION

BARUCH COLLEGE MATH 2003 SPRING 2006 MANUAL FOR THE UNIFORM FINAL EXAMINATION BARUCH COLLEGE MATH 003 SPRING 006 MANUAL FOR THE UNIFORM FINAL EXAMINATION The final examination for Math 003 will consist of two parts. Part I: Part II: This part will consist of 5 questions similar

More information

CTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking!

CTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking! CMSC 630 March 13, 2007 1 CTL Model Checking Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking! Mathematically, M is a model of σ if s I = M

More information

4: SINGLE-PERIOD MARKET MODELS

4: SINGLE-PERIOD MARKET MODELS 4: SINGLE-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 4: Single-Period Market Models 1 / 87 General Single-Period

More information

Double Ore Extensions versus Iterated Ore Extensions

Double Ore Extensions versus Iterated Ore Extensions Double Ore Extensions versus Iterated Ore Extensions Paula A. A. B. Carvalho, Samuel A. Lopes and Jerzy Matczuk Departamento de Matemática Pura Faculdade de Ciências da Universidade do Porto R.Campo Alegre

More information

Social Common Capital and Sustainable Development. H. Uzawa. Social Common Capital Research, Tokyo, Japan. (IPD Climate Change Manchester Meeting)

Social Common Capital and Sustainable Development. H. Uzawa. Social Common Capital Research, Tokyo, Japan. (IPD Climate Change Manchester Meeting) Social Common Capital and Sustainable Development H. Uzawa Social Common Capital Research, Tokyo, Japan (IPD Climate Change Manchester Meeting) In this paper, we prove in terms of the prototype model of

More information

Introduction Ideal lattices Ring-SIS Ring-LWE Other algebraic lattices Conclusion. Ideal Lattices. Damien Stehlé. ENS de Lyon. Berkeley, 07/07/2015

Introduction Ideal lattices Ring-SIS Ring-LWE Other algebraic lattices Conclusion. Ideal Lattices. Damien Stehlé. ENS de Lyon. Berkeley, 07/07/2015 Ideal Lattices Damien Stehlé ENS de Lyon Berkeley, 07/07/2015 Damien Stehlé Ideal Lattices 07/07/2015 1/32 Lattice-based cryptography: elegant but impractical Lattice-based cryptography is fascinating:

More information

CATEGORICAL SKEW LATTICES

CATEGORICAL 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 information

arxiv: v1 [math.lo] 27 Mar 2009

arxiv: v1 [math.lo] 27 Mar 2009 arxiv:0903.4691v1 [math.lo] 27 Mar 2009 COMBINATORIAL AND MODEL-THEORETICAL PRINCIPLES RELATED TO REGULARITY OF ULTRAFILTERS AND COMPACTNESS OF TOPOLOGICAL SPACES. V. PAOLO LIPPARINI Abstract. We generalize

More information

Some Bounds for the Singular Values of Matrices

Some Bounds for the Singular Values of Matrices Applied Mathematical Sciences, Vol., 007, no. 49, 443-449 Some Bounds for the Singular Values of Matrices Ramazan Turkmen and Haci Civciv Department of Mathematics, Faculty of Art and Science Selcuk University,

More information

Chapter 2 Portfolio Management and the Capital Asset Pricing Model

Chapter 2 Portfolio Management and the Capital Asset Pricing Model Chapter 2 Portfolio Management and the Capital Asset Pricing Model In this chapter, we explore the issue of risk management in a portfolio of assets. The main issue is how to balance a portfolio, that

More information

Chapter 8. Markowitz Portfolio Theory. 8.1 Expected Returns and Covariance

Chapter 8. Markowitz Portfolio Theory. 8.1 Expected Returns and Covariance Chapter 8 Markowitz Portfolio Theory 8.1 Expected Returns and Covariance The main question in portfolio theory is the following: Given an initial capital V (0), and opportunities (buy or sell) in N securities

More information

Riemannian Geometry, Key to Homework #1

Riemannian Geometry, Key to Homework #1 Riemannian Geometry Key to Homework # Let σu v sin u cos v sin u sin v cos u < u < π < v < π be a parametrization of the unit sphere S {x y z R 3 x + y + z } Fix an angle < θ < π and consider the parallel

More information

Anh Maciag. A Two-Person Bargaining Problem

Anh Maciag. A Two-Person Bargaining Problem Anh Maciag Saint Mary s College of California Department of Mathematics May 16, 2016 A Two-Person Bargaining Problem Supervisors: Professor Kathryn Porter Professor Michael Nathanson Professor Chris Jones

More information

Capital Allocation Principles

Capital Allocation Principles Capital Allocation Principles Maochao Xu Department of Mathematics Illinois State University mxu2@ilstu.edu Capital Dhaene, et al., 2011, Journal of Risk and Insurance The level of the capital held by

More information

4.2 Rolle's Theorem and Mean Value Theorem

4.2 Rolle's Theorem and Mean Value Theorem 4.2 Rolle's Theorem and Mean Value Theorem Rolle's Theorem: Let f be continuous on the closed interval [a,b] and differentiable on the open interval (a,b). If f (a) = f (b), then there is at least one

More information

Modeling Portfolios that Contain Risky Assets Risk and Reward III: Basic Markowitz Portfolio Theory

Modeling Portfolios that Contain Risky Assets Risk and Reward III: Basic Markowitz Portfolio Theory Modeling Portfolios that Contain Risky Assets Risk and Reward III: Basic Markowitz Portfolio Theory C. David Levermore University of Maryland, College Park Math 420: Mathematical Modeling January 30, 2013

More information

Modular and Distributive Lattices

Modular and Distributive Lattices CHAPTER 4 Modular and Distributive Lattices Background R. P. DILWORTH Imbedding problems and the gluing construction. One of the most powerful tools in the study of modular lattices is the notion of the

More information

Modeling Portfolios that Contain Risky Assets Risk and Reward III: Basic Markowitz Portfolio Theory

Modeling Portfolios that Contain Risky Assets Risk and Reward III: Basic Markowitz Portfolio Theory Modeling Portfolios that Contain Risky Assets Risk and Reward III: Basic Markowitz Portfolio Theory C. David Levermore University of Maryland, College Park Math 420: Mathematical Modeling March 26, 2014

More information

Lecture 6. 1 Polynomial-time algorithms for the global min-cut problem

Lecture 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 information