More On λ κ closed sets in generalized topological spaces

Size: px
Start display at page:

Download "More On λ κ closed sets in generalized topological spaces"

Transcription

1 Journal of Algorithms and Computation journal homepage: More On λ κ closed sets in generalized topological spaces R. Jamunarani, 1, P. Jeyanthi 2 and M. Velrajan 3 1,2 Research Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur , Tamil Nadu, India. 3 Research Center, Department of Mathematics, Aditanar College of Arts and Science,, Tiruchendur , Tamil Nadu, India ABSTRACT In this paper, we introduce λ κ closed sets and study its properties in generalized topological spaces. ARTICLE INFO Article history: Received 2, February 2014 Received in revised form 10, July 2014 Accepted 19, December 2014 Available online 30, December 2014 Keyword: Generalized topology, µ open set, µ closed set, quasi-topology, strong space, Λ κ set, λ κ open set,λ κ closed set. AMS subject Classification: Primary 54 A Introduction The theory of generalized topology was introduced by Császár in [1]. The properties of generalized topology, basic operators, generalized neighborhood systems and some con- jamunarani1977@gmail.com jeyajeyanthi@rediffmail.com Journal of Algorithms and Computation 45 (2014) PP

2 36 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP structions for generalized topologies have been studied by the same author in [1, 2, 3, 4, 5, 6]. It is well known that generalized topology in the sense of Császár [1] is a generalization of topology on a nonempty set. On the other hand, many important collections of sets related with topology on a set form a generalized topology. In this paper we define several subsets in a generalized topological spaces and study their properties. A nonempty family µ of subsets of a set X is said to be a generalized topology [2] if µ and arbitrary union of elements of µ is again in µ. The pair (X,µ) is called a generalized topological space and elements of µ are called µ open sets. A X is µ closed if X A is µ open. By a space (X,µ), we always mean a generalized topological space. If X µ, (X,µ)iscalledastrong [3]space. Clearly, (X,µ)isstrongifandonlyif isµ closedifand only if c µ ( ) =. In a space (X,µ), if µ is closed under finite intersection, (X,µ) is called a quasi-topological space [5]. Clearly, every strong, quasi-topological space is a topological space. ForA X, c µ (A)isthesmallest µ closedset containingaandi µ (A)isthelargest µ open set contained in A. Moreover, X c µ (A) = i µ (X A), for every subset A of X. A subset A of a space (X,µ) is said to be α open [4]( resp. σ open [4], π open [4], b-open [7], β open[4]) ifa i µ c µ i µ (A) (resp. A c µ i µ (A), A i µ c µ (A), A i µ c µ (A) c µ i µ (A), A c µ i µ c µ (A) ). A subset A of a space (X,µ) is said to be α closed (resp. σ closed, π closed, b-closed, β closed) if X A is α open (resp. σ open, π open, b-open, β open). Let (X,µ) be a space and ζ = {µ,α,σ,π,b,β}. For κ ζ, we consider the space (X,κ), throughout the paper. For A M κ = {B X B µ}, the subset Λ κ (A) is defined by Λ κ (A) = {G A G,G κ}. The proof of the following lemma is clear. Lemma 1.1. Let A,B and B α,α be subsets of M κ in a space (X,κ). Then the following properties are hold. (a) B Λ κ (B). (b) If A B then Λ κ (A) Λ κ (B). (c) Λ κ (Λ κ (B)) = Λ κ (B). (d) If A k, then A = Λ κ (A). (e) Λ κ ( {B α α }) = {Λ κ (B α ) α }. (f) Λ κ ( {B α α }) {Λ κ (B α ) α }. 2 More on λ κ closed sets In a space (X,κ), a subset B of M κ is called a Λ κ set if B = Λ κ (B). We state the following theorem without proof. Theorem 2.1. For subsets A and A α, α of M κ in a space (X,κ), the following hold. (a) Λ κ (A) is a Λ κ set. (b) If A κ, then A is a Λ κ set.

