International Journal of Mathematical Archive-5(6), 2014, Available online through ISSN
|
|
- Sheryl Carson
- 6 years ago
- Views:
Transcription
1 International Journal of Mathematical Archive-5(6), 2014, Available online through ISSN CLOSURE OPERATORS ON COMPLETE ALMOST DISTRIBUTIVE LATTICES-I G. C. Rao Department of Mathematics, Andhra University, Visakhapatnam, Andhra Pradesh, India Venugopalam Undurthi* Department of Mathematics, Andhra University, Visakhapatnam, Andhra Pradesh, India (Received on: ; Revised & Accepted on: ) ABSTRACT In this paper, we introduce the concept of a closure operator, dual atom, meet-distributive closure operator, joindistributive closure operator, distributive closure operator and derive their important properties. AMS 2000 subject Classification: 06D99, 06E15, 06B23. Keywords: Almost Distributive Lattice, Complete Almost Distributive Lattice, Closure Operator, Dual atom, Meet- Distributive Closure Operator, Join-Distributive Closure Operator, Distributive Closure Operator. 1. INTRODUCTION In [7], Swamy and Rao introduced the concept of an Almost Distributive Lattice (ADL) as a common abstraction of most of the existing lattice theoretic and ring theoretic generalizations of a Boolean algebra and they observed that the set PI (L) of all principal ideals of an ADL L = (L,,, 0, m) with a maximal element m, forms a bounded distributive lattice. Through this lattice PI(L) many concepts existing in the class of distributive lattices were extended to the class of ADL by different authors. Prominent among Them are Pseudo-Complementation on ADLs [4], Stone ADLs [8], Normal ADLs [5], Heyting ADLs [3]. In our paper [6], we have introduced the concept of a complete Almost Distributive Lattice as an ADL in which the lattice PI(L) of all principal ideals of L is a complete sublattice of the lattice I(L) of all ideals of L. In [2], Jose Morgado introduced the concept of a closure operator on a complete lattice and studied some important properties of closure operators. In this paper, we introduce the concept of a closure operator on a Complete Almost Distributive Lattice on the lines of Jose Morgado and study its properties. We define the concepts of meet-distributive closure operator, join-distributive closure operator, and distributive closure operator. We prove that the set Φ (L) of all closure operators on a complete Almost Distributive Lattice L is a complete lattice. Finally we derive a necessary and sufficient condition for a closure operator ϕ on L to be a (meet/join) distributive closure operator in terms of the closed elements of L with respect to ϕ. 2. PRELIMINARIES In this section, we give some fundamental concepts and results on ADLs for the sake of ready reference. Definition 2.1: [7] An algebra L = (L,,, 0) of type (2, 2, 0) is called an Almost Distributive Lattice (ADL), if it satisfies the following axioms: (1) x 0 = x (2) 0 x = 0 (3) ( x y) z = (x z) (y z) (4) x (y z) = (x y) (x z) (5) x (y z) = (x y) (x z) (6) (x y) y = y For all x, y, z L. Corresponding author: Venugopalam Undurthi* International Journal of Mathematical Archive- 5(6), June
2 Let L = (L,,, 0) be an ADL. For x, y L, define x y if and only if x y = x or equivalently x y = y. Then is a partial order on L. A non-empty subset I of L is called an ideal if (i) a, b I, then a b I (ii) a I, x L, then a x I. The set of all ideals of L is denoted by I (L) and (I (L), ) is a complete distributive lattice. For any x L, (x] = {y x y L} is an ideal of L and is called the principal ideal generated by x. The set PI (L) of all principal ideals of L is a sublattice of the lattice I (L). Lemma 2.2: [7] If L = (L,,, 0) is an ADL and x, y, z L. Then we have the following: (1) x x = x (2) x x = x (3) x y y (4) x x y (5) x y z = y x z. Theorem 2.3: [7] Let L be an ADL, then for any m L the following are equivalent: (1) m is maximal (2) m x = m, for all x L (3) m x = x, for all x L. Definition 2.4: [6] An ADL L = (L,,, 0) with a maximal element m is said to be complete, if PI(L) is a complete sublattice of I(L). Theorem 2.5: [6] Let L = (L,,, 0) be an ADL with a maximal element m, then L is a complete ADL if and only if [0,m] is a complete distributive lattice. Example 2.6: [7] Let X be a non-empty set and x 0 X. Define binary operations, on X by: x y = y if x = x 0 and x y = x 0, if xx = x 0 x, if x x 0 y, if xx x 0. Then (X,,, x 0 ) is an ADL, with x 0 as its zero element. This ADL is called a Discrete ADL. For all standard definitions and results in distributive lattices we refer to Gratzer, G. [1]. 3. CLOSURE OPERATORS In this section, we introduce the concepts of a closure operator on a complete almost distributive lattice, and derive many important properties of closure operators. We begin with the following definition of a closure operator. Definition 3.1: Let L be a complete ADL with a maximal element m. Then a mapping ϕ: L L is said to be a closure operator of L if, for any x, y L, the following conditions hold: (1) ϕ(x) m (2) ϕ(x) x = x (3) If x y, then ϕ(x) ϕ(y) (4) ϕ(x y) = ϕ(y x) (5) ϕ (ϕ(x)) = ϕ(x). Let L be a complete ADL with a maximal element m, then we denote set of all closure operators on L by Φ (L). In the following we give two important closure operators on a complete almost distributive lattice. Example 3.2: Let L be a complete ADL with a maximal element m, define t: L L by t(x) = x m for all x L. Then t is a closure operator of L. Example 3.3: Let L be a complete ADL with a maximal element m, define ωω: L L by ω(x) = m, for all x L. Then ω is a closure operator of L. Theorem 3.4: If L = (L,, 0, m) is a discrete ADL with a maximal element m. Then there are only two closure operators on L. Proof: Suppose L = (L,,, 0, m) is a discrete ADL with a maximal element m. Let ϕ be a closure operator on L. Let x, y L, if x 0 and y 0, then ϕ(x y) = ϕ(y x) and hence ϕ(y) = ϕ(x). Suppose ϕ (0) = 0, since ϕ(x) x = x, for x 0. Therefore ϕ(x) 0. Also, since ϕ(x) m, we get that m = ϕ(x). Hence ϕ(x) = x m for all x L. Thus ϕ = t. Suppose ϕ (0) 0, then ϕ (0) m implies ϕ (0) = m. Also, ϕ (0) ϕ(x) implies ϕ(x) = m for all x L. Thus ϕ = ωω. 2014, IJMA. All Rights Reserved 120
3 Definition 3.5: Let L be a complete ADL with a maximal element m, and ϕ a closure operator of L. Then an element x L is said to be closed under ϕ, if ϕ(x) = x. The following result can be verified routinely. Lemma 3.6: Let ϕ be a closure operator of a complete ADL L. Then an element y L is closed under ϕ if and only if y = ϕ(x) for some x L. Lemma 3.7: L be a complete ADL with a maximal element m. Then m is closed under every closure operator of L. Proof: Let ϕ be any closure operator of L. Then, by (2) of the definition 3.1, we get that ϕ (m) m = m. Therefore ϕ (m) = m, since ϕ (m) m. Hence m is closed under any closure operator of L. Lemma 3.8: Let L be a complete ADL with a maximal element m, let ϕ be a closure operator of L and {x αα m αα J} aa family of closed elements under ϕ in L. Then αα JJ (x α m) is also a closed element under ϕ in L. Proof: Suppose {x α m α J} is a family of closed elements under ϕ in L. Let x = αα JJ (x α m). Clearly, x L and x x αα m for all α J. Then ϕ(x) ϕ (x α m) = x α m for all α J. Therefore ϕ(x) αα JJ (x α m) = x and hence ϕ(x) = ϕ(x) x = x. Therefore x is closed under ϕ. Lemma 3.9: Let L be a complete ADL with a maximal element m, ϕ a closure operator of L and x L. Then ϕ(x) = inf {y m L y m is closed under ϕ and y x = x}. Proof: Let A = {y m L y m is closed under ϕ and y x = x}. Let y 0 = y m A (y m). Now, we prove that ϕ(x) = y 0. Let y m A. Then y x = x. Thus x m y m for all y m A. Therefore ϕ(x) ϕ(y) = y m for all y m A and hence ϕ(x) αα JJ (x α m). = y 0. Since, ϕ (ϕ(x)) = ϕ(x) and ϕ(x) x = x, we get that ϕ(x) A, and hence y 0 ϕ(x). Thus ϕ(x) = y 0. Definition 3.10: Let Φ(L) be the set of all closure operators of L and for any ϕ, ψ Φ(L), define ϕ ψ if and only if ϕ(x) ψ(x) for all x L. Lemma 3.11: Let L be a complete ADL with a maximal element m. Then is a partial order on Φ(L). Definition 3.12: Let {ϕ αα α J} Φ(L), define ( α J ϕ αα )(x) = αα JJ (ϕ αα (x)) for all x L. Theorem 3.13: Let { ϕ αα α J} Φ(L). Then αα JJ ϕ αα set (Φ(L), ). Φ (L) is the g.l.b of {ϕ αα α J} in the partially ordered Proof: Write ϕ = ϕ αα (1) For x L, ϕ(x) ϕ αα (x) m for all α J. (2) Let x L. Then ϕ αα (x) x = x and hence x m ϕ αα (x) m for all α J. Thus x m αα JJ (ϕ αα (x)) = ϕ (x) and hence x m ϕ(x) = x m. Therefore x ϕ(x) x = x m x. Hence ϕ(x) x = x. (3) Let x, y L such that x y. Then ϕ αα (x) ϕ αα (y) for all α J. Since, ϕ ϕ αα for all α J, we get that ϕ(x) ϕ αα (x) ϕ αα (y) for all α J and hence ϕ(x) αα JJ (ϕ αα (y)). Thus ϕ(x) ϕ(y). (4) Let x, y L. Now, ϕ(x y) = α J ϕ αα ((x y)) = α J ϕ αα ((y x)) = ϕ(y x). (5) Let x L. Then ϕ(ϕ(x)) ϕ(x) = ϕ(x) and hence ϕ(x) ϕ(ϕ(x)), we have ϕ(x) ϕ αα (x) for all α J, then ϕ(ϕ(x)) ϕ(ϕ αα (x) ) ϕ αα (ϕ αα (x) ) = ϕ αα (x) for all α J and hence ϕ(ϕ(x)) inf { ϕ αα (x) α J } = ϕ(x). Thus ϕ(ϕ(x)) = ϕ(x). Therefore ϕ is a closure operator of L. Suppose ψ Φ (L) and ψ ϕ αα for all α J. Then ψ(x) ϕ αα (x) for all α J. Hence ψ(x) (x)). Thus ψ(x) ϕ(x). α J. Therefore ψ ϕ and hence ϕ is the g.l.b of {ϕ αα α J}. (ϕ αα αα JJ Since ω is the greatest element of the poset (Φ(L), ), by above theorem, we get the following. Theorem 3.14: The poset (Φ(L), ) is a complete lattice. Theorem 3.15: Let {ϕ αα α J} Φ(L) and ψ = α J. α J ϕ αα. Then, for any x L, ψ(x) = x if and only if ϕ αα (x) = x for all 2014, IJMA. All Rights Reserved 121
4 Proof: Let {ϕ αα α J} Φ(L) and ψ = α J ϕ αα. Suppose x L and ψ(x) = x. Since ϕ αα ψ for α J, we get that ϕ αα (x) ψ(x) = x for all α J. Hence ϕ αα (x) = ϕ αα (x) x = x for all α J. Conversely, suppose that ϕ αα (x) = x for all α J. Define η: L L by x, if x y = yy η(y) = m, otherwise First we prove that η is a closure operator of L. (1) Let y L and x y = y. Then η(y) = x = = ϕ αα (x) m. Otherwise η(y) = m. Therefore η(y) m for all y L. (2) Let y L. If x y = y, then η(y) y = x y = y. Otherwise η(y) y = m y = y. Therefore η(y) y = y for all y L. (3) Let y, z L such that y z. Suppose x z = z, then x z y = z y. Hence x y = y. Therefore η(z) = x = η(y). If x z = z, then η(z) = m. Therefore η(y) η(z). (4) Let y, z L. Since x y z = y z if and only if x z y = z y, we get that η(y z) = η (z y). (5) Let y L. If x y = y, then η(y) = x. Now, η(η(y)) = η(x) = x = η(y). Suppose x y y, then η(y) = m. Therefore η (η(y)) = η(m) = m = η(y). Hence η is a closure operator of L. Now, we prove that ϕ αα η for all α J. Let y L, suppose x y = y, then ϕ αα (x) = ϕ αα (x y) = ϕ αα (y x) = ϕ αα (x) = x = η(y). Now, suppose x y y, then ϕ αα (x) m = η(y). Hence ϕ αα η. Since α is arbitrary, we get that ψ = α J ϕ αα. Therefore ψ(x) η(x) = x. Hence ψ(x) = x. Lemma 3.16: Let L be a complete ADL with a maximal element m, a L such that a m m and define ϕ a: L L by ϕ a(x) = a m, if a x = x and ϕ a (x) = m, if a x x for all x L. Then ϕ aa is a closure operator of L. Proof: (1) For any x L, ϕ a (x) = a m or m and hence ϕ a (x) m for all x L. (2) Let x L. If a x = x. Then ϕ a (x) x = a m x = a x = x. If a x x. Then ϕ a (x) x = m x = x. Therefore ϕ a(x) x = x for all x L. (3) Let x, y L such that x y, if a y y, then by (1), ϕ a (x) m = ϕ a (y). Suppose a y = y, then a x = x and hence ϕ a (x) = a m = ϕ a (y). Thus ϕ a (x) ϕ a (y), whenever x y. (4) Let x, y L. Now, a x y = x y iff a x y x = x y x iff a y x = y x. Therefore ϕ a (x y) = ϕ a (y x). (5) Let x L. If a x = x. Then ϕ a (x) = a m. Since a a m = a m, we get that ϕ a (a m) = a m m = a m and hence ϕ a (ϕ a (x)) = ϕ a (x). If a x x, then a m m. Now, ϕ a (x) = m and ϕ a (ϕ a (x)) = ϕ a (m) = m = ϕ a (x). Thus ϕ a is a closure operator of L. Definition 3.17: Let L be a complete ADL with a maximal element m. Then a closure operator ϕ of L is said to be a dual atom of Φ(L) if there exists no closure operator ψ of L such that ϕ < ψ < ω. In other words, ψ is a closure operator of L such that ϕ ψ ω. Then either ϕ = ψ or ψ = ω. Lemma 3.18: Let L be a complete ADL with a maximal element m and a L such that a m m. Then ϕ a is a dual atom of L. Proof: Let ψ be a closure operator of L such that ϕ a ψ ω. Case (i) if ψ (a) = m. If a x = x, then a m = ϕ a (x) ψ(x). Now, m = ψ (a) = ψ (a x) ψ(x). If a x x, then m = ϕ a (x) ψ(x). Hence ψ(x) = m. Thus ψ = ω. Case (ii) if ψ (a) < m. If a x = x, then x m a m and hence ψ(x) ψ (a). Also, a m = ϕ a (x) ψ(x) implies ψ (a) ψ(x). Thus ψ(x) = ψ (a). Now, ϕ a (ψ (a)) ψ (ψ (a)) = ψ (a) < m. Therefore a ψ (a) = ψ (a). So that, ψ (a) = a m. Hence ψ(x) = a m if a x = x. If a x x, then ϕ a (x) = m and hence ψ(x) = m. Therefore ψ = ϕ a. Thus ψ = ω or ψ = ϕ a. Therefore ϕ a is a dual atom of Φ(L). Lemma 3.19: If ϕ is a dual atom of Φ(L). Then there exists b L such that b m m and ϕ = ϕ b. Proof: Suppose ϕ is a dual atom of Φ(L). Then, ϕ ω. Therefore there exists x ( m) L such that ϕ(x) m. If b = ϕ(x), then b m = ϕ(x) m = ϕ(x). Therefore b m m. Now, we prove that ϕ b = ϕ. Let y L. If b y = y, then ϕ b (y) = b m and ϕ(y) ϕ (b) = b. Hence ϕ(y) b m = ϕ b (y). Thus ϕ(y) = ϕ b(y). If b y y, then ϕ b (y) = m. Therefore ϕ(y) ϕ b (y). Hence ϕ(y) = ϕ b (y), if b y y. Therefore ϕ(y) = ϕ b (y), for all y L. Thus ϕ b = ϕ. Lemma 3.20: Letϕ 1, ϕ 2 be two closure operators of a complete ADL L and x L. Then ϕ 1 ϕ 2 if and only if for any x L, ϕ 2 (x) = x implies ϕ 1 (x) = x. Proof: Suppose ϕ 1 ϕ 2, x L and ϕ 2 (x) = x. Then ϕ 1 (x) ϕ 2 (x) = x. Therefore ϕ 1 (x) = ϕ 1 (x) x = x. Conversely, suppose for any x L, ϕ 2 (x) = x implies ϕ 1 (x) = x. Since x m ϕ 2 (x), we get that ϕ 1 (x) = ϕ 1 (x m) ϕ 1 (ϕ 2 (x)) = ϕ 2 (x) by our assumption since ϕ 2 (ϕ 2 (x)) = ϕ 2 (x). 2014, IJMA. All Rights Reserved 122
5 4. DISTRIBUTIVE CLOSURE OPERATORS In this section, we introduce the concept of meet-distributive closure operator, join-distributive closure operator and distributive closure operator on complete almost distributive lattice and prove some important properties of these closure operators. Definition 4.1: An element x of a lattice X is said to be (1) meet-distributive if for any y, z X, x (y z) = (x y) (x z) (2) join-distributive if for any y, z X, x (y z) = (x y) (x z) (3) distributive if it is both meet-distributive and join-distributive. Theorem 4.2: Let L be a complete ADL with a maximal element m, then the element ϕ Φ(L) is meet-distributive if and only if the following condition is satisfied: If a, b L such that a m is closed under ϕ and a m, b m are incomparable then the element c = a b m is closed under ϕ. Proof: Suppose ϕ Φ (L) is meet-distributive. Let a, b L such that a m is closed under ϕ and b m is incomparable with a m. We prove that c = a b m is closed under ϕ. Since c = a b m, b m m and c m m, ϕ b, ϕ c are dual atoms of Φ(L) and ϕ (ϕ b ϕ c ) = (ϕ ϕ b ) (ϕ ϕ c ), then [ϕ (ϕ b ϕ cc )](c) = [(ϕ ϕ b ) (ϕ ϕ c )](c). Now, (ϕ ϕ b )(c) = ϕ(c) ϕ b (c) ϕ(a) ϕ b (b) = a b m = c. Clearly, c = c m (ϕ ϕ b )(c). Hence (ϕ ϕ b )(c) = c. Now, (ϕ ϕ cc )(c) = ϕ(c) ϕ c (c) = ϕ(c) c m = ϕ(c) c = c. Thus [(ϕ ϕ b ) (ϕ ϕ cc )](c) = c and hence c = [ϕ (ϕ b ϕ c )](c) = ϕ(c) ω(c) = ϕ(c). Therefore c is closed under ϕ. Conversely, assume the condition. Let ϕ 1, ϕ 2 Φ(L). Then, Clearly, (ϕ ϕ 1 ) (ϕ ϕ 2 ) ϕ (ϕ 1 ϕ 2 ). Let x L and suppose [(ϕ ϕ 1 ) (ϕ ϕ 2 )](x) = x. Then ϕ(x) ϕ 1 (x) = x and ϕ(x) ϕ 2 (x) = x. If ϕ(x), ϕ 1 (x) are not comparable, then by our assumption, we get that ϕ(x) = x and hence ϕ(x) ϕ 1 (x) = ϕ(x). Therefore, ϕ(x) ϕ 1 (x), which is a contradiction. Hence ϕ(x), ϕ 1 (x) are comparable. Similarly, ϕ(x), ϕ 2 (x) are comparable. If ϕ(x) ϕ 1 (x) (or ϕ(x) ϕ 2 (x)), then ϕ(x) = ϕ(x) ϕ 1 (x) = x. Now, [ϕ (ϕ 1 ϕ 2 )](x) = ϕ(x) (ϕ 1 ϕ 2 )(x) = (ϕ 1 ϕ 2 )(x) x = x. If ϕ 1 (x) ϕ(x) and ϕ 2 (x) ϕ(x), then ϕ 1 (x) = ϕ 2 (x) ϕ(x) = x. Similarly, ϕ 2 (x) = x. Hence (ϕ 1 ϕ 2 )(x) = x. Now, [ϕ (ϕ 1 ϕ 2 )](x) = ϕ(x) (ϕ 1 ϕ 2 )(x) = ϕ(x) x = x. Therefore in all the cases, we proved that [ϕ (ϕ 1 ϕ 2 )](x) = x. Hence ϕ (ϕ 1 ϕ 2 ) (ϕ ϕ 1 ) (ϕ ϕ 2 ). Therefore ϕ is meet-distributive. Lemma 4.3: If ϕ Φ(L) is join-distributive. Let a, b L such that a m and b m are incomparable and ϕ (a b) = a b m. Then ϕ ϕ a ω and ϕ ϕ b ω. Proof: Suppose ϕ ϕ a = ω and let c = a b m. Then ϕ(c) = c. Now, (ϕ a ϕ b )(c) = ϕ a (c) ϕ b (c) ϕ a (a m) ϕ b (b m) = a b m = c. Hence (ϕ a ϕ b )(c) = c. Therefore c = [ϕ (ϕ a ϕ b )](c) = [(ϕ ϕ a ) (ϕ ϕ b )](c) = (ϕ ϕ b )(c). Thus ϕ b (c) = c. Therefore c = b m or m. Hence a m and b m are comparable, which is a contradiction. Therefore ϕ ϕ a ω. Similarly, ϕ ϕ b ω. Theorem 4.4: Let L be a complete ADL with a maximal element m. Then the element ϕ Φ(L) is join-distributive if and only if the following condition is satisfied: If a, b L such that a m and b m are incomparable and if c = a b m is closed under ϕ, then a m and b m are closed under ϕ. Proof: Suppose ϕ Φ(L) is join-distributive. Let a, b L such that a m, b m are incomparable and c = a b m is closed under ϕ. Clearly, a m m and b m m. Thereforeϕ a, ϕ b are dual atoms of Φ(L). By above Lemma, (ϕ ϕ a ) = ϕ a. Thus (ϕ ϕ a )(a) = ϕ a (a) = a m and hence ϕ(a) = a m. Similarly, ϕ (b) = b m. Conversely, assume the condition. Let ϕ 1, ϕ 2 Φ(L). Then clearly, ϕ (ϕ 1 ϕ 2 ) (ϕ ϕ 1 ) (ϕ ϕ 2 ). Suppose x L and [ϕ (ϕ 1 ϕ 2 )](x) = x. Then ϕ(x) = x and ϕ 1 (x) ϕ 2 (x) = x. Suppose ϕ 1 (x), ϕ 2 (x) are comparable. If ϕ 1 (x) ϕ 2 (x), then ϕ 1 (x) = ϕ 1 (x) ϕ 2 (x). Hence (ϕ ϕ 1 ) (x) = x. Therefore [(ϕ ϕ 1 ) (ϕ ϕ 2 )](x) = (ϕ ϕ 1 )(x) (ϕ ϕ 2 )(x) = x. Now, suppose ϕ 1 (x), ϕ 2 (x) are incomparable. Since ϕ 1 (x) ϕ 2 (x) = x is closed under ϕ, we get ϕ(ϕ 1 (x)) = ϕ 1 (x) and ϕ(ϕ 2 (x)) = ϕ 2 (x). Since x m ϕ 1 (x) m, we get ϕ 1 (x) (ϕ ϕ 1 )(x) (ϕ ϕ 1 )( ϕ 1 (x)) = ϕ 1 (x). Since ϕ (ϕ 1 (x)) = ϕ 1 (x) = ϕ 1 (ϕ 1 (x)). Hence ϕ 1 (x) = (ϕ ϕ 1 )(x). Similarly, we can prove (ϕ ϕ 2 )(x) = ϕ 2 (x). Hence, we have [(ϕ ϕ 1 ) (ϕ ϕ 2 )](x) = (ϕ ϕ 1 )(x) (ϕ ϕ 2 )(x) = ϕ 1 (x) ϕ 2 (x) = x. Therefore (ϕ ϕ 1 ) (ϕ ϕ 2 ) ϕ (ϕ 1 ϕ 2 ). Thus ϕ is a join-distributive. 2014, IJMA. All Rights Reserved 123
6 Theorem 4.5: Let L be a complete ADL with a maximal element m. Then the element ϕ Φ(L) is distributive if and only if the following condition is satisfied: If a, b L such that a m and b m are incomparable, and if some element of the set {a m, b m, a b m} is closed under ϕ, then every element of the set is closed under ϕ. Proof: Suppose ϕ Φ(L) is distributive and x L. Let a, b L such that a m and b m are incomparable. Hence, by Theorems 4.2 and 4.4, we get that all elements of the set {a m, b m, a b m} are closed under ϕ, if any one of them is closed under ϕ. Conversely, assume the condition. Suppose a, b L such that a m and b m are incomparable and ϕ (a m) = a m, then by our assumption a b m is closed under ϕ. Therefore ϕ is meetdistributive. Suppose a b m is closed under ϕ, then by our assumption, a m and b m are closed under ϕ. Hence by above Theorem, we get that ϕ is join-distributive. Therefore ϕ is distributive. ACKNOWLEDGEMENT This Research is supported by U. G. C. Major Research Project Ref. No /2012(SR), REFERENCES [1] Grätzer, G.: Lattice Theory: Foundation. Birkhäuser Verlag, Basel, XXIX + 613P. ISBN: [2] Jose Morgado.: Note on the Distributive Closure Operators of a Complete Lattice, Portugaliae Mathematica, 23(1964), [3] Rao, G. C., Berhanu Assaye and M. V. Ratnamani.: Heyting Almost Distributive Lattices, Southeast Asian Bulletin of Mathematics, 27(2004), [4] Rao, G. C. and Nanaji Rao, G.: Pseudo-Complementation on Almost Distributive Lattices, Southeast Asian Bulletin of Mathematics, 24,(2000), [5] Rao, G. C. and Ravi Kumar. S.: Normal Almost Distributive Lattices, Southeast Asian Bulletin of Mathematics, 32(2008), [6] Rao, G. C. and Venugopalam Undurthi.: Complete Almost Distributive Lattices (Accepted for Publication in Asian European Journal of Mathematics). [7] Swamy, U. M., Rao, G. C.: Almost Distributive Lattices, J. Aust. Math. Soc. (Series-A), 31(1981), [8] Swamy, U. M., Rao, G. C. and Nanaji Rao, G.: Stone Almost Distributive Lattices, Southeast Asian Bulletin of Mathematics, 27(2003), [9] Szasz, G.: Introduction to Lattice Theory, Academic Press New York, (1963). Source of support: U. G. C. Major Research Project, India, Conflict of interest: None Declared [Copy right 2014 This is an Open Access article distributed under the terms of the International Journal of Mathematical Archive (IJMA), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.] 2014, IJMA. All Rights Reserved 124
Pattern Avoidance in Poset Permutations
Pattern Avoidance in Poset Permutations Sam Hopkins and Morgan Weiler Massachusetts Institute of Technology and University of California, Berkeley Permutation Patterns, Paris; July 5th, 2013 1 Definitions
More informationKY FAN S INEQUALITIES FOR VECTOR-VALUED MULTIFUNCTIONS IN TOPOLOGICAL ORDERED SPACES
Fixed Point They, 15(2014), No. 1, 253-264 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html KY FAN S INEQUALITIES FOR VECTOR-VALUED MULTIFUNCTIONS IN TOPOLOGICAL ORDERED SPACES NGUYEN THE VINH AND PHAM
More informationContinuity of the Norm of a Composition Operator
Integr. equ. oper. theory 45 (003) 35 358 0378-60X/03035-8 $.50+0.0/0 c 003 Birkhäuser Verlag Basel/Switzerl Integral Equations Operator Theory Continuity of the Norm of a Composition Operator David B.
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More informationResearch Article Some New Sets and Topologies in Ideal Topological Spaces
Chinese Mathematics Volume 2013, Article ID 973608, 6 pages http://dx.doi.org/10.1155/2013/973608 Research Article Some New Sets and Topologies in Ideal Topological Spaces R. Manoharan 1 and P. Thangavelu
More informationKy Fan minimax inequalities for set-valued mappings
RESEARCH Ky Fan minimax inequalities for set-valued mappings Yu Zhang 1* and Sheng-Jie Li 1,2 Open Access * Correspondence: zhangyu198606@sina.com 1 College of Mathematics and Statistics, Chongqing University,
More informationLEFT ZEROID AND RIGHT ZEROID ELEMENTS OF SEMIRINGS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 385-389 DOI: 10.7251/BIMVI1802385R Former BULLETIN
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen, Lewis H. Liu, Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 7, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationPATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE
PATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE SAM HOPKINS AND MORGAN WEILER Abstract. We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance
More informationMonotone Comparative Statics 1
John Nachbar Washington University March 27, 2016 1 Overview Monotone Comparative Statics 1 Given an optimization problem indexed by some parameter θ, comparative statics seeks a qualitative understanding
More informationSOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationCongruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017), Article 17.4.3 Congruences Modulo Small Powers of 3 for Partitions into Odd Designated Summs B. Hemanthkumar Department of Mathematics M. S. Ramaiah
More information1 Modal logic. 2 Tableaux in modal logic
1 Modal logic Exercise 1.1: Let us have the set of worlds W = {w 0, w 1, w 2 }, an accessibility relation S = {(w 0, w 1 ), (w 0, w 2 )} and let w 1 p 2. Which of the following statements hold? a) w 0
More informationInternational Journal of Combinatorial Optimization Problems and Informatics. E-ISSN:
International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@ijcopi.org International Journal of Combinatorial Optimization Problems and Informatics México Karim,
More informationResearch Article n-digit Benford Converges to Benford
International Mathematics and Mathematical Sciences Volume 2015, Article ID 123816, 4 pages http://dx.doi.org/10.1155/2015/123816 Research Article n-digit Benford Converges to Benford Azar Khosravani and
More informationA NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA
A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied
More informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
More informationSTRATEGY AND COMPLEXITY OF THE GAME OF SQUARES
STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white
More informationSimple permutations and pattern restricted permutations
Simple permutations and pattern restricted permutations M.H. Albert and M.D. Atkinson Department of Computer Science University of Otago, Dunedin, New Zealand. Abstract A simple permutation is one that
More informationFinite homomorphism-homogeneous permutations via edge colourings of chains
Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.
More informationWilson s Theorem and Fermat s Theorem
Wilson s Theorem and Fermat s Theorem 7-27-2006 Wilson s theorem says that p is prime if and only if (p 1)! = 1 (mod p). Fermat s theorem says that if p is prime and p a, then a p 1 = 1 (mod p). Wilson
More informationSOLUTIONS FOR PROBLEM SET 4
SOLUTIONS FOR PROBLEM SET 4 A. A certain integer a gives a remainder of 1 when divided by 2. What can you say about the remainder that a gives when divided by 8? SOLUTION. Let r be the remainder that a
More informationarxiv: v2 [cs.cc] 18 Mar 2013
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete Daniel Grier arxiv:1209.1750v2 [cs.cc] 18 Mar 2013 University of South Carolina grierd@email.sc.edu Abstract. A poset game is a
More informationCutting a pie is not a piece of cake
MPRA Munich Personal RePEc Archive Cutting a pie is not a piece of cake Julius B. Barbanel and Steven J. Brams and Walter Stromquist New York University December 2008 Online at http://mpra.ub.uni-muenchen.de/12772/
More informationCharacterization of regular semigroup through interval valued fuzzy ideals. N. Thillaigovindan, V. Chinnadurai, S. Coumaressane
Annals of Fuzzy Mathematics and Informatics Volume 11, No. 5, (May 2016), pp. 769 781 ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co.
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen and Lewis H. Liu Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationA Complete Characterization of Maximal Symmetric Difference-Free families on {1, n}.
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 8-2006 A Complete Characterization of Maximal Symmetric Difference-Free families on
More informationEvacuation and a Geometric Construction for Fibonacci Tableaux
Evacuation and a Geometric Construction for Fibonacci Tableaux Kendra Killpatrick Pepperdine University 24255 Pacific Coast Highway Malibu, CA 90263-4321 Kendra.Killpatrick@pepperdine.edu August 25, 2004
More informationarxiv:math/ v1 [math.cv] 12 Dec 2005
arxiv:math/0512241v1 [math.cv] 12 Dec 2005 The pluri-fine topology is locally connected Said El Marzguioui and Jan Wiegerinck November 1, 2018 Abstract We prove that the pluri-fine topology on any open
More informationON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)
t m Mathematical Publications DOI: 10.2478/tmmp-2014-0002 Tatra Mt. Math. Publ. 58 (2014), 13 22 ON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationSOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES
Discrete Mathematics, Algorithms and Applications Vol 4, No 3 (2012) 1250022 (8 pages) c World Scientific Publishing Company DOI: 101142/S179383091250022X SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN
More informationBAND SURGERY ON KNOTS AND LINKS, III
BAND SURGERY ON KNOTS AND LINKS, III TAIZO KANENOBU Abstract. We give two criteria of links concerning a band surgery: The first one is a condition on the determinants of links which are related by a band
More informationSome constructions of mutually orthogonal latin squares and superimposed codes
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2012 Some constructions of mutually orthogonal
More informationA Complete Approximation Theory for Weighted Transition Systems
A Complete Approximation Theory for Weighted Transition Systems December 1, 2015 Peter Christoffersen Mikkel Hansen Mathias R. Pedersen Radu Mardare Kim G. Larsen Department of Computer Science Aalborg
More informationMeasure Preserving Isomorphisms
Gen. Math. Notes, Vol. 29, No., July 205, pp.-5 ISSN 229-784; Copyright c ICSRS Publication, 205 www.i-csrs.org Available free online at http://www.geman.in Measure Preserving Isomorphisms M. Gheytaran
More informationNON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday
NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As
More informationTopology and its Applications
Topology and its Applications 157 (2010) 1541 1547 Contents lists available at ScienceDirect Topology and its Applications www.elsevier.com/locate/topol On a core concept of Arhangel skiĭ Franklin D. Tall
More informationFinal exam. Question Points Score. Total: 150
MATH 11200/20 Final exam DECEMBER 9, 2016 ALAN CHANG Please present your solutions clearly and in an organized way Answer the questions in the space provided on the question sheets If you run out of room
More informationCardinality of Accumulation Points of Infinite Sets
International Mathematical Forum, Vol. 11, 2016, no. 11, 539-546 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2016.6224 Cardinality of Accumulation Points of Infinite Sets A. Kalapodi CTI
More informationMath 319 Problem Set #7 Solution 18 April 2002
Math 319 Problem Set #7 Solution 18 April 2002 1. ( 2.4, problem 9) Show that if x 2 1 (mod m) and x / ±1 (mod m) then 1 < (x 1, m) < m and 1 < (x + 1, m) < m. Proof: From x 2 1 (mod m) we get m (x 2 1).
More informationThe Hex game and its mathematical side
The Hex game and its mathematical side Antonín Procházka Laboratoire de Mathématiques de Besançon Université Franche-Comté Lycée Jules Haag, 19 mars 2013 Brief history : HEX was invented in 1942
More informationCommuting Graphs on Dihedral Group
Commuting Graphs on Dihedral Group T. Tamizh Chelvama, K. Selvakumar and S. Raja Department of Mathematics, Manonmanian Sundaranar, University Tirunelveli 67 01, Tamil Nadu, India Tamche_ 59@yahoo.co.in,
More informationAN EXAMPLE OF A COMMUTATIVE BASIC ALGEBRA WHICH IS NOT AN MV-ALGEBRA
ao DOI: 10.2478/s12175-010-0003-0 Math. Slovaca 60 (2010), No. 2, 171 178 AN EXAMPLE OF A COMMUTATIVE BASIC ALGEBRA WHICH IS NOT AN MV-ALGEBRA Michal Botur (Communicated by Anatolij Dvurečenskij ) ABSTRACT.
More informationCombinatorics in the group of parity alternating permutations
Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi
More informationPerfect Domination for Bishops, Kings and Rooks Graphs On Square Chessboard
Annals of Pure and Applied Mathematics Vol. 1x, No. x, 201x, xx-xx ISSN: 2279-087X (P), 2279-0888(online) Published on 6 August 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v18n1a8
More informationMinimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field
Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field Gretchen L. Matthews and Justin D. Peachey Abstract. The norm-trace function field is a generalization
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationDVA325 Formal Languages, Automata and Models of Computation (FABER)
DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November
More informationWe like to depict a vector field by drawing the outputs as vectors with their tails at the input (see below).
Math 55 - Vector Calculus II Notes 4. Vector Fields A function F is a vector field on a subset S of R n if F is a function from S to R n. particular, this means that F(x, x,..., x n ) = f (x, x,..., x
More informationStrongly nonlinear elliptic problem without growth condition
2002-Fez conference on Partial Differential Equations, Electronic Journal of Differential Equations, Conference 09, 2002, pp 41 47. http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu
More informationOn Information Theoretic Interference Games With More Than Two Users
On Information Theoretic Interference Games With More Than Two Users Randall A. Berry and Suvarup Saha Dept. of EECS Northwestern University e-ma: rberry@eecs.northwestern.edu suvarups@u.northwestern.edu
More informationSOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #G04 SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS Vincent D. Blondel Department of Mathematical Engineering, Université catholique
More informationGreedy Flipping of Pancakes and Burnt Pancakes
Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,
More informationVariations on Instant Insanity
Variations on Instant Insanity Erik D. Demaine 1, Martin L. Demaine 1, Sarah Eisenstat 1, Thomas D. Morgan 2, and Ryuhei Uehara 3 1 MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar
More informationA GRAPH THEORETICAL APPROACH TO SOLVING SCRAMBLE SQUARES PUZZLES. 1. Introduction
GRPH THEORETICL PPROCH TO SOLVING SCRMLE SQURES PUZZLES SRH MSON ND MLI ZHNG bstract. Scramble Squares puzzle is made up of nine square pieces such that each edge of each piece contains half of an image.
More informationDEPARTMENT OF ECONOMICS WORKING PAPER SERIES. Stable Networks and Convex Payoffs. Robert P. Gilles Virginia Tech University
DEPARTMENT OF ECONOMICS WORKING PAPER SERIES Stable Networks and Convex Payoffs Robert P. Gilles Virginia Tech University Sudipta Sarangi Louisiana State University Working Paper 2005-13 http://www.bus.lsu.edu/economics/papers/pap05_13.pdf
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More informationThe Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (2017), pp. 1091-1101 Research India Publications http://www.ripublication.com The Classification of Quadratic Rook Polynomials
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences
More informationDomination game and minimal edge cuts
Domination game and minimal edge cuts Sandi Klavžar a,b,c Douglas F. Rall d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia b Faculty of Natural Sciences and Mathematics, University
More informationRegular Hexagon Cover for. Isoperimetric Triangles
Applied Mathematical Sciences, Vol. 7, 2013, no. 31, 1545-1550 HIKARI Ltd, www.m-hikari.com Regular Hexagon over for Isoperimetric Triangles anyat Sroysang epartment of Mathematics and Statistics, Faculty
More informationA REMARK ON A PAPER OF LUCA AND WALSH 1. Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China. Min Tang 2.
#A40 INTEGERS 11 (2011) A REMARK ON A PAPER OF LUCA AND WALSH 1 Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China Min Tang 2 Department of Mathematics, Anhui Normal University,
More informationOnline Call Control in Cellular Networks Revisited
Online Call Control in Cellular Networks Revisited Yong Zhang Francis Y.L. Chin Hing-Fung Ting Joseph Wun-Tat Chan Xin Han Ka-Cheong Lam Abstract Wireless Communication Networks based on Frequency Division
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationTHE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS
THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master
More informationMa/CS 6a Class 16: Permutations
Ma/CS 6a Class 6: Permutations By Adam Sheffer The 5 Puzzle Problem. Start with the configuration on the left and move the tiles to obtain the configuration on the right. The 5 Puzzle (cont.) The game
More informationA Survey on Supermodular Games
A Survey on Supermodular Games Ashiqur R. KhudaBukhsh December 27, 2006 Abstract Supermodular games are an interesting class of games that exhibits strategic complementarity. There are several compelling
More informationNotes for Recitation 3
6.042/18.062J Mathematics for Computer Science September 17, 2010 Tom Leighton, Marten van Dijk Notes for Recitation 3 1 State Machines Recall from Lecture 3 (9/16) that an invariant is a property of a
More informationALGEBRA: Chapter I: QUESTION BANK
1 ALGEBRA: Chapter I: QUESTION BANK Elements of Number Theory Congruence One mark questions: 1 Define divisibility 2 If a b then prove that a kb k Z 3 If a b b c then PT a/c 4 If a b are two non zero integers
More informationAnalysis on the Properties of a Permutation Group
International Journal of Theoretical and Applied Mathematics 2017; 3(1): 19-24 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20170301.13 Analysis on the Properties of a Permutation
More informationDegree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS
Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS Author: MD.HASIRUL ISLAM NAZIR BASHIR Supervisor: MARCUS NILSSON Date: 2012-06-15 Subject: Mathematics and Modeling Level:
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationand problem sheet 7
1-18 and 15-151 problem sheet 7 Solutions to the following five exercises and optional bonus problem are to be submitted through gradescope by 11:30PM on Friday nd November 018. Problem 1 Let A N + and
More informationRadio Coloring Phenomena and Its Applications
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 3, Issue 4, April 2015, PP 34-38 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Radio Coloring
More information132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers
132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers arxiv:math/0205206v1 [math.co] 19 May 2002 Eric S. Egge Department of Mathematics Gettysburg College Gettysburg, PA 17325
More informationFunctions of several variables
Chapter 6 Functions of several variables 6.1 Limits and continuity Definition 6.1 (Euclidean distance). Given two points P (x 1, y 1 ) and Q(x, y ) on the plane, we define their distance by the formula
More informationRESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel
RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined
More informationFair Stable Sets of Simple Games
Fair Stable Sets of Simple Games Eduard Talamàs June 4, 2017 Abstract Simple games are abstract representations of voting systems and other group-decision procedures. A stable set or von Neumann-Morgenstern
More informationPERMUTATIONS AS PRODUCT OF PARALLEL TRANSPOSITIONS *
SIAM J. DISCRETE MATH. Vol. 25, No. 3, pp. 1412 1417 2011 Society for Industrial and Applied Mathematics PERMUTATIONS AS PRODUCT OF PARALLEL TRANSPOSITIONS * CHASE ALBERT, CHI-KWONG LI, GILBERT STRANG,
More informationECE380 Digital Logic
ECE38 Digital Logic Introduction Dr. D. J. Jackson Lecture - Digital hardware Logic circuits are used to build computer hardware as well as other products (digital hardware) Late 96 s and early 97 s saw
More informationTilings with T and Skew Tetrominoes
Quercus: Linfield Journal of Undergraduate Research Volume 1 Article 3 10-8-2012 Tilings with T and Skew Tetrominoes Cynthia Lester Linfield College Follow this and additional works at: http://digitalcommons.linfield.edu/quercus
More informationDEGRADED broadcast channels were first studied by
4296 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 9, SEPTEMBER 2008 Optimal Transmission Strategy Explicit Capacity Region for Broadcast Z Channels Bike Xie, Student Member, IEEE, Miguel Griot,
More informationSets. Definition A set is an unordered collection of objects called elements or members of the set.
Sets Definition A set is an unordered collection of objects called elements or members of the set. Sets Definition A set is an unordered collection of objects called elements or members of the set. Examples:
More informationON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey
ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey Shah [1] and Bruckner [2] have considered the problem
More informationSolutions for the Practice Questions
Solutions for the Practice Questions Question 1. Find all solutions to the congruence 13x 12 (mod 35). Also, answer the following questions about the solutions to the above congruence. Are there solutions
More informationAxiom A-1: To every angle there corresponds a unique, real number, 0 < < 180.
Axiom A-1: To every angle there corresponds a unique, real number, 0 < < 180. We denote the measure of ABC by m ABC. (Temporary Definition): A point D lies in the interior of ABC iff there exists a segment
More informationComparative Analysis of PID, SMC, SMC with PID Controller for Speed Control of DC Motor
International ournal for Modern Trends in Science and Technology Volume: 02, Issue No: 11, November 2016 http://www.ijmtst.com ISSN: 2455-3778 Comparative Analysis of PID, SMC, SMC with PID Controller
More informationOn uniquely k-determined permutations
Discrete Mathematics 308 (2008) 1500 1507 www.elsevier.com/locate/disc On uniquely k-determined permutations Sergey Avgustinovich a, Sergey Kitaev b a Sobolev Institute of Mathematics, Acad. Koptyug prospect
More informationarxiv: v1 [math.co] 7 Aug 2012
arxiv:1208.1532v1 [math.co] 7 Aug 2012 Methods of computing deque sortable permutations given complete and incomplete information Dan Denton Version 1.04 dated 3 June 2012 (with additional figures dated
More informationPD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 7 No. 1 (2018), pp. 37-50. c 2018 University of Isfahan www.combinatorics.ir www.ui.ac.ir PD-SETS FOR CODES RELATED
More informationLecture 2. 1 Nondeterministic Communication Complexity
Communication Complexity 16:198:671 1/26/10 Lecture 2 Lecturer: Troy Lee Scribe: Luke Friedman 1 Nondeterministic Communication Complexity 1.1 Review D(f): The minimum over all deterministic protocols
More informationNoisy Index Coding with Quadrature Amplitude Modulation (QAM)
Noisy Index Coding with Quadrature Amplitude Modulation (QAM) Anjana A. Mahesh and B Sundar Rajan, arxiv:1510.08803v1 [cs.it] 29 Oct 2015 Abstract This paper discusses noisy index coding problem over Gaussian
More informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More informationMATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.
MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations
More information18 Completeness and Compactness of First-Order Tableaux
CS 486: Applied Logic Lecture 18, March 27, 2003 18 Completeness and Compactness of First-Order Tableaux 18.1 Completeness Proving the completeness of a first-order calculus gives us Gödel s famous completeness
More informationINFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES
INFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES Ghulam Chaudhry and Jennifer Seberry School of IT and Computer Science, The University of Wollongong, Wollongong, NSW 2522, AUSTRALIA We establish
More information