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

Size: px
Start display at page:

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

Transcription

1 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 into archimedean semigroups. Moreover, the ordered semigroups which have the P -property are decomposable into semigroups having the P -property. Conversely, if an ordered semigroup S is a complete semilattice of semigroups which have the P -property, then S itself has the P - property as well. An ordered semigroup is CS-indecomposable and has the P -property if and only if it is archimedean. If S is an ordered semigroup, then the relation N := {(a, b) N(a) = N(b)} (where N(a) is the filter of S generated by a (a S)) is the least complete semilattice congruence on S and the class (a) N is CS-indecomposable subsemigroup of S for every a S. The concept of the P m -property is introduced and a characterization of the P m -property in terms of the P -property is given. Our methodology simplifies the proofs of the corresponding results of semigroups (without order). 1. INTRODUCTION-PREREQUISITES If S be a semigroup and a, b S, we say that a divides b, if b I(a) (where I(a) is the principal ideal of S generated by a (a S)). A semigroup S is said to be archimedean if for every pair (a, b) of elements in S each one divides a power of the other [2]. Chrislock proved that if S is medial, that is, it satisfies the identity xyzu = xzyu, then S is a semilattice of archimedean semigroups Mathematics Subject Classification. 06F05. Key words and phrases. Archimedean ordered semigroup, P -property, complete semilattice of semigroups of type T, ideal, filter, CS-indecomposable ordered semigroup, P m -property. 1

2 The following question was natural: What is the biggest class of semigroups in which S is a semilattice of archimedean semigroups? A complete solution to that problem has been given by Putcha in [12]. A congruence ρ on a semigroup S is called semilattice congruence (S-congruence) if S/ρ is a semilattice. A semigroup S is called S-indecomposable if S cannot be homomorphic onto a semilattice L except the trivial one, L = 1. Tamura defines the P -property (power-property) of S as follows: If a, b S, b I(a), then there exists a natural number k such that b k I(a). One can find the following results by Tamura in [13]: (1) A semigroup S is a semilattice of archimedean semigroups if and only if S has the P -property. (2) If S is a semigroup, then there exists a smallest semilattice congruence ρ 0 on S and each ρ 0 -class is S-indecomposable. (3) A semigroup S has the P -property if and only if it is a semilattice of semigroups having the P - property. (4) A semigroup S is S-indecomposable and has the P -property if and only if it is archimedean. He gives a direct proof of the main part, the if part of (4) without using the general argument like the one mentioned in (2) as it was treated in the commutative or medial case. Furthermore, for a natural number m, the P m -property has been introduced and its characterization in terms of the P -property is given in [13]. In the present paper we extend the results on semigroups mentioned above for ordered semigroups. Our methodology gives more simplified proofs of the corresponding results on semigroups (without order) which can be also obtained as an easy modification of the results on ordered semigroups given in this paper. Let S be an ordered semigroup. For a subset H if S, we denote by (H] the subset of S defined by (H] := {t S t h for some h H}. A nonempty subset A of S is called a left (resp. right) ideal of S if (1) SA A (resp. AS A) and (2) If a A and S b a, then b A. A is called an ideal of S if it is both a left and a right ideal of S [4]. If T is a subsemigroup of S, we denote by I T (a) the ideal of T generated by a, i.e. the least (with respect to the inclusion relation) ideal of T containing a. For T = S, we write I(a) instead of I S (a). For each a S, we have I(a) = (a Sa as SaS], L(a) = (a Sa] R(a) = (a as] [4]. A subsemigroup F of S is called a filter of S [3] if (1) a, b S 2