3 37 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP (c) If A α is a Λ κ set for each α, then {A α α } is a Λ κ set. (d) If A α is a Λ κ set for each α, then {A α α } is a Λ κ set. A subset A of M κ in a space (X,κ) is said to be a λ κ closed set if A = T C, where T is a Λ κ set and C is a κ closed set. The complement of a λ κ closed set is called a λ κ open set. We denote the collection of all λ κ open (resp., λ κ closed) set of X by λ κ O(X) (resp., λ κ C(X)). The following theorem gives the characterization of λ κ closed sets. Lemma 2.2. Let A M κ be a subset in a space (X,κ). Then the following are equivalent. (a) A is a λ κ closed set. (b)a = T c κ (A), where T is a Λ κ set. (c) A = Λ κ (A) c κ (A). Let (X,κ) be a space. A point x M κ is called a λ κ cluster point of A if for every λ κ open set U of M κ containing x we have A U. The set of all λ κ cluster points of A is called the λ κ closure of A and is denoted by c λκ (A). Lemma 2.3 gives some properties of c λκ, the easy proof of which is omitted. Lemma 2.3. Let (X,κ) be a space and A,B M κ. Then the following properties hold. (a) A c λκ (A). (b) c λκ (A) = {F A F and F is λ κ closed}. (c) If A B, then c λκ (A) c λκ (B). (d) A is a λ κ closed set if and only if A = c λκ (A). (e) c λκ (A) is a λ κ closed set. Let (X,κ) be a space and A M κ. A point x M κ is said to be a κ limit point of A if for each κ open set U containing x, U {A {x}}. The set of all κ limit points of A is called a κ derived set of A and is denoted by D κ (A). Let (X,κ) be a space and A M κ. A point x M κ is said to be a λ κ limit point of A if for each λ κ open set U containing x, U {A {x}}. The set of all λ κ limit points of A is called a λ κ derived set of A and is denoted by D λκ (A). Theorem 2.4 gives some properties of λ κ derived sets and Theorem 2.5 gives the characterization of λ κ derived sets. Theorem 2.4. Let (X,κ) be a space and A,B M κ. Then the following hold. (a) D λκ (A) D κ (A). (b) If A B, then D λκ (A) D λκ (B). (c) D λκ (A) D λκ (B) D λκ (A B) and D λκ (A B) D λκ (A) D λκ (B). (d)d λκ D λκ (A) A D λκ (A). (e) D λκ (A D λκ (A)) A D λκ (A). Proof. (a) Since every κ open set is a λ κ open set, it follows. (b) Let x D λκ (A). Let U be any λ κ open set containing x. Then U {A {x}} and so V {B {x}}, since A B. Therefore, x D λκ (B). (c) Since A B A,B we have D λκ (A B) D λκ (A) D λκ (B). Since A,B A B,

4 38 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP we have D λκ (A) D λκ (B) D λκ (A B). (d) Let x D λκ D λκ (A) A and U be a λ κ open set containing x. Then U (D λκ (A) {x}).lety U (D λκ (A) {x}).since y D λκ (A)andx y U, U (A {y}). Let z U (A {y}). Then z U (A {y}) implies that z U and z A {y} and so z y. Since x A, z U (A {x}) and so U (A {x}). Therefore, x D λκ (A). (e) Let x D λκ (A D λκ (A)). If x A, the result is clear. Suppose x A. Since x D λκ (A D λκ (A)) A, then for λ κ open set U containing x, U ((A D λκ (A)) {x}). Thus U (A {x}) or U (D λκ (A) {x}). Now it follows from (d) that U (A {x}). Hence, x D λκ (A). Therefore, in all the cases D λκ (A D λκ (A)) A D λκ (A). Theorem 2.5. Let (X,κ) be space and A X. Then c λκ (A) = A D λκ (A). Proof. Since D λκ (A) c λκ (A), A D λκ (A) c λκ (A). On the other hand, let x c λκ (A). If x A, the proof is complete. If x / A, then each λ κ open set U containing x intersects A at a point distinct from x. Therefore, x D λκ (A). Thus, c λκ (A) A D λκ (A) and so c λκ (A) = A D λκ (A) which completes the proof. Let (X,κ) be a space and A X. Then i λκ (A) is the union of all λ κ open set contained in A. Theorem 2.6 gives some properties of i λκ. Theorem 2.6. Let (X,κ) be a space and A,B X. Then the following hold. (a) A is a λ κ open set if and only if A = i λκ (A). (b) i λκ (i λκ (A)) = i λκ (A). (c) i λκ (A) = A D λκ (X A). (d) X i λκ (A) = c λκ (X A). (e) X c λκ (A) = i λκ (X A). (f) A B then i λκ (A) i λκ (B). (g) i λκ (A) i λκ (B) i λκ (A B) and i λκ (A) i λκ (B) i λκ (A B). Proof. (c) If x A D λκ (X A), then x / D λκ (X A) and so, there exists a λ κ open set U containing x such that U (X A) =. Then x U A and hence x i λκ (A). That is, A D λκ (X A) i λκ (A).Ontheother hand, if x i λκ (A),then x / D λκ (X A), since i λκ (A) is a λ κ open set and i λκ (A) (X A) =. Hence, i λκ (A) = A D λκ (X A). (d) X i λκ (A) = X (A D λκ (X A)) = (X A) D λκ (X A) = c λκ (X A). Let (X,κ) be a space and A X. Then b κ (A) = A i κ (A) is said to be κ border of A. Let (X,κ) be a space and A X. Then b λκ (A) = A i λκ (A) is said to be λ κ border of A. Theorem 2.7 gives some properties of b λκ. Theorem 2.7. Let (X,κ) be a space and A X. Then the following hold. (a) b λκ (A) b κ (A). (b) A = i λκ (A) b λκ (A). (c) i λκ (A) b λκ (A) =.

