Lie Algebras and Representation Theory Homework 7

Size: px
Start display at page:

Download "Lie Algebras and Representation Theory Homework 7"

Transcription

1 Lie Algebras and Representation Theory Homework 7 Debbie Matthews

2 Problem 10.5 If σ W can be written as a product of t simple reflections, prove that t has the same parity as l(σ). Let = {α 1, α 2,..., α l } be a base for some root system Φ. We write s i = σ αi W. Recall that each simple reflection s i permutes the positive roots except for α i. (Lemma B) This means we can consider each simple reflection as a signed permutation of the simple roots, where s i sends α i to it s negative and permutes all other simple roots without changing their sign. Now suppose σ = s a1 s a2 s at = s b1 s b2 s bp. Then s bp 1 s b2 s b1 s a1 s a2 s at = s bp. On the right side, we have only one negative object in the associated signed permutation. So that must also be the case on the left side. Then t + p 1 is odd by the above realization. Therefore, t + p is even. Hence any expression of σ as a product of simple reflections will have the same parity. In particular, that parity agrees with the length. 1

3 Problem 10.6 Define a function sn : W {±1} by sn(σ) = ( 1) l(σ). Prove that sn is a homomorphism. Given the previous problem, this is straightforward. For two elements σ, γ W, we know sn(σ)sn(γ) = ( 1) l(σ)+l(γ). At the same time, since σ can be written as a product of l(σ) simple reflections and γ can be written as a product of l(gamma) simple reflections, then we know σγ can be written as a product of l(σ) + l(γ) simple reflections. By the previous problem, l(σγ) will have the same parity as l(σ) + l(γ). Therefore, ( 1) (l(σ)+l(γ) = ( 1) l(σγ) = sn(σγ). Hence, sn(σ)sn(γ) = sn(σγ) and sn is a group homomorphism. 2

4 Problem 10.7 Prove that the intersection of positive open half-spaces associated with any basis γ 1,..., γ l of E is nonvoid. Let γ 1,..., γ t be a basis for E. Let δ i be the projection of γ i onto the orthogonal complement of the span of all basis vectors except γ i. Denote the span of all basis vectors except γ i by E i = span{γ 1,..., γ i,..., γ t }. Hence δ i E i. Consider γ = r i δ i for r i > 0. For each k, we have (γ k, γ) = (γ k, r i δ i ). But for i k we know (γ k, δ i ) = 0 since γ k E i and δ i E i. Thus (γ k, γ) = r k γ k > 0 and so the intersection fo the open half-spaces associated to the basis {γ 1,..., γ t } is nonempty. 3

5 Problem 10.8 Let be a base of Φ, α β simple roots, Φ αβ the rank 2 root system in E αβ = Rα + Rβ. The Weyl group W αβ of Φ αβ is generated by the restrictions τ α, τ β to E αβ of σ α, σ β, and W αβ may be viewed as a subgroup of W. Prove that the length of an element of W αβ (relative to τ α, τ β ) coincides with the length of the corresponding element in W. Since we can view W αβ as a subgroup of W is cleat the length of some σ in W αβ is greater than or equal to its length in W since any product of simple reflections that can be written in W αβ can also be written in W. So we need to prove that the additional element in W do not allow a further reduction of σ beyond what can be achieved in W αβ. Denote α = α 1 and β = α 2. Let α 3, α 4,..., α l be the remaining simple roots in. Let s i denote the simple reflection associated with α i. Let t 1 = τ α and t 2 = τ β. Suppose σ W αβ such that σ = s a1 s ap = s b1 s bq where p is minimal in W αβ and q is minimal in W. That is, 1 a i 2 and 1 b i l. From a corollary, we know that since s a1 s ap and s b1 s bq are reduced expressions that σ(α ap ), σ(α bq ) Φ. However, σ can be generated by s 1 and s 2. Furthermore, each s i permutes the positive simple roots except α i. Finally, since the restrictions t 1 and t 2 permute roots in E αβ Φ, we know that an arbitrary product composed of s 1 and s 2 must permute the positve roots outside of E αβ. Therefore, b q is 1 or 2. But then, we can consider s a1 s ap s bq W αβ. Since s b1 s bq 1 must be a reduced expression in W, we conclude similarly that b q 1 is 1 or 2. We can continue and ultimately conclude, each b i is 1 or 2 and therefore, the lengths must agree. 4

6 Problem 10.9 Prove that there is a unique element σ in W sending Φ + to Φ (relative to ). Prove that any reduced expression for σ must involve all σ α (α ). Discuss l(σ). First we deal with uniqueness. Suppose σ, γ W map Φ + Φ. Then σγ maps Φ + Φ + and in particular it sends the base to itself. By Theroem 10.3 part (e), this implies σγ = id and so γ = σ 1. But the same holds for σσ and γγ. Hence, σ = γ. Let σ = s a1 s ap be a reduced expression. Then since σ(α i ) is negative for each i, we have from Lemma C that σs i = s a1 ŝ ak s ap. Hence σ = s a1 ŝ ak s ap s i is another reduced expression for σ. We know the Weyl group is a coxeter group and σ will be the longest element. 5

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

Notes on the symmetric group

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

Two-lit trees for lit-only sigma-game

Two-lit trees for lit-only sigma-game Two-lit trees for lit-only sigma-game Hau-wen Huang July 24, 2018 arxiv:1010.5846v3 [math.co] 14 Aug 2012 Abstract A configuration of the lit-only σ-game on a finite graph Γ is an assignment of one of

More information

Abstract Algebra Solution of Assignment-1

Abstract Algebra Solution of Assignment-1 Abstract Algebra Solution of Assignment-1 P. Kalika & Kri. Munesh [ M.Sc. Tech Mathematics ] 1. Illustrate Cayley s Theorem by calculating the left regular representation for the group V 4 = {e, a, b,

More information

Algebra homework 8 Homomorphisms, isomorphisms

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

κ-bounded Exponential-Logarithmic Power Series Fields

κ-bounded Exponential-Logarithmic Power Series Fields κ-bounded Exponential-Logarithmic Power Series Fields Salma Kuhlmann and Saharon Shelah 17. 06. 2004 Abstract In [K K S] it was shown that fields of generalized power series cannot admit an exponential

More information

maps 1 to 5. Similarly, we compute (1 2)(4 7 8)(2 1)( ) = (1 5 8)(2 4 7).

maps 1 to 5. Similarly, we compute (1 2)(4 7 8)(2 1)( ) = (1 5 8)(2 4 7). Math 430 Dr. Songhao Li Spring 2016 HOMEWORK 3 SOLUTIONS Due 2/15/16 Part II Section 9 Exercises 4. Find the orbits of σ : Z Z defined by σ(n) = n + 1. Solution: We show that the only orbit is Z. Let i,

More information

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the

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

Laurence Boxer and Ismet KARACA

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

A Learning Theory of Ranking Aggregation

A Learning Theory of Ranking Aggregation A Learning Theory of Ranking Aggregation France/Japan Machine Learning Workshop Anna Korba, Stephan Clémençon, Eric Sibony November 14, 2017 Télécom ParisTech Outline 1. The Ranking Aggregation Problem

More information

MATH 5510 Mathematical Models of Financial Derivatives. Topic 1 Risk neutral pricing principles under single-period securities models

MATH 5510 Mathematical Models of Financial Derivatives. Topic 1 Risk neutral pricing principles under single-period securities models MATH 5510 Mathematical Models of Financial Derivatives Topic 1 Risk neutral pricing principles under single-period securities models 1.1 Law of one price and Arrow securities 1.2 No-arbitrage theory and

More information

3.2 No-arbitrage theory and risk neutral probability measure

3.2 No-arbitrage theory and risk neutral probability measure Mathematical Models in Economics and Finance Topic 3 Fundamental theorem of asset pricing 3.1 Law of one price and Arrow securities 3.2 No-arbitrage theory and risk neutral probability measure 3.3 Valuation

More information

Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF

Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Will Johnson February 18, 2014 1 Introduction Let T be some C-minimal expansion of ACVF. Let U be the monster

More information

COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS

COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence

More information

Introduction to Greedy Algorithms: Huffman Codes

Introduction to Greedy Algorithms: Huffman Codes Introduction to Greedy Algorithms: Huffman Codes Yufei Tao ITEE University of Queensland In computer science, one interesting method to design algorithms is to go greedy, namely, keep doing the thing that

More information

A Translation of Intersection and Union Types

A Translation of Intersection and Union Types A Translation of Intersection and Union Types for the λ µ-calculus Kentaro Kikuchi RIEC, Tohoku University kentaro@nue.riec.tohoku.ac.jp Takafumi Sakurai Department of Mathematics and Informatics, Chiba

More information

Algebra and Number Theory Exercise Set

Algebra and Number Theory Exercise Set Algebra and Number Theory Exercise Set Kamil Niedzia lomski 1 Algebra 1.1 Complex Numbers Exercise 1. Find real and imaginary part of complex numbers (1) 1 i 2+i (2) (3 + 7i)( 3 + i) (3) ( 3+i)( 1+i 3)

More information

Gödel algebras free over finite distributive lattices

Gödel algebras free over finite distributive lattices TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria

More information

Quadrant marked mesh patterns in 123-avoiding permutations

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

THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES

THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES FU LIU AND BRIAN OSSERMAN Abstract. We study pure-cycle Hurwitz spaces, parametrizing covers of the projective line having only one ramified point

More information

Chapter 7 One-Dimensional Search Methods

Chapter 7 One-Dimensional Search Methods Chapter 7 One-Dimensional Search Methods An Introduction to Optimization Spring, 2014 1 Wei-Ta Chu Golden Section Search! Determine the minimizer of a function over a closed interval, say. The only assumption

More information

A Property Equivalent to n-permutability for Infinite Groups

A Property Equivalent to n-permutability for Infinite Groups Journal of Algebra 221, 570 578 (1999) Article ID jabr.1999.7996, available online at http://www.idealibrary.com on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar

More information

An effective perfect-set theorem

An effective perfect-set theorem An effective perfect-set theorem David Belanger, joint with Keng Meng (Selwyn) Ng CTFM 2016 at Waseda University, Tokyo Institute for Mathematical Sciences National University of Singapore The perfect

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

last problem outlines how the Black Scholes PDE (and its derivation) may be modified to account for the payment of stock dividends.

last problem outlines how the Black Scholes PDE (and its derivation) may be modified to account for the payment of stock dividends. 224 10 Arbitrage and SDEs last problem outlines how the Black Scholes PDE (and its derivation) may be modified to account for the payment of stock dividends. 10.1 (Calculation of Delta First and Finest

More 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

Game Theory for Wireless Engineers Chapter 3, 4

Game Theory for Wireless Engineers Chapter 3, 4 Game Theory for Wireless Engineers Chapter 3, 4 Zhongliang Liang ECE@Mcmaster Univ October 8, 2009 Outline Chapter 3 - Strategic Form Games - 3.1 Definition of A Strategic Form Game - 3.2 Dominated Strategies

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

3 The Model Existence Theorem

3 The Model Existence Theorem 3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe

More information

The finite lattice representation problem and intervals in subgroup lattices of finite groups

The finite lattice representation problem and intervals in subgroup lattices of finite groups The finite lattice representation problem and intervals in subgroup lattices of finite groups William DeMeo Math 613: Group Theory 15 December 2009 Abstract A well-known result of universal algebra states:

More information

Congruence lattices of finite intransitive group acts

Congruence lattices of finite intransitive group acts Congruence lattices of finite intransitive group acts Steve Seif June 18, 2010 Finite group acts A finite group act is a unary algebra X = X, G, where G is closed under composition, and G consists of permutations

More information

Another Variant of 3sat. 3sat. 3sat Is NP-Complete. The Proof (concluded)

Another Variant of 3sat. 3sat. 3sat Is NP-Complete. The Proof (concluded) 3sat k-sat, where k Z +, is the special case of sat. The formula is in CNF and all clauses have exactly k literals (repetition of literals is allowed). For example, (x 1 x 2 x 3 ) (x 1 x 1 x 2 ) (x 1 x

More information

More Advanced Single Machine Models. University at Buffalo IE661 Scheduling Theory 1

More Advanced Single Machine Models. University at Buffalo IE661 Scheduling Theory 1 More Advanced Single Machine Models University at Buffalo IE661 Scheduling Theory 1 Total Earliness And Tardiness Non-regular performance measures Ej + Tj Early jobs (Set j 1 ) and Late jobs (Set j 2 )

More information

Financial Economics. Runs Test

Financial Economics. Runs Test Test A simple statistical test of the random-walk theory is a runs test. For daily data, a run is defined as a sequence of days in which the stock price changes in the same direction. For example, consider

More information

Economics 101. Lecture 3 - Consumer Demand

Economics 101. Lecture 3 - Consumer Demand Economics 101 Lecture 3 - Consumer Demand 1 Intro First, a note on wealth and endowment. Varian generally uses wealth (m) instead of endowment. Ultimately, these two are equivalent. Given prices p, if

More information

ORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis

ORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis ORDERED SEMIGROUPS HAVING THE P -PROPERTY Niovi Kehayopulu, Michael Tsingelis ABSTRACT. The main results of the paper are the following: The ordered semigroups which have the P -property are decomposable

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

arxiv: v1 [math.lo] 24 Feb 2014

arxiv: v1 [math.lo] 24 Feb 2014 Residuated Basic Logic II. Interpolation, Decidability and Embedding Minghui Ma 1 and Zhe Lin 2 arxiv:1404.7401v1 [math.lo] 24 Feb 2014 1 Institute for Logic and Intelligence, Southwest University, Beibei

More information

A1: American Options in the Binomial Model

A1: American Options in the Binomial Model Appendix 1 A1: American Options in the Binomial Model So far we were dealing with options which can be excercised only at a fixed time, at their maturity date T. These are european options. In a complete

More information

TWO-PERIODIC TERNARY RECURRENCES AND THEIR BINET-FORMULA 1. INTRODUCTION

TWO-PERIODIC TERNARY RECURRENCES AND THEIR BINET-FORMULA 1. INTRODUCTION TWO-PERIODIC TERNARY RECURRENCES AND THEIR BINET-FORMULA M. ALP, N. IRMAK and L. SZALAY Abstract. The properties of k-periodic binary recurrences have been discussed by several authors. In this paper,

More information

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017 Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.

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

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

Laurence Boxer and Ismet KARACA

Laurence Boxer and Ismet KARACA THE CLASSIFICATION OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.

More information

RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS

RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS PETER JIPSEN, ALEXANDER PINUS, HENRY ROSE Abstract. The Rudin-Keisler ordering of ultrafilters is extended to complete Boolean algebras and characterised

More information

Levin Reduction and Parsimonious Reductions

Levin Reduction and Parsimonious Reductions Levin Reduction and Parsimonious Reductions The reduction R in Cook s theorem (p. 266) is such that Each satisfying truth assignment for circuit R(x) corresponds to an accepting computation path for M(x).

More information

ABSTRACT GENERALIZING THE FUTURAMA THEOREM. The 2010 episode of Futurama titled The Prisoner of Benda centers

ABSTRACT GENERALIZING THE FUTURAMA THEOREM. The 2010 episode of Futurama titled The Prisoner of Benda centers ABSTRACT GENERALIZING THE FUTURAMA THEOREM The 2010 episode of Futurama titled The Prisoner of Benda centers around a machine that swaps the brains of any two people who use it. The problem is, once two

More information

. COVERS OF D-TYPE ARTIN GROUPS. 1. Introduction

. COVERS OF D-TYPE ARTIN GROUPS. 1. Introduction . COVERS OF D-TYPE ARTIN GROUPS MEIRAV AMRAM 1, ROBERT SHWARTZ 1 AND MINA TEICHER Abstract. We stdy certain qotients of Generalized Artin grops which hae natral map onto D-type Artin grops. In particlar

More information

The (λ, κ)-fn and the order theory of bases in boolean algebras

The (λ, κ)-fn and the order theory of bases in boolean algebras The (λ, κ)-fn and the order theory of bases in boolean algebras David Milovich Texas A&M International University david.milovich@tamiu.edu http://www.tamiu.edu/ dmilovich/ June 2, 2010 BLAST 1 / 22 The

More information

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017 Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.

More information

Silver type theorems for collapses.

Silver type theorems for collapses. Silver type theorems for collapses. Moti Gitik May 19, 2014 The classical theorem of Silver states that GCH cannot break for the first time over a singular cardinal of uncountable cofinality. On the other

More information

Chapter 4. Cardinal Arithmetic.

Chapter 4. Cardinal Arithmetic. Chapter 4. Cardinal Arithmetic. 4.1. Basic notions about cardinals. We are used to comparing the size of sets by seeing if there is an injection from one to the other, or a bijection between the two. Definition.

More information

A Decentralized Learning Equilibrium

A Decentralized Learning Equilibrium Paper to be presented at the DRUID Society Conference 2014, CBS, Copenhagen, June 16-18 A Decentralized Learning Equilibrium Andreas Blume University of Arizona Economics ablume@email.arizona.edu April

More information

arxiv:math/ v1 [math.lo] 15 Jan 1991

arxiv:math/ v1 [math.lo] 15 Jan 1991 ON A CONJECTURE OF TARSKI ON PRODUCTS OF CARDINALS arxiv:math/9201247v1 [mathlo] 15 Jan 1991 Thomas Jech 1 and Saharon Shelah 2 Abstract 3 We look at an old conjecture of A Tarski on cardinal arithmetic

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

Palindromic Permutations and Generalized Smarandache Palindromic Permutations

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

Research Article On Open-Open Games of Uncountable Length

Research Article On Open-Open Games of Uncountable Length International Mathematics and Mathematical Sciences Volume 2012, Article ID 208693, 11 pages doi:10.1155/2012/208693 Research Article On Open-Open Games of Uncountable Length Andrzej Kucharski Institute

More information

Lecture 7: Bayesian approach to MAB - Gittins index

Lecture 7: Bayesian approach to MAB - Gittins index Advanced Topics in Machine Learning and Algorithmic Game Theory Lecture 7: Bayesian approach to MAB - Gittins index Lecturer: Yishay Mansour Scribe: Mariano Schain 7.1 Introduction In the Bayesian approach

More information

MAT25 LECTURE 10 NOTES. = a b. > 0, there exists N N such that if n N, then a n a < ɛ

MAT25 LECTURE 10 NOTES. = a b. > 0, there exists N N such that if n N, then a n a < ɛ MAT5 LECTURE 0 NOTES NATHANIEL GALLUP. Algebraic Limit Theorem Theorem : Algebraic Limit Theorem (Abbott Theorem.3.3) Let (a n ) and ( ) be sequences of real numbers such that lim n a n = a and lim n =

More information

INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION

INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION Department of Mathematics, University of Hawaii, Honolulu, HI 96822, USA Phone:(808)956-4655 Abstract. We introduce a

More information

Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals

Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals Philipp Moritz Lücke (joint work with Philipp Schlicht) Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität

More information

Supplemental Materials for What is the Optimal Trading Frequency in Financial Markets? Not for Publication. October 21, 2016

Supplemental Materials for What is the Optimal Trading Frequency in Financial Markets? Not for Publication. October 21, 2016 Supplemental Materials for What is the Optimal Trading Frequency in Financial Markets? Not for Publication Songzi Du Haoxiang Zhu October, 06 A Model with Multiple Dividend Payment In the model of Du and

More information

Finite Memory and Imperfect Monitoring

Finite Memory and Imperfect Monitoring Federal Reserve Bank of Minneapolis Research Department Finite Memory and Imperfect Monitoring Harold L. Cole and Narayana Kocherlakota Working Paper 604 September 2000 Cole: U.C.L.A. and Federal Reserve

More information

More On λ κ closed sets in generalized topological spaces

More On λ κ closed sets in generalized topological spaces Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir More On λ κ closed sets in generalized topological spaces R. Jamunarani, 1, P. Jeyanthi 2 and M. Velrajan 3 1,2 Research Center,

More information

Notes on Natural Logic

Notes on Natural Logic Notes on Natural Logic Notes for PHIL370 Eric Pacuit November 16, 2012 1 Preliminaries: Trees A tree is a structure T = (T, E), where T is a nonempty set whose elements are called nodes and E is a relation

More information

Practice Problems 1: Moral Hazard

Practice Problems 1: Moral Hazard Practice Problems 1: Moral Hazard December 5, 2012 Question 1 (Comparative Performance Evaluation) Consider the same normal linear model as in Question 1 of Homework 1. This time the principal employs

More information

Brownian Motion and Ito s Lemma

Brownian Motion and Ito s Lemma Brownian Motion and Ito s Lemma 1 The Sharpe Ratio 2 The Risk-Neutral Process Brownian Motion and Ito s Lemma 1 The Sharpe Ratio 2 The Risk-Neutral Process The Sharpe Ratio Consider a portfolio of assets

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

Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies

Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies George Tauchen Duke University Viktor Todorov Northwestern University 2013 Motivation

More information

On the Number of Permutations Avoiding a Given Pattern

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

CS792 Notes Henkin Models, Soundness and Completeness

CS792 Notes Henkin Models, Soundness and Completeness CS792 Notes Henkin Models, Soundness and Completeness Arranged by Alexandra Stefan March 24, 2005 These notes are a summary of chapters 4.5.1-4.5.5 from [1]. 1 Review indexed family of sets: A s, where

More information

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2015

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2015 Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2015 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.

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

Another Variant of 3sat

Another Variant of 3sat Another Variant of 3sat Proposition 32 3sat is NP-complete for expressions in which each variable is restricted to appear at most three times, and each literal at most twice. (3sat here requires only that

More information

CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n

CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n Chebyshev Sets A subset S of a metric space X is said to be a Chebyshev set if, for every x 2 X; there is a unique point in S that is closest to x: Put

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

MAFS Computational Methods for Pricing Structured Products

MAFS Computational Methods for Pricing Structured Products MAFS550 - Computational Methods for Pricing Structured Products Solution to Homework Two Course instructor: Prof YK Kwok 1 Expand f(x 0 ) and f(x 0 x) at x 0 into Taylor series, where f(x 0 ) = f(x 0 )

More information

Covering properties of derived models

Covering properties of derived models University of California, Irvine June 16, 2015 Outline Background Inaccessible limits of Woodin cardinals Weakly compact limits of Woodin cardinals Let L denote Gödel s constructible universe. Weak covering

More information

Black-Scholes Model. Chapter Black-Scholes Model

Black-Scholes Model. Chapter Black-Scholes Model Chapter 4 Black-Scholes Model In this chapter we consider a simple continuous (in both time and space financial market model called the Black-Scholes model. This can be viewed as a continuous analogue

More information

Portfolio Choice. := δi j, the basis is orthonormal. Expressed in terms of the natural basis, x = j. x j x j,

Portfolio Choice. := δi j, the basis is orthonormal. Expressed in terms of the natural basis, x = j. x j x j, Portfolio Choice Let us model portfolio choice formally in Euclidean space. There are n assets, and the portfolio space X = R n. A vector x X is a portfolio. Even though we like to see a vector as coordinate-free,

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

κ-bounded Exponential-Logarithmic Power Series Fields

κ-bounded Exponential-Logarithmic Power Series Fields 1 arxiv:math/0512220v1 [math.lo] 10 Dec 2005 κ-bounded Exponential-Logarithmic Power Series Fields Salma Kuhlmann and Saharon Shelah 17. 04. 2005 Abstract In [K K S] it was shown that fields of generalized

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

On Toponogov s Theorem

On Toponogov s Theorem On Toponogov s Theorem Viktor Schroeder 1 Trigonometry of constant curvature spaces Let κ R be given. Let M κ be the twodimensional simply connected standard space of constant curvature κ. Thus M κ is

More information

Option Pricing. 1 Introduction. Mrinal K. Ghosh

Option Pricing. 1 Introduction. Mrinal K. Ghosh Option Pricing Mrinal K. Ghosh 1 Introduction We first introduce the basic terminology in option pricing. Option: An option is the right, but not the obligation to buy (or sell) an asset under specified

More information

1. Introduction. As part of his study of functions defined on product spaces, M. Hušek introduced a family of diagonal conditions in a topological

1. Introduction. As part of his study of functions defined on product spaces, M. Hušek introduced a family of diagonal conditions in a topological Diagonal Conditions in Ordered Spaces by Harold R Bennett, Texas Tech University, Lubbock, TX and David J. Lutzer, College of William and Mary, Williamsburg, VA Dedicated to the Memory of Maarten Maurice

More information

Comparing Partial Rankings

Comparing Partial Rankings Comparing Partial Rankings Ronald Fagin Ravi Kumar Mohammad Mahdian D. Sivakumar Erik Vee To appear: SIAM J. Discrete Mathematics Abstract We provide a comprehensive picture of how to compare partial rankings,

More information

AN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS

AN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS AN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS K. ALAN LOPER, ZACHARY MESYAN, AND GREG OMAN Abstract. We define and study two generalizations of the Krull dimension for rings, which can assume cardinal

More information

Pakes (1986): Patents as Options: Some Estimates of the Value of Holding European Patent Stocks

Pakes (1986): Patents as Options: Some Estimates of the Value of Holding European Patent Stocks Pakes (1986): Patents as Options: Some Estimates of the Value of Holding European Patent Stocks Spring 2009 Main question: How much are patents worth? Answering this question is important, because it helps

More information

Discrete Applied Mathematics

Discrete Applied Mathematics Discrete Applied Mathematics 157 (2009) 3055 3068 Contents lists availle at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The unambiguity of segmented morphisms

More information

On generalized resolvents of symmetric operators of defect one with finitely many negative squares

On generalized resolvents of symmetric operators of defect one with finitely many negative squares 21 On generalized resolvents of symmetric operators of defect one with finitely many negative squares Jussi Behrndt and Carsten Trunk Abstract Behrndt, Jussi and Carsten Trunk (2005). On generalized resolvents

More information

INTRODUCTION TO ARBITRAGE PRICING OF FINANCIAL DERIVATIVES

INTRODUCTION TO ARBITRAGE PRICING OF FINANCIAL DERIVATIVES INTRODUCTION TO ARBITRAGE PRICING OF FINANCIAL DERIVATIVES Marek Rutkowski Faculty of Mathematics and Information Science Warsaw University of Technology 00-661 Warszawa, Poland 1 Call and Put Spot Options

More information

The Correlation Smile Recovery

The Correlation Smile Recovery Fortis Bank Equity & Credit Derivatives Quantitative Research The Correlation Smile Recovery E. Vandenbrande, A. Vandendorpe, Y. Nesterov, P. Van Dooren draft version : March 2, 2009 1 Introduction Pricing

More information

IEOR E4602: Quantitative Risk Management

IEOR E4602: Quantitative Risk Management IEOR E4602: Quantitative Risk Management Basic Concepts and Techniques of Risk Management Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com

More information

1 Games in Strategic Form

1 Games in Strategic Form 1 Games in Strategic Form A game in strategic form or normal form is a triple Γ (N,{S i } i N,{u i } i N ) in which N = {1,2,...,n} is a finite set of players, S i is the set of strategies of player i,

More information

1 Directed sets and nets

1 Directed sets and nets subnets2.tex April 22, 2009 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/topo/ This text contains notes for my talk given at our topology seminar. It compares 3 different definitions of subnets.

More information

s: and

s: and GENERATION OF ISOMETRIES OF CERTAIN Z-LATTICES BY SYMMETRIES Myung-Hwan Kim 1 and Byeong-Kweon Oh 2 1 Dept. of Math., Seoul Nat l Univ., Seoul 151-742, Korea 2 Dept. of Math., KIAS, Seoul 130-012, Korea

More information

MODIFIED EXTENDER BASED FORCING

MODIFIED EXTENDER BASED FORCING MODIFIED EXTENDER BASED FORCING DIMA SINAPOVA AND SPENCER UNGER Abstract. We analyze the modified extender based forcing from Assaf Sharon s PhD thesis. We show there is a bad scale in the extension and

More information

Measuring Interest Rates

Measuring Interest Rates Measuring Interest Rates Economics 301: Money and Banking 1 1.1 Goals Goals and Learning Outcomes Goals: Learn to compute present values, rates of return, rates of return. Learning Outcomes: LO3: Predict

More information