3 and ab F imply a F and b F and (2) a F and F c a imply c F. We denote by N(x) the filter of S generated by x (x S), and by N the relation on S defined by: N := {(x, y) S S N(x) = N(y)} [5]. An equivalence relation σ on an ordered semigroup (S,., ) is called a left (resp. right) congruence on S if (x, y) σ implies (zx, zy) σ (resp. (xz, yz) σ) for every z S. If σ is both left and a right congruence on S, then it is called a congruence on S. A semilattice congruence is a congruence σ on S such that (x 2, x) σ and (xy, yx) σ for all x, y S [5]. A semilattice congruence σ on S is called complete if x y implies (x, xy) σ [7]. A complete semilattice congruence σ on an ordered semigroup (S,., ) can be equivalently defined as an equivalence relation σ on S having the following properties: (1) (x, y) σ (xz, yz) σ z S (2) (xy, yx) σ x, y S (3) x y (x, xy) σ [10]. If σ is a semilattice congruence on S then, for each x S, the class (x) σ is a subsemigroup of S. The ordered semigroup S is called a complete semilattice of semigroups of a given type, say T, if there exists a semilattice congruence σ on S such that the class (x) σ is a subsemigroup of S of type T for every x S. Equivalent Definition: There exists a complete semilattice Y and a family {S α α Y } of archimedean subsemigroups of S such that: (1) S α S β = for every α, β Y, α β (2) S = S α α Υ (3) S α S β S αβ for every α, β Y. (4) S β (S α ] implies β α, where is the order of the semilattice Y defined by := {(α, β) α = αβ (= βα)} [9]. For convenience, we use the notation S 1 := S {1}, where 1 / S, 1a := a, a1 := a for each a S, 1.1:=1. We denote by N := {1, 2,... } the set of natural numbers. 2. MAIN RESULTS An ordered semigroup S is said to be archimedean if for each a, b S there exists k N such that b k (SaS] [6,8]. 3

4 Proposition 1. An ordered semigroup S is archimedean if and only if for every a, b S there exists k N such that b k I(a). Proof. =. Let a, b S. Then, there exists k N such that b k (SaS] I(a). =. Let a, b S. By hypothesis,there exist a, b S and k N such that b k I(a). Then b k zat for some z, t S 1. Then b k+2 b(zat)b = (bz)a(tb). Since b S, z S 1, we have bz S. Since t S 1, b S, we have tb S. Since (bz)a(tb) SaS, we have b k+2 (SaS]. Definition 2. Let S be an ordered semigroup. We say that S has the P-property if the following assertion is satisfied: a, b S, b I(a) = b k I(a 2 ) for some k N. Remark 3. We have a k I(b) for some k N if and only if there exists m N such that a m (SbS]. Thus the P -property can be equivalently defined as follows: a, b S, b I(a) = b k (Sa 2 S] for some k N. Remark 4. If S is an archimedean ordered semigroup, then for each a, b S there exists k N such that b k I(a 2 ). By Remark 4, we have the following: Corollary 5. Each archimedean ordered semigroup has the P -property. Lemma 6. [10; Theorem 2.8] An ordered semigroup has the P -property if and only if it is a complete semilattice of archimedean semigroups. Theorem 7. An ordered semigroup S has the P -property if and only if it is a complete semilattice of semigroups which have the P -property. Proof. =. Since S has the P -property, by Lemma 6, it is a complete semilattice of archimedean semigroups. Then, by Corollary 5, S is a complete semilattice of semigroups having the P -property. =. Let σ be a complete semilattice congruence on S such that (x) σ has the P -property for every x S. Let a, b S, b I(a). Suppose x, y S 1 such that b xay. Then, since σ is complete, we have (b, bxay) σ, so (bxay, b) σ ( ) On the other hand, since b 2 xayb, we have b 8 = b 2 b 2 b 2 b 2 (xayb)(xayb)(xayb)(xayb) = (xaybx)(aybxa)(ybxayb) ( ) 4