5 39 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP (d) A is a λ κ open set if and only if b λκ (A) =. (e) b λκ (i λκ (A)) =. (f) i λκ (b λκ (A)) =. (g) b λκ (b λκ (A)) = b λκ (A). (h) b λκ (A) = A c λκ (X A). (i) b λκ (A) = D λκ (X A). Proof. (f) If x i λκ (b λκ (A)), then x b λκ (A). On the other hand, since b λκ (A) A, x i λκ (b λκ (A)) i λκ (A). Hence x i λκ (A) b λκ (A) which contradicts (c). Thus, i λκ (b λκ (A)) =. (h) b λκ (A) = A i λκ (A) = A (X c λκ (X A)) = A c λκ (X A). (i) b λκ (A) = A i λκ (A) = A (A D λκ (X A)) = D λκ (X A). Let (X,κ) beaspace anda X. Then F κ (A) = c κ (A) i κ (A) is said to bethe κ frontier of A. Let (X,κ) be a space and A X. Then F λκ (A) = c λκ(a) i λκ (A) is said to be the λ κ frontier of A. Theorem 2.8 gives some properties of F λκ. Theorem 2.18 Let (X,κ) be a space and A X. Then the following hold. (a) F λκ (A) F κ (A). (b) c λκ (A) = i λκ (A) F λκ (A). (c) i λκ (A) F λκ (A) =. (d) b λκ (A) F λκ (A). (e) F λκ (A) = b λκ (A) D λκ (A). (f) A is a λ κ open set if and only if F λκ (A) = D λκ (A). (g) F λκ (A) = c λκ (A) c λκ (X A).(h) F λκ (A) = F λκ (X A). (i) F λκ (A) is a λ κ closed set. (j) F λκ (F λκ (A)) F λκ (A). (k) F λκ (i λκ (A)) F λκ (A). (l) F λκ (c λκ (A)) F λκ (A). (m) i λκ (A) = A F λκ (A). Proof. (b) i λκ (A) F λκ (A) = i λκ (A) (c λκ (A) i λκ (A)) = c λκ (A). (c) i λκ (A) F λκ (A) = i λκ (A) (c λκ (A) i λκ (A)) =. (e) Since i λκ (A) F λκ (A) = i λκ (A) b λκ (A) D λκ (A), F λκ (A) = b λκ (A) D λκ (A). (g) F λκ (A) = c λκ (A) i λκ (A) = c λκ (A) c λκ (X A). (i)c λκ (F λκ (A)) = c λκ (c λκ (A) c λκ (X A)) c λκ (c λκ (A)) c λκ (c λκ (X A)) = F λκ (A). Hence F λκ (A) is a λ κ closed set. (j) F λκ (F λκ (A)) = c λκ (F λκ (A) c λκ (X F λκ (A)) c λκ (F λκ (A)) = F λκ (A). (l) F λκ (c λκ (A)) = c λκ ((c λκ (A)) i λκ (c λκ (A)) = c λκ (A) i λκ (c λκ (A)) c λκ (A) i λκ (A) = F λκ (A). (m) A F λκ (A) = A (c λκ (A) i λκ (A)) = i λκ (A).

6 40 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP Let (X,κ) be a space and A X. Then E κ (A) = i κ (X A) is said to be κ exterior of A. Let (X,κ) be a space and A X. Then E λκ (A) = i λκ (X A) is said to be λ κ exterior of A. Theorem 2.9 gives some properties of E λκ. Theorem 2.9. Let (X,κ) be a space and A X. Then the following hold. (a) E κ (A) E λκ (A) where E κ (A) denotes the exterior of A. (b) E λκ (A) is λ κ open. (c) E λκ (A) = i λκ (X A) = X c λκ (A). (d) E λκ (E λκ (A)) = i λκ (c λκ (A)). (e) If A B,then E λκ (A) E λκ (B). (f) E λκ (A B) E λκ (A) E λκ (B). (g)e λκ (A B) E λκ (A) E λκ (B). (h) E λκ (X) =. (i) E λκ ( ) = X. (j) E λκ (A) = E λκ (X E λκ (A)). (k) i λκ (A) E λκ (E λκ (A)). (l) X = i λκ (A) E λκ (A) F λκ (A). Proof. (d)e λκ (E λκ (A)) = E λκ (X c λκ (A)) = i λκ (X (X x λκ (A)) = i λ (c λ (A)). (j)e λκ (X E λκ (A)) = E λκ (X i λκ (X A)) = i λκ (X (X i λκ (X A))) = i λκ (i λκ (X A)) = i λκ (X A) = E λ (A). (k) i λκ (A) i λκ (c λκ (A)) = i λκ (X i λκ (X A)) = i λκ (X E λκ (A)) = E λκ (E λκ (A)).

7 41 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP References [1] Á. Császár, Generalized open sets, Acta Math. Hungar., 75(1-2)(1997), [2] Á. Császár, Generalized topology, generalized continuity, Acta Math. Hungar., 96(2002), [3] Á. Császár, Extremally disconnected generalized topologies, textitannales Univ. Sci. Budapest., 47(2004), [4] Á. Császár, Generalized open sets in generalized topologies, Acta Math. Hungar., 106(2005), [5] Á. Császár, Further remarks on the formula for γ interior, Acta Math. Hungar., 113(4)(2006), [6] Á. Császár, Remarks on quasi-topologies, Acta Math. Hungar., 119(2007), [7] P. Sivagami, Remarks on γ interior, Acta Math. Hungar., 119(2008),

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

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

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

Fuzzy Join - Semidistributive Lattice

Fuzzy Join - Semidistributive Lattice International Journal of Mathematics Research. ISSN 0976-5840 Volume 8, Number 2 (2016), pp. 85-92 International Research Publication House http://www.irphouse.com Fuzzy Join - Semidistributive Lattice

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

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

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

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

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

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

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

1-TYPE CURVES AND BIHARMONIC CURVES IN EUCLIDEAN 3-SPACE

1-TYPE CURVES AND BIHARMONIC CURVES IN EUCLIDEAN 3-SPACE International Electronic Journal of Geometry Volume 4 No. 1 pp. 97-101 (2011) c IEJG 1-TYPE CURVES AND BIHARMONIC CURVES IN EUCLIDEAN 3-SPACE (Communicated by Shyuichi Izumiya) Abstract. We study 1-type

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

UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES

UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES JOHN BALDWIN, DAVID KUEKER, AND MONICA VANDIEREN Abstract. Grossberg and VanDieren have started a program to develop a stability theory for

More information

R. Selvi 1, P. Thangavelu 2. Sri Parasakthi College for Women Courtallam, INDIA 2 Department of Mathematics

R. Selvi 1, P. Thangavelu 2. Sri Parasakthi College for Women Courtallam, INDIA 2 Department of Mathematics International Journal of Pure and Applied Mathematics Volume 87 No. 6 2013, 817-825 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v87i6.10

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

Sy D. Friedman. August 28, 2001

Sy D. Friedman. August 28, 2001 0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such

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

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

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

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

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

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

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

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

Level by Level Inequivalence, Strong Compactness, and GCH

Level by Level Inequivalence, Strong Compactness, and GCH Level by Level Inequivalence, Strong Compactness, and GCH Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth

More 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

Solutions of Bimatrix Coalitional Games

Solutions of Bimatrix Coalitional Games Applied Mathematical Sciences, Vol. 8, 2014, no. 169, 8435-8441 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410880 Solutions of Bimatrix Coalitional Games Xeniya Grigorieva St.Petersburg

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

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

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

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

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

Variations on a theme by Weetman

Variations on a theme by Weetman Variations on a theme by Weetman A.E. Brouwer Abstract We show for many strongly regular graphs, and for all Taylor graphs except the hexagon, that locally graphs have bounded diameter. 1 Locally graphs

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

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

Game Theory: Normal Form Games

Game Theory: Normal Form Games Game Theory: Normal Form Games Michael Levet June 23, 2016 1 Introduction Game Theory is a mathematical field that studies how rational agents make decisions in both competitive and cooperative situations.

More 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

Introduction to game theory LECTURE 2

Introduction to game theory LECTURE 2 Introduction to game theory LECTURE 2 Jörgen Weibull February 4, 2010 Two topics today: 1. Existence of Nash equilibria (Lecture notes Chapter 10 and Appendix A) 2. Relations between equilibrium and rationality

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

Essays on Some Combinatorial Optimization Problems with Interval Data

Essays on Some Combinatorial Optimization Problems with Interval Data Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university

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

Version A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise.

Version A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise. Math 224 Q Exam 3A Fall 217 Tues Dec 12 Version A Problem 1. Let X be the continuous random variable defined by the following pdf: { 1 x/2 when x 2, f(x) otherwise. (a) Compute the mean µ E[X]. E[X] x

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

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

arxiv: v1 [math.lo] 8 Oct 2015

arxiv: v1 [math.lo] 8 Oct 2015 ON THE ARITHMETIC OF DENSITY arxiv:1510.02429v1 [math.lo] 8 Oct 2015 MENACHEM KOJMAN Abstract. The κ-density of a cardinal µ κ is the least cardinality of a dense collection of κ-subsets of µ and is denoted

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

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

LARGE CARDINALS AND L-LIKE UNIVERSES

LARGE CARDINALS AND L-LIKE UNIVERSES LARGE CARDINALS AND L-LIKE UNIVERSES SY D. FRIEDMAN There are many different ways to extend the axioms of ZFC. One way is to adjoin the axiom V = L, asserting that every set is constructible. This axiom

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

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

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

Generalising the weak compactness of ω

Generalising the weak compactness of ω Generalising the weak compactness of ω Andrew Brooke-Taylor Generalised Baire Spaces Masterclass Royal Netherlands Academy of Arts and Sciences 22 August 2018 Andrew Brooke-Taylor Generalising the weak

More information

PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES

PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES WILLIAM R. BRIAN AND ARNOLD W. MILLER Abstract. We prove that, for every n, the topological space ω ω n (where ω n has the discrete topology) can

More information

METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES

METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES Bulletin of the Section of Logic Volume 8/4 (1979), pp. 191 195 reedition 2010 [original edition, pp. 191 196] David Miller METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES This is an

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

In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure

In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure Yuri Kabanov 1,2 1 Laboratoire de Mathématiques, Université de Franche-Comté, 16 Route de Gray, 253 Besançon,

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

Browder-type theorems for direct sums of operators

Browder-type theorems for direct sums of operators Functional Analysis, Approximation and Computation 7 (1) (2015), 77 84 Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/faac Browder-type

More information

The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract)

The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract) The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract) Patrick Bindjeme 1 James Allen Fill 1 1 Department of Applied Mathematics Statistics,

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

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

FORCING AND THE HALPERN-LÄUCHLI THEOREM. 1. Introduction This document is a continuation of [1]. It is intended to be part of a larger paper.

FORCING AND THE HALPERN-LÄUCHLI THEOREM. 1. Introduction This document is a continuation of [1]. It is intended to be part of a larger paper. FORCING AND THE HALPERN-LÄUCHLI THEOREM NATASHA DOBRINEN AND DAN HATHAWAY Abstract. We will show the various effects that forcing has on the Halpern-Läuchli Theorem. We will show that the the theorem at

More 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

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

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

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Chapter 6: Mixed Strategies and Mixed Strategy Nash Equilibrium

More information

Topics in Contract Theory Lecture 3

Topics in Contract Theory Lecture 3 Leonardo Felli 9 January, 2002 Topics in Contract Theory Lecture 3 Consider now a different cause for the failure of the Coase Theorem: the presence of transaction costs. Of course for this to be an interesting

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

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

Research Article The Monoid Consisting of Kuratowski Operations

Research Article The Monoid Consisting of Kuratowski Operations Mathematics Volume 2013, Article ID 289854, 9 pages http://dx.doi.org/10.1155/2013/289854 Research Article The Monoid Consisting of Kuratowski Operations Szymon Plewik and Marta WalczyNska InstituteofMathematics,UniversityofSilesia,ul.Bankowa14,40-007Katowice,Poland

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

Best response cycles in perfect information games

Best response cycles in perfect information games P. Jean-Jacques Herings, Arkadi Predtetchinski Best response cycles in perfect information games RM/15/017 Best response cycles in perfect information games P. Jean Jacques Herings and Arkadi Predtetchinski

More information

A THREE-FACTOR CONVERGENCE MODEL OF INTEREST RATES

A THREE-FACTOR CONVERGENCE MODEL OF INTEREST RATES Proceedings of ALGORITMY 01 pp. 95 104 A THREE-FACTOR CONVERGENCE MODEL OF INTEREST RATES BEÁTA STEHLÍKOVÁ AND ZUZANA ZÍKOVÁ Abstract. A convergence model of interest rates explains the evolution of the

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

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

Efficiency in Decentralized Markets with Aggregate Uncertainty

Efficiency in Decentralized Markets with Aggregate Uncertainty Efficiency in Decentralized Markets with Aggregate Uncertainty Braz Camargo Dino Gerardi Lucas Maestri December 2015 Abstract We study efficiency in decentralized markets with aggregate uncertainty and

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

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

Kuhn s Theorem for Extensive Games with Unawareness

Kuhn s Theorem for Extensive Games with Unawareness Kuhn s Theorem for Extensive Games with Unawareness Burkhard C. Schipper November 1, 2017 Abstract We extend Kuhn s Theorem to extensive games with unawareness. This extension is not entirely obvious:

More information

On Forchheimer s Model of Dominant Firm Price Leadership

On Forchheimer s Model of Dominant Firm Price Leadership On Forchheimer s Model of Dominant Firm Price Leadership Attila Tasnádi Department of Mathematics, Budapest University of Economic Sciences and Public Administration, H-1093 Budapest, Fővám tér 8, Hungary

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

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

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

Two hours. To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER

Two hours. To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER Two hours MATH20802 To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER STATISTICAL METHODS Answer any FOUR of the SIX questions.

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

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

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

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

BINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES

BINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES Journal of Science and Arts Year 17, No. 1(38), pp. 69-80, 2017 ORIGINAL PAPER BINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES CAN KIZILATEŞ 1, NAIM TUGLU 2, BAYRAM ÇEKİM 2

More information

Commentationes Mathematicae Universitatis Carolinae

Commentationes Mathematicae Universitatis Carolinae Commentationes Mathematicae Universitatis Carolinae Lucia R. Junqueira; Alberto M. E. Levi Reflecting character and pseudocharacter Commentationes Mathematicae Universitatis Carolinae, Vol. 56 (2015),

More information

Extender based forcings, fresh sets and Aronszajn trees

Extender based forcings, fresh sets and Aronszajn trees Extender based forcings, fresh sets and Aronszajn trees Moti Gitik August 31, 2011 Abstract Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model

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

PhD Qualifier Examination

PhD Qualifier Examination PhD Qualifier Examination Department of Agricultural Economics May 29, 2015 Instructions This exam consists of six questions. You must answer all questions. If you need an assumption to complete a question,

More information

CONSISTENCY AMONG TRADING DESKS

CONSISTENCY AMONG TRADING DESKS CONSISTENCY AMONG TRADING DESKS David Heath 1 and Hyejin Ku 2 1 Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA, email:heath@andrew.cmu.edu 2 Department of Mathematics

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

Building Infinite Processes from Regular Conditional Probability Distributions

Building Infinite Processes from Regular Conditional Probability Distributions Chapter 3 Building Infinite Processes from Regular Conditional Probability Distributions Section 3.1 introduces the notion of a probability kernel, which is a useful way of systematizing and extending

More information

On the zeros of the Lerch zeta-function. III

On the zeros of the Lerch zeta-function. III On the zeros of the Lerch zeta-function. III Ramūnas GARUNKŠIS (Vilnius University) e-mail: ramunas.garunkstis@maf.vu.lt Abstract. We investigate uper bounds for the number of zeros of the Lerch zeta function.

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