5 Since σ is a semilattice congruence on S, we have (xaybx, aybx 2 ) σ. Since (x 2, x) σ, we have (aybx 2, aybx) σ. Then, since (aybx, bxay) σ, we have (xaybx, bxay) σ. Then, by ( ), (xaybx, b) σ, and xaybx (b) σ. In a similar way we get aybxa (b) σ and ybxayb (b) σ. Then, by ( ), we have b 8 I (b)σ (aybxa). Since b 8, aybxa (b) σ, b 8 I (b)σ (aybxa), and the subsemigroup (b) σ of S has the P -property, by Remark 3, there exists k N such that (b 8 ) k ((b) σ (aybxa) 2 (b) σ ]. Then (b 8 ) k z(aybxa) 2 w = z(aybxa)(aybxa)w = (zaybx)a 2 (ybxaw) for some z, w (b) 1 σ. Since a, b S and x, y, z, w S 1, we have zaybx S, ybxaw S. Then, for the element m := 8k N, we have b m I(a 2 ), thus S has the P -property. An ordered semigroup S is called CS-indecomposable if S S is the unique complete semilattice congruence on S (i.e. if σ is a complete semilattice congruence on S, then σ = S S) [11]. Proposition 8. If S is an ordered semigroup, then we have the following: (1) N is the least complete semilattice congruence on S. (2) The class (a) N is CS-indecomposable subsemigroup of S for every a S. For the proof of (1) we refer to [7] and for (2) to [11]. Remark 9. (a) By Proposition 8, each ordered semigroup is a complete semilattice of CS-indecomposable semigroups. (b) The only if part of Lemma 6 is a consequence of Theorem 7 as well. Theorem 10. An ordered semigroup is CS-indecomposable and has the P - property if and only if it is archimedean. Proof. =. Since S has the P -property, by Lemma 6, it is a complete semilattice of archimedean semigroups. Let σ be a complete semilattice congruence on S such that (x) σ is an archimedean subsemigroup of S for every x S. Let a S (S ). Since S is CS-indecomposable, we have σ = S S, then (a) σ = S, and 5

6 S is archimedean. =. Since S is archimedean, by Corollary 5, S has the P -property. Let now σ be a complete semilattice congruence on S. Then σ = S S. In fact: Let a, b S. Since S is archimedean, there exist k N such that b k xay for some x, y S. Since b N(b), we have b k N(b). Since S xay b k N(b), we have xay N(b), then a N(b), and N(a) N(b). By symmetry, we get N(b) N(a), thus N(a) = N(b), and (a, b) N. Clearly N S S, so N = S S. By Proposition 8(1), N is the least complete semilattice congruence on S, that is N σ. Then S S σ, besides σ S S, so σ = S S. Definition 11. Let S be an ordered semigroup and m N. S has the P m - property if the following assertion is satisfied: a, b S, b I(a) = b k I(a m ) for some k N. Equivalently, a, b S, b I(a) = b k (Sa m S] for some k N. Remark 12. The following are obvious: (a) Every ordered semigroup has the P 1 -property. (b) The P -property and the P 2 -property are the same. Lemma 13. [10; Proposition 2.4] If an ordered semigroup has the P -property, then it also has the P m -property for every m N. Theorem 14. Let S be an ordered semigroup having the P m -property for some m N, m 2. Then S has the P λ -property for every λ N. Proof. Let λ N and a, b S, b I(a). Then there exists k N such that b k I(a λ ). In fact: Since S has the P m -property, there exists ν N such that b ν I(a m ). The following assertion is satisfied: For each n N there exists k n N such that b k n I(a mn ). ( ) Indeed: For n = 1 and for the element k 1 := ν N, we have b k 1 = b ν I(a m ) = I(a m1 ). Suppose property ( ) is true for the element n N. That is, there exists k n N such that b kn I(a mn ). Then there exists k n+1 N such that b k n+1 I(a mn+1 ). Indeed: Since b k n, a mn S (k n, m, n N), b k n I(a mn ) and S has the P m -property, there exists l N such that b lk n = (b k n ) l I((a mn ) m ) = I(a mn+1 ), where k + 1 := lk n N. Thus condition ( ) is satisfied. 6

7 Let now n 0 N such that m n0 > λ (such an n 0 exists). By ( ), there exists k n0 N such that b k n 0 I(a m n 0 ). Since m n0 > λ, we have m n0 λ N, then a mn 0 = a mn 0 λ + λ = a mn0 λ a λ Sa λ I(a λ ). Hence we have b kn 0 I(a m n 0 ) I(a λ ), where k n0 N, and the proof is complete. By Lemma 13, Theorem 14 and Remark 12(b), we have the following: Corollary 15. Let S be an ordered semigroup. The following are equivalent: (1) S has the P -property. (2) S has the P m -property for each m N. (3) S has the P m -property for some m N, m 2. References [1] J. L. Chrislock, On medial semigroups, J. Algebra 12 (1969), 1 9. [2] A. H. Clifford, G. B. Preston, The Algebraic Theory of Semigroups, Amer. Math. Soc., Math. Surveys 7, Providence, Rhode Island, [3] N. Kehayopulu, On weakly commutative poe-semigroups, Semigroup Forum 34, No. 3 (1987), [4] N. Kehayopulu, On weakly prime ideals of ordered semigroups, Mathematica Japonica 35, No. 6 (1990), [5] N. Kehayopulu, Remark on ordered semigroups, Mathematica Japonica 35, No. 6 (1990), [6] N. Kehayopulu, P. Kiriakuli, S. Hanumantha Rao, P. Lakshmi, On weakly commutative poe-semigroups, Semigroup Forum 41, No. 3 (1990), [7] N. Kehayopulu, M. Tsingelis, Remark on ordered semigroups. In : E. S. Ljapin, (edit.), Decompositions and Homomorphic Mappings of Semigroups, Interuniversitary collection of scientific works, St. Petersburg: Obrazovanie (1992), (ISBN ). [8] N. Kehayopulu, M. Tsingelis, On weakly commutative ordered semigroups, Semigroup Forum 56, No. 1 (1998),

8 [9] N. Kehayopulu, M. Tsingelis, A remark on semilattice congruences in ordered semigroups. (Russian). Izv. Vyssh. Uchebn. Zaved. Mat. 2, 50 52; translation in Russian Math. (Iz. VUZ) 44, No. 2 (2000), [10] N. Kehayopulu, M. Tsingelis, Semilattices of archimedean ordered semigroups, Algebra Colloquium, 15, No. 3 (2008), [11] N. Kehayopulu, M. Tsingelis, CS-indecomposable ordered semigroups, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 343 (2007), [12] M. S. Putcha, Semilattice decompositions of semigroups, Semigroup Forum 6, No. 1 (1973), [13] T. Tamura, On Putcha s theorem concerning semilattice of archimedean semigroups, Semigroup Forum 4 (1972),

Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups

Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups International Journal of Algebra, Vol. 5, 2011, no. 31, 1533-1541 Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups Niovi Kehayopulu University of Athens Department of Mathematics

More information

Skew lattices of matrices in rings

Skew lattices of matrices in rings Algebra univers. 53 (2005) 471 479 0002-5240/05/040471 09 DOI 10.1007/s00012-005-1913-5 c Birkhäuser Verlag, Basel, 2005 Algebra Universalis Skew lattices of matrices in rings Karin Cvetko-Vah Abstract.

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

Fair semigroups. Valdis Laan. University of Tartu, Estonia. (Joint research with László Márki) 1/19

Fair semigroups. Valdis Laan. University of Tartu, Estonia. (Joint research with László Márki) 1/19 Fair semigroups Valdis Laan University of Tartu, Estonia (Joint research with László Márki) 1/19 A semigroup S is called factorisable if ( s S)( x, y S) s = xy. 2/19 A semigroup S is called factorisable

More information

Epimorphisms and Ideals of Distributive Nearlattices

Epimorphisms and Ideals of Distributive Nearlattices Annals of Pure and Applied Mathematics Vol. 18, No. 2, 2018,175-179 ISSN: 2279-087X (P), 2279-0888(online) Published on 9 November 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v18n2a5

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

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

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

CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION

CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION Bulletin of the Section of Logic Volume 42:1/2 (2013), pp. 1 10 M. Sambasiva Rao CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION Abstract Two types of congruences are introduced

More information

SEMICENTRAL IDEMPOTENTS IN A RING

SEMICENTRAL IDEMPOTENTS IN A RING J. Korean Math. Soc. 51 (2014), No. 3, pp. 463 472 http://dx.doi.org/10.4134/jkms.2014.51.3.463 SEMICENTRAL IDEMPOTENTS IN A RING Juncheol Han, Yang Lee, and Sangwon Park Abstract. Let R be a ring with

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

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

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

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

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

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

CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005,

CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005, Novi Sad J. Math. Vol. 35, No. 2, 2005, 155-160 CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS Mališa Žižović 1, Vera Lazarević 2 Abstract. To every finite lattice L, one can associate a binary blockcode,

More information

Fuzzy L-Quotient Ideals

Fuzzy L-Quotient Ideals International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Number 3 (2013), pp. 179-187 Research India Publications http://www.ripublication.com Fuzzy L-Quotient Ideals M. Mullai

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

The illustrated zoo of order-preserving functions

The illustrated zoo of order-preserving functions The illustrated zoo of order-preserving functions David Wilding, February 2013 http://dpw.me/mathematics/ Posets (partially ordered sets) underlie much of mathematics, but we often don t give them a second

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

Translates of (Anti) Fuzzy Submodules

Translates of (Anti) Fuzzy Submodules International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn : 2278-800X, www.ijerd.com Volume 5, Issue 2 (December 2012), PP. 27-31 P.K. Sharma Post Graduate Department of Mathematics,

More information

CARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS

CARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS CARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS KEITH A. KEARNES AND GREG OMAN Abstract. We determine the relationship between the cardinality of a Noetherian integral domain and the cardinality

More information

The Binomial Theorem and Consequences

The Binomial Theorem and Consequences The Binomial Theorem and Consequences Juris Steprāns York University November 17, 2011 Fermat s Theorem Pierre de Fermat claimed the following theorem in 1640, but the first published proof (by Leonhard

More 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

GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019

GUESSING 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 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

Some Remarks on Finitely Quasi-injective Modules

Some Remarks on Finitely Quasi-injective Modules EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 6, No. 2, 2013, 119-125 ISSN 1307-5543 www.ejpam.com Some Remarks on Finitely Quasi-injective Modules Zhu Zhanmin Department of Mathematics, Jiaxing

More information

LATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES

LATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 100 109 LATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES Zdenka Riečanová An effect algebraic partial binary operation defined on the underlying

More information

INTERVAL DISMANTLABLE LATTICES

INTERVAL DISMANTLABLE LATTICES INTERVAL DISMANTLABLE LATTICES KIRA ADARICHEVA, JENNIFER HYNDMAN, STEFFEN LEMPP, AND J. B. NATION Abstract. A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter,

More information

On axiomatisablity questions about monoid acts

On axiomatisablity questions about monoid acts University of York Universal Algebra and Lattice Theory, Szeged 25 June, 2012 Based on joint work with V. Gould and L. Shaheen Monoid acts Right acts A is a left S-act if there exists a map : S A A such

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

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

A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS. Burhaneddin İZGİ

A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS. Burhaneddin İZGİ A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS Burhaneddin İZGİ Department of Mathematics, Istanbul Technical University, Istanbul, Turkey

More information

Equivalence between Semimartingales and Itô Processes

Equivalence between Semimartingales and Itô Processes International Journal of Mathematical Analysis Vol. 9, 215, no. 16, 787-791 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ijma.215.411358 Equivalence between Semimartingales and Itô Processes

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

Equilibrium payoffs in finite games

Equilibrium payoffs in finite games Equilibrium payoffs in finite games Ehud Lehrer, Eilon Solan, Yannick Viossat To cite this version: Ehud Lehrer, Eilon Solan, Yannick Viossat. Equilibrium payoffs in finite games. Journal of Mathematical

More information

Best-Reply Sets. Jonathan Weinstein Washington University in St. Louis. This version: May 2015

Best-Reply Sets. Jonathan Weinstein Washington University in St. Louis. This version: May 2015 Best-Reply Sets Jonathan Weinstein Washington University in St. Louis This version: May 2015 Introduction The best-reply correspondence of a game the mapping from beliefs over one s opponents actions to

More information

Fractional Graphs. Figure 1

Fractional Graphs. Figure 1 Fractional Graphs Richard H. Hammack Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284-2014, USA rhammack@vcu.edu Abstract. Edge-colorings are used to

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

New tools of set-theoretic homological algebra and their applications to modules

New tools of set-theoretic homological algebra and their applications to modules New tools of set-theoretic homological algebra and their applications to modules Jan Trlifaj Univerzita Karlova, Praha Workshop on infinite-dimensional representations of finite dimensional algebras Manchester,

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

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

Lie Algebras and Representation Theory Homework 7

Lie Algebras and Representation Theory Homework 7 Lie Algebras and Representation Theory Homework 7 Debbie Matthews 2015-05-19 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 = {α

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

MITCHELL S THEOREM REVISITED. Contents

MITCHELL S THEOREM REVISITED. Contents MITCHELL S THEOREM REVISITED THOMAS GILTON AND JOHN KRUEGER Abstract. Mitchell s theorem on the approachability ideal states that it is consistent relative to a greatly Mahlo cardinal that there is no

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

arxiv: v2 [math.lo] 13 Feb 2014

arxiv: v2 [math.lo] 13 Feb 2014 A LOWER BOUND FOR GENERALIZED DOMINATING NUMBERS arxiv:1401.7948v2 [math.lo] 13 Feb 2014 DAN HATHAWAY Abstract. We show that when κ and λ are infinite cardinals satisfying λ κ = λ, the cofinality of the

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

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

Pure Skew Lattices in Rings

Pure Skew Lattices in Rings Semigroup Forum Vol. 68 (24) 268 279 c 24 Springer-Verlag New York, LLC DOI:.7/s233-3-3- RESEARCH ARTICLE Pure Skew Lattices in Rings Karin Cvetko-Vah Communicated by Boris M. Schein Abstract Given a ring

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

A generalized coherent risk measure: The firm s perspective

A generalized coherent risk measure: The firm s perspective Finance Research Letters 2 (2005) 23 29 www.elsevier.com/locate/frl A generalized coherent risk measure: The firm s perspective Robert A. Jarrow a,b,, Amiyatosh K. Purnanandam c a Johnson Graduate School

More information

A note on the number of (k, l)-sum-free sets

A note on the number of (k, l)-sum-free sets A note on the number of (k, l)-sum-free sets Tomasz Schoen Mathematisches Seminar Universität zu Kiel Ludewig-Meyn-Str. 4, 4098 Kiel, Germany tos@numerik.uni-kiel.de and Department of Discrete Mathematics

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

arxiv: v1 [math.co] 6 Oct 2009

arxiv: v1 [math.co] 6 Oct 2009 THE DESCENT STATISTIC OVER 123-AVOIDING PERMUTATIONS arxiv:0910.0963v1 [math.co] 6 Oct 2009 MARILENA BARNABEI, FLAVIO BONETTI, AND MATTEO SILIMBANI Abstract We exploit Krattenthaler s bijection between

More information

Andreas Wagener University of Vienna. Abstract

Andreas Wagener University of Vienna. Abstract Linear risk tolerance and mean variance preferences Andreas Wagener University of Vienna Abstract We translate the property of linear risk tolerance (hyperbolical Arrow Pratt index of risk aversion) from

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

Brownian Motion, the Gaussian Lévy Process

Brownian Motion, the Gaussian Lévy Process Brownian Motion, the Gaussian Lévy Process Deconstructing Brownian Motion: My construction of Brownian motion is based on an idea of Lévy s; and in order to exlain Lévy s idea, I will begin with the following

More information

Separation axioms on enlargements of generalized topologies

Separation axioms on enlargements of generalized topologies Revista Integración Escuela de Matemáticas Universidad Industrial de Santander Vol. 32, No. 1, 2014, pág. 19 26 Separation axioms on enlargements of generalized topologies Carlos Carpintero a,, Namegalesh

More information

arxiv:math/ v1 [math.lo] 9 Dec 2006

arxiv:math/ v1 [math.lo] 9 Dec 2006 arxiv:math/0612246v1 [math.lo] 9 Dec 2006 THE NONSTATIONARY IDEAL ON P κ (λ) FOR λ SINGULAR Pierre MATET and Saharon SHELAH Abstract Let κ be a regular uncountable cardinal and λ > κ a singular strong

More information

Homomorphism and Cartesian Product of. Fuzzy PS Algebras

Homomorphism and Cartesian Product of. Fuzzy PS Algebras Applied Mathematical Sciences, Vol. 8, 2014, no. 67, 3321-3330 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.44265 Homomorphism and Cartesian Product of Fuzzy PS Algebras T. Priya Department

More information

On Existence of Equilibria. Bayesian Allocation-Mechanisms

On Existence of Equilibria. Bayesian Allocation-Mechanisms On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine

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

Characterizing large cardinals in terms of layered partial orders

Characterizing large cardinals in terms of layered partial orders Characterizing large cardinals in terms of layered partial orders Philipp Moritz Lücke Joint work with Sean D. Cox (VCU Richmond) Mathematisches Institut Rheinische Friedrich-Wilhelms-Universität Bonn

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

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

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

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

Chair of Communications Theory, Prof. Dr.-Ing. E. Jorswieck. Übung 5: Supermodular Games

Chair of Communications Theory, Prof. Dr.-Ing. E. Jorswieck. Übung 5: Supermodular Games Chair of Communications Theory, Prof. Dr.-Ing. E. Jorswieck Übung 5: Supermodular Games Introduction Supermodular games are a class of non-cooperative games characterized by strategic complemetariteis

More information

Interpolation of κ-compactness and PCF

Interpolation of κ-compactness and PCF Comment.Math.Univ.Carolin. 50,2(2009) 315 320 315 Interpolation of κ-compactness and PCF István Juhász, Zoltán Szentmiklóssy Abstract. We call a topological space κ-compact if every subset of size κ has

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

Chain conditions, layered partial orders and weak compactness

Chain conditions, layered partial orders and weak compactness Chain conditions, layered partial orders and weak compactness Philipp Moritz Lücke Joint work with Sean D. Cox (VCU Richmond) Mathematisches Institut Rheinische Friedrich-Wilhelms-Universität Bonn http://www.math.uni-bonn.de/people/pluecke/

More information

Weak compactness in Banach lattices

Weak compactness in Banach lattices Weak compactness in Banach lattices Pedro Tradacete Universidad Carlos III de Madrid Based on joint works with A. Avilés, A. J. Guirao, S. Lajara, J. López-Abad, J. Rodríguez Positivity IX 20 July 2017,

More information

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable

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

4 Martingales in Discrete-Time

4 Martingales in Discrete-Time 4 Martingales in Discrete-Time Suppose that (Ω, F, P is a probability space. Definition 4.1. A sequence F = {F n, n = 0, 1,...} is called a filtration if each F n is a sub-σ-algebra of F, and F n F n+1

More 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

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

Hedonic Equilibrium. December 1, 2011

Hedonic Equilibrium. December 1, 2011 Hedonic Equilibrium December 1, 2011 Goods have characteristics Z R K sellers characteristics X R m buyers characteristics Y R n each seller produces one unit with some quality, each buyer wants to buy

More information

Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes

Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes Fabio Trojani Department of Economics, University of St. Gallen, Switzerland Correspondence address: Fabio Trojani,

More information

An Optimal Odd Unimodular Lattice in Dimension 72

An Optimal Odd Unimodular Lattice in Dimension 72 An Optimal Odd Unimodular Lattice in Dimension 72 Masaaki Harada and Tsuyoshi Miezaki September 27, 2011 Abstract It is shown that if there is an extremal even unimodular lattice in dimension 72, then

More information

ARONSZAJN TREES AND THE SUCCESSORS OF A SINGULAR CARDINAL. 1. Introduction

ARONSZAJN TREES AND THE SUCCESSORS OF A SINGULAR CARDINAL. 1. Introduction ARONSZAJN TREES AND THE SUCCESSORS OF A SINGULAR CARDINAL SPENCER UNGER Abstract. From large cardinals we obtain the consistency of the existence of a singular cardinal κ of cofinality ω at which the Singular

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

DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH

DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH Abstract. Suppose D is an ultrafilter on κ and λ κ = λ. We prove that if B i is a Boolean algebra for every i < κ and λ bounds the Depth of every

More information

WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS

WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS BYEONG-KWEON OH Abstract Let L, N and M be positive definite integral Z-lattices In this paper, we show some relation between the

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

PURITY IN IDEAL LATTICES. Abstract.

PURITY IN IDEAL LATTICES. Abstract. ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I.CUZA IAŞI Tomul XLV, s.i a, Matematică, 1999, f.1. PURITY IN IDEAL LATTICES BY GRIGORE CĂLUGĂREANU Abstract. In [4] T. HEAD gave a general definition of purity

More information

FUZZY PRIME L-FILTERS

FUZZY PRIME L-FILTERS International Journal of Applied Mathematical Sciences ISSN 0973-0176 Volume 9, Number 1 (2016), pp. 37-44 Research India Publications http://www.ripublication.com FUZZY PRIME L-FILTERS M. Mullai Assistant

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

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

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

Projective Lattices. with applications to isotope maps and databases. Ralph Freese CLA La Rochelle

Projective Lattices. with applications to isotope maps and databases. Ralph Freese CLA La Rochelle Projective Lattices with applications to isotope maps and databases Ralph Freese CLA 2013. La Rochelle Ralph Freese () Projective Lattices Oct 2013 1 / 17 Projective Lattices A lattice L is projective

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

BETA DISTRIBUTION ON ARITHMETICAL SEMIGROUPS

BETA DISTRIBUTION ON ARITHMETICAL SEMIGROUPS Annales Univ Sci Budapest Sect Comp 47 (2018) 147 154 BETA DISTRIBUTION ON ARITHMETICAL SEMIGROUPS Gintautas Bareikis and Algirdas Mačiulis (Vilnius Lithuania) Communicated by Imre Kátai (Received February

More information

ADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction

ADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen

More information

On the Lower Arbitrage Bound of American Contingent Claims

On the Lower Arbitrage Bound of American Contingent Claims On the Lower Arbitrage Bound of American Contingent Claims Beatrice Acciaio Gregor Svindland December 2011 Abstract We prove that in a discrete-time market model the lower arbitrage bound of an American

More information

Generating all nite modular lattices of a given size

Generating all nite modular lattices of a given size Generating all nite modular lattices of a given size Peter Jipsen and Nathan Lawless Dedicated to Brian Davey on the occasion of his 65th birthday Abstract. Modular lattices, introduced by R. Dedekind,

More information

Generalization by Collapse

Generalization by Collapse Generalization by Collapse Monroe Eskew University of California, Irvine meskew@math.uci.edu March 31, 2012 Monroe Eskew (UCI) Generalization by Collapse March 31, 2012 1 / 19 Introduction Our goal is

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

Shape of the Yield Curve Under CIR Single Factor Model: A Note

Shape of the Yield Curve Under CIR Single Factor Model: A Note Shape of the Yield Curve Under CIR Single Factor Model: A Note Raymond Kan University of Chicago June, 1992 Abstract This note derives the shapes of the yield curve as a function of the current spot rate

More information