Laurence Boxer and Ismet KARACA
|
|
- Clara Newton
- 6 years ago
- Views:
Transcription
1 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. 1. Introduction The main purpose of Digital Topology is the study of topological properties of discrete objects which are obtained digitizing continuous objects. Digital Topology plays a very important role in computer vision, image processing, and computer graphics. The digital fundamental group of a discrete object was introduced in Digital Topology by Kong [13]. Boxer [2] shows how classical methods of Algebraic Topology may be used to construct the digital fundamental group. Knowledge of the digital fundamental group is a very important tool for Image Analysis. A general algorithm to decide whether two discrete objects have isomorphic fundamental groups would be a very powerful tool for Image Analysis. The paper [17] of Stout makes a contribution to this problem. The digital covering space is an important tool for computing digital fundamental groups of digital images. In [7] Han has introduced a digital covering space and given some properties of it. Boxer [5] develops further the topic of digital covering space by deriving digital analogs of classical results of Algebraic Topology concerning the existence and properties of digital universal covering spaces. We use the fundamental group of a digital image as a tool for studying digital covering spaces. In this paper we show the digital covering spaces are classified by the conjugacy class corresponding to a digital covering space. 2. Preliminaries Let Z be the set of integers. Then Z n is the set of lattice points in the n-dimensional Euclidean space. A (binary) digital image is a subset of Z n with an adjacency relation. A variety of adjacency relations are used in the study of digital images. Some of the betterknown adjacencies are the following Mathematics Subject Classification. Primary 55N35, 68R10, 68U05, 68U10. Key words and phrases. digital image, digital topology, homotopy, covering space. 1 Typeset by AMS-TEX
2 2 LAURENCE BOXER AND ISMET KARACA For a positive integer l with 1 l n and distinct two points p and q are c l -adjacent [4] if p = (p 1, p 2,..., p n ), q = (q 1, q 2,..., q n ) Z n, (1) there are at most l indices i such that p i q i = 1 and (2) for all other indices j such that p i q i 1, p j = q j. It is common to denote an adjacency relation κ by the number of κ-adjacent points of a given point. For example, in Z we have c 1 = 2; in Z 2 we have c 1 = 4 and c 2 = 8; in Z 3 we have c 1 = 6, c 2 = 18, and c 3 = 26. More general adjacency relations are studied in [10]. A κ-neighbor of a lattice point p is κ-adjacent to p. Let κ be an adjacency relation defined on Z n. A digital image X Z n is κ-connected [10] if and only if for every pair of different points x, y X, there is a set {x 0, x 1,..., x r } of points of a digital image X such that x = x 0, y = x r and x i and x i+1 are κ-neighbors where i = 0, 1,..., r 1. A κ-component of a digital image X is a maximal κ-connected subset of X. Let a, b Z with a < b. A digital interval [1] is a set of the form [a, b] Z = {z Z a z b}. Let X Z n 0 and Y Z n 1 be digital images with κ 0 -adjacency and κ 1 -adjacency respectively. A function f : X Y is said to be (κ 0, κ 1 )-continuous ([2], [16]) if for every κ 0 -connected subset U of X, f(u) is a κ 1 -connected subset of Y. We say that such a function is digitally continuous. Proposition 2.1 [2], [16]. Let X Z n 0 and Y Z n 1 be digital images with κ 0 -adjacency and κ 1 -adjacency respectively. Then the function f : X Y is (κ 0, κ 1 )-continuous if and only if for every κ 0 -adjacent points {x 0, x 1 } of X, either f(x 0 ) = f(x 1 ) or f(x 0 ) and f(x 1 ) are κ 1 -adjacent in Y. By a digital κ-path from x to y in a digital image X, we mean a (2, κ)-continuous function f : [0, m] Z X such that f(0) = x and f(m) = y. If f(0) = f(m) then the κ-path is said to be closed, and the function f is called a κ-loop. Let f : [0, m 1] Z X be a (2, κ)-continuous function such that f(i) and f(j) are κ-adjacent if and only if j = i ± 1 mod m. Then the set f([0, m 1] Z ) is a simple closed κ-curve. Let X Z n 0 and Y Z n 1 be digital images with κ 0 -adjacency and κ 1 -adjacency respectively. A function f : X Y is (κ 0, κ 1 )-homeomorphism [1] if f is (κ 0, κ 1 )-continuous and bijective and further f 1 : Y X is (κ 1, κ 0 )-continuous. In [5], Boxer suggests using the terminology isomorphic digital images rather than homeomorphic images. Throughout this paper we will prefer isomorphic to homeomorphic. Let X Z n 0 and Y Z n 1 be digital images with κ 0 -adjacency and κ 1 -adjacency respectively. Two (κ 0, κ 1 )-continuous functions f, g : X Y are said to be digitally (κ 0, κ 1 )- homotopic in Y [2] if there is a positive integer m and a function H : X [0, m] Z Y such that (1) for all x X, H(x, 0) = f(x) and H(x, m) = g(x),
3 THE CLASSIFICATION OF DIGITAL COVERING SPACES 3 (2) for all x X, the induced function H x : [0, m] Z Y defined by H x (t) = H(x, t) for all t [0, m] Z, is (2, κ 1 )-continuous, and (3) for all t [0, m] Z, the induced function H t : X Y defined by is (κ 0, κ 1 )-continuous. H t (x) = H(x, t) for all x X, We say that the function H is a digital (κ 0, κ 1 )-homotopy between f and g. In [2] Boxer shows that the digital (κ 0, κ 1 )-homotopy relation is an equivalence relation among digitally continuous functions f : (X, κ 0 ) (Y, κ 1 ). A (κ 0, κ 1 )-continuous function f : X Y is a (κ 0, κ 1 )-homotopy equivalence ([3], [6]) if there exists a (κ 1, κ 0 )-continuous function g : Y X such that g f is (κ 0, κ 0 )-homotopic to the identity function 1 X and f g is (κ 1, κ 1 )-homotopic to the identity function 1 Y. The function g is said to be a (κ 1, κ 0 )-homotopy inverse for the function f. Two digital images that are (κ 0, κ 1 )-homotopy equivalent are said to have the same (κ 0, κ 1 )-homotopy type. A digital image (X, κ) is said to be κ-contractible [1] if its identity map is (κ, κ)-homotopic to a constant function c for some c X where the constant function c : X X is defined by c(x) = c for all x X. We say that a (κ 0, κ 1 )-continuous function f : X Y is (κ 0, κ 1 )-nullhomotopic [1] if f is (κ 0, κ 1 )-homotopic to a constant function c in Y. A pointed digital image is a pair (X, x 0 ) where (X, κ) is a digital image and x 0 X. Let = A X. Assume κ-adjacency for A and X. A is called a κ-retract of X [2] if and only if there is a κ-continuous function r : X A such that r(a) = a for all a A. The function r is called a κ-retraction of X onto A. Let i : A X be the inclusion function. We say that A is a κ-deformation retract of X [3] if there exists a κ-homotopy H : X [0, m] Z X between the identity map 1 X and i r, for some κ-retraction r of X onto A. If f : [0, m 1 ] Z X and g : [0, m 2 ] Z X are digital κ-paths with f(m 1 ) = g(0), then define the product (f g) : [0, m 1 + m 2 ] Z X [11] by { f(t) if t [0, m1 ] Z ; (f g)(t) = g(t m 1 ) if t [m 1, m 1 + m 2 ] Z. The restriction of loop classes to loops defined on the same digital interval is undesirable. We have the following notion of trivial extension which allows a loop to stretch and remain in the same digital class. Let f and f be κ-loops in a pointed digital image (X, x 0 ). We say f is a trivial extension of f [2] if there are sets of κ-paths {f 1, f 2,..., f r } and {F 1, F 2,..., F p } in X such that (1) r p; (2) f = f 1 f 2 f r ; (3) f = F 1 F 2 F p ; (4) There are indices 1 i 1 < i 2 < < i r p such that F ij = f j, 1 j r and i / {i 1, i 2,..., i r } implies F i is a trivial loop (a constant function).
4 4 LAURENCE BOXER AND ISMET KARACA Two loops f 0, f 1 with the same base point x 0 X belong to the same loop class [f] X [3] if they have trivial extensions that can be joined by a homotopy that keeps the endpoints fixed. If we would use the weaker assumption that the homotopy is loop-preserving instead of the assumption that the homotopy keeps the endpoints fixed, then all digital fundamental groups would be abelian. This contradicts Theorem 6.1 of [5] (which corrects the proof of the same assertion in [7] and gives an example of a non-abelian digital fundamental group). Therefore we use homotopies that keep the endpoints fixed. Define π κ 1 (X, x 0 ) to be the set of digital homotopy classes of κ-loops [f] X in X with base point x 0. Theorem 2.2. [2] π κ 1 (X, x 0 ) is a group under the product operation defined by [f] X [g] X = [f g] X. Proposition 2.3. [3] Let x 0 X. If a pointed digital image (X, x 0 ) is κ-contractible, then π κ 1 (X, x 0 ) is a trivial group. Let (E, κ) be a digital image and let ε N. The κ-neighborhood [7] of e 0 E with radius ε is the set N κ (e 0, ε) = {e E l κ (e 0, e) ε} {e 0 }, where l κ (e 0, e) is the length of a shortest κ-path from e 0 to e in E. The definition of digital covering maps in [7] was simplified in [5] as follows. Proposition 2.4. [5] Let (E, κ 0 ) and (B, κ 1 ) be digital images. Let p : E B be a (κ 0, κ 1 )-continuous surjection. Then the map p is a (κ 0, κ 1 )-covering map if and only if for each b B there exists an index set M such that (1) p 1 (N κ1 (b, 1)) = i M N κ0 (e i, 1) with e i p 1 (b); (2) if i, j M, i j, then N κ0 (e i, 1) N κ0 (e j, 1) = ; and (3) the restriction map p Nκ0 (e i,1) : N κ0 (e i, 1) N κ1 (b, 1) is a (κ 0, κ 1 )-isomorphism for all i M. Definition 2.5. [8] For n N, a (κ 0, κ 1 )-covering (E, p, B) is a radius n local isomorphism if the restriction map p Nκ0 (e i,n) : N κ0 (e i, n) N κ1 (b, n) is a (κ 0, κ 1 )-isomorphism for all i M. Given a digital simple closed κ-curve S = {s i } m 1 i=0 such that s i and s j are κ-adjacent if and only if either j i + 1 mod m or j i 1 mod m, the function p : Z S defined by p(z) = s z mod m is a (2, κ)-covering [7]. Every covering is a radius 1 local isomorphism, by (3) of Proposition 2.4 [5]. However, if S Z 2 is an 8-curve of 4 points, then the map p is not a radius 2 local isomorphism [5]. A digital version of the notion of lifting from algebraic topology often yields efficient calculation of digital fundamental groups. Let (E, κ 0 ), (B, κ 1 ), and (X, κ 2 ) be digital images, let p : E B be a (κ 0, κ 1 )-covering map, and let f : X B be (κ 2, κ 1 )-continuous. A lifting of f with respect to p is a (κ 2, κ 0 )-continuous function f : X E such that p f = f (see [7]).
5 THE CLASSIFICATION OF DIGITAL COVERING SPACES 5 Theorem 2.6. [7] Let (E, κ 0 ) be a digital image and e 0 E. Let (B, κ 1 ) be a digital image and b 0 B. Let p : E B be a (κ 0, κ 1 )-covering map such that p(e 0 ) = b 0. Then any κ-path f[0, m] Z B beginning at b 0 has a unique lifting to a path f in E beginning at e 0. Theorem 2.7. [8] Let (E, κ 0 ) be a digital image and e 0 E. Let (B, κ 1 ) be a digital image and b 0 B. Let p : E B be a (κ 0, κ 1 )-covering map such that p(e 0 ) = b 0. Suppose that p is a radius 2 local isomorphism. For κ 0 -paths g 0, g 1 : [0, m] Z E starting at e 0, if there is a κ 1 -homotopy in B from p g 0 to p g 1 that holds the endpoints fixed, then g 0 (m) = g 1 (m), and there is a κ 0 -homotopy in E from g 0 to g 1 that holds the endpoints fixed. A digital pointed image (X, x 0 ) is said to be simply κ-connected [7] if π1 κ (X, x 0 ) is a trivial group. In [2] Boxer proves that if f : (X, x 0 ) (Y, y 0 ) is a (κ 0, κ 1 )-continuous map of pointed digital images, then f : π κ 0 1 (X, x 0) π κ 1 1 (Y, y 0), defined by f ([g]) = [f g], is a group homomorphism. From Theorem 2.7, we immediately have the following result; Corollary 2.8. [5] Let (E, κ 0 ) be a digital image and e 0 E. Let (B, κ 1 ) be a digital image and b 0 B. Let p : E B be a (κ 0, κ 1 )-covering map such that p(e 0 ) = b 0. Suppose that p is a radius 2 local isomorphism. Then the induced homomorphism p : π κ 0 1 (E, e 0) π κ 1 1 (B, b 0) is a monomorphism. In [7] Han attempts to obtain the digital fundamental groups of non-contractible digital simple closed curves. However, there are major holes in the proof of his claim. Boxer [5] repairs these errors. Let s state Han s claim: Theorem 2.9. [7] π 8 1(MSC 8 ) is isomorphic to 6Z as a group where MSC 8 Z 2 is a simple closed 8-curve of 6 points. 3. The Classification of Digital Covering Spaces The results of this section are based on analogs of Euclidean algebraic topology, as found in section 5.6 of [14]. The following theorem describes an algebraic condition that is sufficient for existence of a lifting of a function. Practically all of the applications we have encountered have involved necessary algebraic conditions for the existence of certain digital topological features. Theorem 3.1. [5] Let ((E, e 0 ), κ 0 ) and ((B, b 0 ), κ 1 ) be pointed digital images. Let p : (E, e 0 ) (B, b 0 ) be a pointed (κ 0, κ 1 )-covering map. Let X be a κ 2 -connected digital image, x 0 X. Let φ : (X, x 0 ) (B, b 0 ) be a (κ 2, κ 1 ) continuous map of pointed digital images. Consider the following statements. (1) There exists a lifting φ : (X, x 0 ) (E, e 0 ) of φ with respect to p. (2) φ (π κ 2 1 (X, x 0)) p (π κ 0 1 (E, e 0)). Then (1) implies (2). Further, if p is a radius 2 local isomorphism, then (2) implies (1). An example of the use of Theorem 3.1 is the following.
6 6 LAURENCE BOXER AND ISMET KARACA Corollary 3.2. Let ((E, e 0 ), κ 0 ) and ((B, b 0 ), κ 1 ) be pointed digital images. Let p : (E, e 0 ) (B, b 0 ) be a pointed (κ 0, κ 1 )-covering map that is a radius 2 local isomorphism. Suppose (X, x 0 ) is a pointed digital image such that π κ 2 1 (X, x 0) is a trivial group. Then every (κ 2, κ 1 )-continuous pointed map φ : (X, x 0 ) (B, b 0 ) has a lifting φ : (X, x 0 ) (E, e 0 ) with respect to φ. Proof. Since π κ 2 1 (X, x 0) is a trivial group, statement (2) of Theorem 3.1 is realized for any map φ satisfying the hypotheses. The conclusion follows from statement (1) of Theorem 3.1. An obvious question that must be considered is how the choice of the base point b 0 in a digital image B affects the digital fundamental group. Clearly, π1 κ (B, b 0 ) can carry information only on the κ-component of B containing b 0. Let b 1 be another point of the κ-component of B. Select a κ-path α : [0, m] Z B with α(0) = b 1 and α(m) = b 0. We use the notation [2] α 1 for the path that reverses α: α 1 (t) = α(m t) for t [0, m] Z. Given a κ-loop β at b 1, we produce a κ-loop at b 0 by taking composition α 1 β α. Define a function h α : π κ 1 (B, b 1 ) π κ 1 (B, b 0 ) by h α ([β]) = [α 1 β α]. Then we immediately have the following results. Lemma 3.3. (1) h α is an isomorphism of groups. (2) If α is another κ-path from b 0 to b 1 which is digitally homotopic to α via a digital homotopy fixing the end points, then h α = h α. (3) (h α ) 1 = h α 1. Proof. This is elementary and is left to the reader. Note that if we take b 1 = b 0, we can write h α ([β]) = [α 1 ][β][α] and h α becomes an inner automorphism of π κ 1 (B, b 0 ). Of course, if π κ 1 (B, x 0 ) is abelian, then any such isomorphism is the identity. Now suppose p : E B is a digital (κ 0, κ 1 )-covering map. Theorem 3.1 was concerned with the image of the homomorphism p : π κ 0 1 (E, e 0) π κ 1 1 (B, b 0). Is this subject to change with the choice of e 0 in p 1 (b 0 )? In general the answer is yes, but the variation can be characterized. Theorem 3.4. If p : (E, e 0 ) (B, b 0 ) is a pointed (κ 0, κ 1 )-covering map, then as e ranges over the points of p 1 (b 0 ), p (π κ 0 1 (E, e)) ranges over all conjugates of p (π κ 0 1 (E, e 0)) in π κ 1 1 (B, b 0). Proof. Let e p 1 (b 0 ) and let α be a κ 0 -path in E from e to e 0. Then α = p α is a κ 1 -loop at b 0, and we have p (π κ 0 1 (E, e)) = p (h α (π κ 0 1 (E, e 0))) = h α (p (π κ 0 1 (E, e 0))).
7 THE CLASSIFICATION OF DIGITAL COVERING SPACES 7 Thus p (π κ 0 1 (E, e)) is a conjugate of p (π κ 0 1 (E, e 0)). Let [φ] π κ 1 1 (B, b 0) and consider the conjugate [φ] 1 p (π κ 0 1 (E, e 0))[φ]. By Theorem 2.6, there is a lifting φ of φ: φ is a κ0 -path in E from some e p 1 (b 0 ) to e 0. Then p (π κ 0 1 (E, e)) = p (h φ(π κ 0 1 (E, e 0))) = h φ (p (π κ 0 1 (E, e 0))) = [φ] 1 (p (π κ 0 1 (E, e 0)))[φ]. Therefore each conjugate of p (π κ 0 1 (E, e 0)) in π κ 1 1 (B, b 0) is an image for some choice of e. This result allows us to state the Theorem 3.1 in a more general form: Corollary 3.5. Let ((E, e 0 ), κ 0 ) and ((B, b 0 ), κ 1 ) be pointed digital images. Let p : (E, e 0 ) (B, b 0 ) be a pointed (κ 0, κ 1 )-covering map. Let X be a κ 2 -connected digital image, x 0 X. Let φ : (X, x 0 ) (B, b 0 ) be a (κ 2, κ 1 )-continuous map of pointed digital images. Let e p 1 (b 0 ). Consider the following statements. (1) There exists a lifting φ : (X, x 0 ) (E, e) of φ with respect to p. (2) φ (π κ 2 1 (X, x 0)) is contained in some conjugate of p (π κ 0 1 (E, e 0)). Then (1) implies (2). Further, if p is a radius 2 local isomorphism, then (2) implies (1). Note that two choices for e in p 1 (b 0 ) may yield the same conjugate in π κ 1 1 (B, b 0). In fact, all e will yield the same conjugate in the case that the subgroup p (π κ 0 1 (E, e 0)) is normal in π κ 1 1 (B, b 0). In particular, this is the case if π κ 1 1 (B, b 0) is abelian. When does there exist a mapping of digital covering spaces that preserves the digital covering relationship? The answer will rely on the Theorem 3.1, but first we consider the more general setting. Definition 3.6. Let q : D B and p : E B be digital covering maps. A homomorphism [14,9] of digital covering spaces is a digitally continuous function f : D E such that pf(d) = q(d) for every d in D. Note that the composition of two homomorphisms is again a homomorphism, and that, if E is a digital covering space of B, then the identity map E E is a homomorphism. Proposition 3.7. Suppose that q : (D, d 0 ) (B, b 0 ) is a pointed (κ 0, κ 2 )-covering map and p : (E, e 0 ) (B, b 0 ) is a pointed (κ 1, κ 2 )-covering map where B is a κ 2 -connected digital image. If a homomorphism f : D E is onto, then f itself is a digital (κ 0, κ 1 )- covering map. Proof. Let e E. Consider the neighborhood N κ2 (p(e), 1) of p(e). By Proposition 2.4, N κ1 (e, 1) is (κ 1, κ 2 )-isomorphic to N κ2 (p(e), 1). Then f 1 (p 1 (N κ2 (p(e), 1)) = q 1 (N κ2 (p(e), 1)) and each κ 1 -component of this set is isomorphic to N κ2 (p(e), 1) via q. Since f is onto, at least one of these components must contain a point of f 1 (e). By composing isomorphisms we see that each κ 0 -component of f 1 (N κ1 (e, 1)) is isomorphic to N κ2 (e, 1). Thus, f is a digital covering map.
8 8 LAURENCE BOXER AND ISMET KARACA Theorem 3.8. Suppose that q : (D, d 0 ) (B, b 0 ) is a pointed-(κ 0, κ 2 ) covering map and p : (E, e 0 ) (B, b 0 ) is a pointed (κ 1, κ 2 )-covering map where D is a κ 0 -connected digital image, E is a κ 1 -connected digital image, and B is a κ 2 -connected digital image. Then the homomorphism f : D E is a digital (κ 0, κ 1 )-covering map. Proof. From Proposition 3.7, it is enough to show that f is onto. For a given point e E, pick a point d q 1 (p(e)). Since E is κ 1 -connected, there is a κ 1 -path φ : [0, m] Z E from f(d) to e. Projecting this path down into B via p gives a κ 2 -path based at q(d) = p(e). By Theorem 2.6, there is a unique lift, with respect to q, of this κ 2 -path to D with initial point d; call this κ 0 -path ξ. f ξ and φ are κ 1 -paths in E with initial point f(d), projecting via p into the same path in B. By uniqueness of lifts f ξ and φ must be same path. Thus e = φ(m) = f(ξ(m)) is in the image of f and f is onto. By Proposition 3.7, f is a digital covering map. Note that this result places significant limitations on the continuous functions from D to E that can be homomorphisms of digital covering spaces. The following propositions provide further restrictions, as well as specific conditions for the existence of such a function. Proposition 3.9. Suppose that q : (D, d 0 ) (B, b 0 ) is a pointed (κ 0, κ 2 )-covering map and p : (E, e 0 ) (B, b 0 ) is a pointed (κ 1, κ 2 )-covering map where D is a κ 0 -connected digital image and E is a κ 1 -connected digital image. If f, g : D E are homomorphisms of digital (κ 0, κ 1 )-covering spaces such that f(d 0 ) = g(d 0 ), then f and g are identical on (D, d 0 ) Proof. Note, by Theorem 3.8, f and g are both liftings of q to E. Suppose there exists d D such that f(d) g(d). Since D is connected, there is a path r : [0, m] Z D such that r(0) = d 0 and r(m) = d. Since f(r(0)) = g(r(0)), we may assume without loss of generality that m > 0 is the smallest t [0, m] Z such that f(r(t)) g(r(t)). By continuity of f and g, it follows that f(d) and g(d) are distinct members of N 0 = N κ1 (f(r(m 1)), 1). Since f and g are both homomorphisms for the pair of coverings (p, q), we have q(f(d)) = p(d) = q(g(d)). But this is impossible, since q N0 identical on (D, d 0 ). is one-to-one. This contradiction shows that f and g are In the special case that D = E, an isomorphism of the digital covering space is called an automorphism. The following is an immediate consequence of Proposition 3.9: Corollary Let q : (E, e 0 ) (B, b 0 ) be a digital (κ 1, κ 2 )-covering map. If an automorphism f : E E for the pair (q, q) is not the identity, then f is fixed-point free. Note that, in general, the assertion analogous to Corollary 3.10 for a pair (p, q) of distinct covering maps, is false. For example, consider p : Z Z to be the identity map, and f, q : Z Z to be the maps defined by f(z) = q(z) = z. It is easily seen that p and q are (2, 2)-covering maps and f is a homomorphism for (p, q), but 0 is a fixed point of f.
9 THE CLASSIFICATION OF DIGITAL COVERING SPACES 9 Proposition Suppose that q : D B is a digital (κ 0, κ 2 )-covering map and p : E B is a digital (κ 1, κ 2 )-covering map where D is a κ 0 -connected digital image. If p is a radius 2 local isomorphism and q (π κ 0 1 (D, d 0)) is contained in a conjugate of p (π κ 1 1 (E, e 0)), then there exists a homomorphism f : D E for the pair (p, q). Proof. This follows directly from Corollary 3.5. Proposition Suppose that q : D B is a digital (κ 0, κ 2 )-covering map and p : E B is a digital (κ 1, κ 2 )-covering map where D is a κ 0 -connected digital image. Consider the following statements. (1) There is a homomorphism f : D E with f(d 0 ) = e 0. (2) q (π κ 0 1 (D, d 0)) p (π κ 1 1 (E, e 0)). Then (1) implies (2). Further, if p is a radius 2 local isomorphism, then (2) implies (1). Proof. This follows from Theorem 3.1. We can summarize these results in the following theorem: Theorem Suppose that q : D B is a digital (κ 0, κ 2 )-covering map and p : E B is a digital (κ 1, κ 2 )-covering map. Let d 0 q 1 (b 0 ) and e 0 p 1 (b 0 ). Consider the following statements. (1) There is an isomorphism f : D E with f(d 0 ) = e 0. (2) q (π κ 0 1 (D, d 0)) and p (π κ 1 1 (E, e 0)) are conjugate in π κ 2 1 (B, b 0). Then (1) implies (2). Further, if p and q are radius 2 local isomorphisms, then (2) implies (1). This theorem motivates the title of our paper. It classifies covering spaces with radius 2 local isomorphic covering maps, in that two such covering spaces are isomorphic if and only if the images of their fundamental groups under the covering maps are conjugate subgroups. Proof. If q (π κ 0 1 (D, d 0)) and p (π κ 1 1 (E, e 0)) are conjugate in π κ 2 1 (B, b 0) and both p and q are radius 2 local isomorphisms, then using Theorem 3.4, we can assume, without loss of generality (by changing the base point in D if necessary) that the images of q and p are equal. Applying Proposition 3.12, there exist homomorphisms f : (D, d 0 ) (E, e 0 ) and h : (E, e 0 ) (D, d 0 ). Therefore, q = p f and p = q h, hence p f h = q h = p and q h f = p f = q. Thus, f h is an automorphism for the pair (p, p), and h f is an automorphism for the pair (q, q). Now, by Corollary 3.10, each composition must be the respective identity since h f(d 0 ) = d 0 and f h(e 0 ) = e 0. Therefore, f is an isomorphism. Conversely an isomorphism f : (D, d 0 ) (E, e 0 ) implies the images of p and q are equal for one choice of base points. By Theorem 3.4, varying the base points within q 1 (b 0 ) and p 1 (b 0 ) will produce conjugate subgroups as images. Corollary Suppose that p : (E, e 0 ) (B, b 0 ) is a (κ 0, κ 1 )-covering map of connected pointed digital images. Suppose that (B, b 0 ) is κ 1 -simply connected. If p is a radius 2 local isomorphism, then p is an isomorphism. Proof. Since (B, b 0 ) is κ 1 -simply connected, we must have {0} = π κ 1 1 (B, b 0) = (1 B ) (π κ 1 1 (B, b 0)) = p (π κ 0 1 (E, e 0)). From Theorem 3.13, there is an isomorphism f : E B for the pair (p, 1 B ). Therefore, p = 1 B f = f is an isomorphism.
10 10 LAURENCE BOXER AND ISMET KARACA 4. Acknowledgement We thank the anonymous reviewers for their helpful suggestions. References 1. L. Boxer, Digitally continuous functions, Pattern Recognition Letters 15 (1994), , A classical construction for the digital fundamental group, Journal of Mathematical Imaging and Vision 10 (1999), , Properties of digital homotopy, Journal of Mathematical Imaging and Vision 22 (2005), , Homotopy properties of sphere-like digital images, Journal of Mathematical Imaging and Vision 24 (2006), , Digital products, wedges, and covering spaces, Journal of Mathematical Imaging and Vision 25 (2006), S.E. Han, On the classification of the digital images up to digital homotopy equivalence, Journal of Computer and Communications Research 10 (2000), , Non-product property of the digital fundamental group, Information Sciences 171 (2005), , Digital coverings and their applications, Journal of Applied Mathematics and Computing 18 (2005), , Equivalent (k 0, k 1 )-covering and generalized digital lifting, Information Sciences (2007), doi: /j.ins G.T. Herman, Oriented surfaces in digital spaces, CVGIP: Graphical Models and Image Processing 55 (1993), E. Khalimsky, Motion, deformation, and homotopy in finite spaces, Proceedings IEEE International Conference on Systems, Man, and Cybernetics (1987), T.Y. Kong, A digital fundamental group, Computers and Graphics 13 (1989), T.Y. Kong, A.W. Roscoe, and A. Rosenfeld, Concepts of digital topology, Topology and its Applications 46 (1992), W.S. Massey, Algebraic Topology, Springer-Verlag, New York, A. Rosenfeld, Digital topology, American Mathematical Monthly 86 (1979), , Continuous functions on digital pictures, Pattern Recognition Letters 4 (1986), Q.F. Stout, Topological matching, Proceedings 15 th Annual Symposium on Theory of Computing (1983), Department of Computer and Information Sciences, Niagara University, NY 14109, USA; and Department of Computer Science and Engineering, State University of New York at Buffalo address: boxer@niagara.edu Department of Mathematics, Ege University, Bornova, Izmir TURKEY address: ismet.karaca@ege.edu.tr
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 informationCOMBINATORICS 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 informationCATEGORICAL SKEW LATTICES
CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most
More informationThe illustrated zoo of order-preserving functions
The illustrated zoo of order-preserving functions David Wilding, February 2013 http://dpw.me/mathematics/ Posets (partially ordered sets) underlie much of mathematics, but we often don t give them a second
More informationTranscendental lattices of complex algebraic surfaces
Transcendental lattices of complex algebraic surfaces Ichiro Shimada Hiroshima University November 25, 2009, Tohoku 1 / 27 Introduction Let Aut(C) be the automorphism group of the complex number field
More informationTHE 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 informationAlgebra homework 8 Homomorphisms, isomorphisms
MATH-UA.343.005 T.A. Louis Guigo Algebra homework 8 Homomorphisms, isomorphisms For every n 1 we denote by S n the n-th symmetric group. Exercise 1. Consider the following permutations: ( ) ( 1 2 3 4 5
More informationA 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 informationNon 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 informationA relation on 132-avoiding permutation patterns
Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL, 205, 285 302 A relation on 32-avoiding permutation patterns Natalie Aisbett School of Mathematics and Statistics, University of Sydney,
More informationContinuous 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 informationCHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n
CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n Chebyshev Sets A subset S of a metric space X is said to be a Chebyshev set if, for every x 2 X; there is a unique point in S that is closest to x: Put
More informationTheorem 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 informationEquivalence 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 informationCongruence lattices of finite intransitive group acts
Congruence lattices of finite intransitive group acts Steve Seif June 18, 2010 Finite group acts A finite group act is a unary algebra X = X, G, where G is closed under composition, and G consists of permutations
More informationEpimorphisms 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 informationChain 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 informationSy 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 informationGUESSING 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 informationFractional Graphs. Figure 1
Fractional Graphs Richard H. Hammack Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284-2014, USA rhammack@vcu.edu Abstract. Edge-colorings are used to
More informationFuzzy 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 informationCharacterizing 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 informationINTERVAL 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 informationRealizability of n-vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree
Realizability of n-vertex Graphs with Prescribed Vertex Connectivity, Edge Connectivity, Minimum Degree, and Maximum Degree Lewis Sears IV Washington and Lee University 1 Introduction The study of graph
More informationRatio Mathematica 20, Gamma Modules. R. Ameri, R. Sadeghi. Department of Mathematics, Faculty of Basic Science
Gamma Modules R. Ameri, R. Sadeghi Department of Mathematics, Faculty of Basic Science University of Mazandaran, Babolsar, Iran e-mail: ameri@umz.ac.ir Abstract Let R be a Γ-ring. We introduce the notion
More informationADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction
ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen
More informationPARTITIONS 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 informationR. 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 informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More informationPalindromic Permutations and Generalized Smarandache Palindromic Permutations
arxiv:math/0607742v2 [mathgm] 8 Sep 2007 Palindromic Permutations and Generalized Smarandache Palindromic Permutations Tèmítópé Gbóláhàn Jaíyéọlá Department of Mathematics, Obafemi Awolowo University,
More informationGlobal Joint Distribution Factorizes into Local Marginal Distributions on Tree-Structured Graphs
Teaching Note October 26, 2007 Global Joint Distribution Factorizes into Local Marginal Distributions on Tree-Structured Graphs Xinhua Zhang Xinhua.Zhang@anu.edu.au Research School of Information Sciences
More informationApplied 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 informationSome Remarks on Finitely Quasi-injective Modules
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 6, No. 2, 2013, 119-125 ISSN 1307-5543 www.ejpam.com Some Remarks on Finitely Quasi-injective Modules Zhu Zhanmin Department of Mathematics, Jiaxing
More informationOn 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 informationA Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs
A Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles, USA Email: dliu@calstatela.edu Xuding Zhu
More informationDENSITY OF PERIODIC GEODESICS IN THE UNIT TANGENT BUNDLE OF A COMPACT HYPERBOLIC SURFACE
DENSITY OF PERIODIC GEODESICS IN THE UNIT TANGENT BUNDLE OF A COMPACT HYPERBOLIC SURFACE Marcos Salvai FaMAF, Ciudad Universitaria, 5000 Córdoba, Argentina. e-mail: salvai@mate.uncor.edu Abstract Let S
More informationThe 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 informationMore On λ κ closed sets in generalized topological spaces
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir More On λ κ closed sets in generalized topological spaces R. Jamunarani, 1, P. Jeyanthi 2 and M. Velrajan 3 1,2 Research Center,
More informationSEMICENTRAL 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 information4: 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 informationGödel algebras free over finite distributive lattices
TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria
More informationLevel 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 informationCARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS
CARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS KEITH A. KEARNES AND GREG OMAN Abstract. We determine the relationship between the cardinality of a Noetherian integral domain and the cardinality
More informationORDERED 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 informationNew tools of set-theoretic homological algebra and their applications to modules
New tools of set-theoretic homological algebra and their applications to modules Jan Trlifaj Univerzita Karlova, Praha Workshop on infinite-dimensional representations of finite dimensional algebras Manchester,
More informationINFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION
INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION Department of Mathematics, University of Hawaii, Honolulu, HI 96822, USA Phone:(808)956-4655 Abstract. We introduce a
More informationForecast Horizons for Production Planning with Stochastic Demand
Forecast Horizons for Production Planning with Stochastic Demand Alfredo Garcia and Robert L. Smith Department of Industrial and Operations Engineering Universityof Michigan, Ann Arbor MI 48109 December
More informationGame 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 informationREMARKS 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 informationAn 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 informationProjective Lattices. with applications to isotope maps and databases. Ralph Freese CLA La Rochelle
Projective Lattices with applications to isotope maps and databases Ralph Freese CLA 2013. La Rochelle Ralph Freese () Projective Lattices Oct 2013 1 / 17 Projective Lattices A lattice L is projective
More informationON 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 informationInterpolation 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 informationLATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES
K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 100 109 LATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES Zdenka Riečanová An effect algebraic partial binary operation defined on the underlying
More informationarxiv: 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 informationEssays 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 informationSAT and DPLL. Introduction. Preliminaries. Normal forms DPLL. Complexity. Espen H. Lian. DPLL Implementation. Bibliography.
SAT and Espen H. Lian Ifi, UiO Implementation May 4, 2010 Espen H. Lian (Ifi, UiO) SAT and May 4, 2010 1 / 59 Espen H. Lian (Ifi, UiO) SAT and May 4, 2010 2 / 59 Introduction Introduction SAT is the problem
More informationTranslates 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 informationHyperidentities in (xx)y xy Graph Algebras of Type (2,0)
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 9, 415-426 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.312299 Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) W. Puninagool
More informationAN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS
AN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS K. ALAN LOPER, ZACHARY MESYAN, AND GREG OMAN Abstract. We define and study two generalizations of the Krull dimension for rings, which can assume cardinal
More informationWada s Representations of the. Pure Braid Group of High Degree
Theoretical Mathematics & Applications, vol2, no1, 2012, 117-125 ISSN: 1792-9687 (print), 1792-9709 (online) International Scientific Press, 2012 Wada s Representations of the Pure Braid Group of High
More informationbeing saturated Lemma 0.2 Suppose V = L[E]. Every Woodin cardinal is Woodin with.
On NS ω1 being saturated Ralf Schindler 1 Institut für Mathematische Logik und Grundlagenforschung, Universität Münster Einsteinstr. 62, 48149 Münster, Germany Definition 0.1 Let δ be a cardinal. We say
More informationLecture 14: Basic Fixpoint Theorems (cont.)
Lecture 14: Basic Fixpoint Theorems (cont) Predicate Transformers Monotonicity and Continuity Existence of Fixpoints Computing Fixpoints Fixpoint Characterization of CTL Operators 1 2 E M Clarke and E
More informationON THE QUOTIENT SHAPES OF VECTORIAL SPACES. Nikica Uglešić
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 21 = 532 (2017): 179-203 DOI: http://doi.org/10.21857/mzvkptxze9 ON THE QUOTIENT SHAPES OF VECTORIAL SPACES Nikica Uglešić To my Master teacher Sibe Mardešić - with
More informationLATTICE LAWS FORCING DISTRIBUTIVITY UNDER UNIQUE COMPLEMENTATION
LATTICE LAWS FORCING DISTRIBUTIVITY UNDER UNIQUE COMPLEMENTATION R. PADMANABHAN, W. MCCUNE, AND R. VEROFF Abstract. We give several new lattice identities valid in nonmodular lattices such that a uniquely
More informationChair 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 informationSAT and DPLL. Espen H. Lian. May 4, Ifi, UiO. Espen H. Lian (Ifi, UiO) SAT and DPLL May 4, / 59
SAT and DPLL Espen H. Lian Ifi, UiO May 4, 2010 Espen H. Lian (Ifi, UiO) SAT and DPLL May 4, 2010 1 / 59 Normal forms Normal forms DPLL Complexity DPLL Implementation Bibliography Espen H. Lian (Ifi, UiO)
More informationSkew lattices of matrices in rings
Algebra univers. 53 (2005) 471 479 0002-5240/05/040471 09 DOI 10.1007/s00012-005-1913-5 c Birkhäuser Verlag, Basel, 2005 Algebra Universalis Skew lattices of matrices in rings Karin Cvetko-Vah Abstract.
More informationMITCHELL 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 informationBest-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 informationWEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS
WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS BYEONG-KWEON OH Abstract Let L, N and M be positive definite integral Z-lattices In this paper, we show some relation between the
More informationDistributed Function Calculation via Linear Iterations in the Presence of Malicious Agents Part I: Attacking the Network
8 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 8 WeC34 Distributed Function Calculation via Linear Iterations in the Presence of Malicious Agents Part I: Attacking
More informationTHE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES
THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES FU LIU AND BRIAN OSSERMAN Abstract. We study pure-cycle Hurwitz spaces, parametrizing covers of the projective line having only one ramified point
More information1 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 informationA No-Arbitrage Theorem for Uncertain Stock Model
Fuzzy Optim Decis Making manuscript No (will be inserted by the editor) A No-Arbitrage Theorem for Uncertain Stock Model Kai Yao Received: date / Accepted: date Abstract Stock model is used to describe
More informationApplication of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem
Application of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem Malgorzata A. Jankowska 1, Andrzej Marciniak 2 and Tomasz Hoffmann 2 1 Poznan University
More informationarxiv: 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 informationIntroduction to Priestley duality 1 / 24
Introduction to Priestley duality 1 / 24 2 / 24 Outline What is a distributive lattice? Priestley duality for finite distributive lattices Using the duality: an example Priestley duality for infinite distributive
More informationAbstract Algebra Solution of Assignment-1
Abstract Algebra Solution of Assignment-1 P. Kalika & Kri. Munesh [ M.Sc. Tech Mathematics ] 1. Illustrate Cayley s Theorem by calculating the left regular representation for the group V 4 = {e, a, b,
More informationBest 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 informationAn effective perfect-set theorem
An effective perfect-set theorem David Belanger, joint with Keng Meng (Selwyn) Ng CTFM 2016 at Waseda University, Tokyo Institute for Mathematical Sciences National University of Singapore The perfect
More informationCONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005,
Novi Sad J. Math. Vol. 35, No. 2, 2005, 155-160 CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS Mališa Žižović 1, Vera Lazarević 2 Abstract. To every finite lattice L, one can associate a binary blockcode,
More informationA 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 informationAn application of braid ordering to knot theory
January 11, 2009 Plan of the talk I The Dehornoy ordering, Dehornoy floor I Dehornoy floor and genus of closed braid I Nielsen-Thurston classification and Geometry of closed braid Braid groups I B n :
More information3.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 informationQuadrant marked mesh patterns in 123-avoiding permutations
Quadrant marked mesh patterns in 23-avoiding permutations Dun Qiu Department of Mathematics University of California, San Diego La Jolla, CA 92093-02. USA duqiu@math.ucsd.edu Jeffrey Remmel Department
More informationPart 3: Trust-region methods for unconstrained optimization. Nick Gould (RAL)
Part 3: Trust-region methods for unconstrained optimization Nick Gould (RAL) minimize x IR n f(x) MSc course on nonlinear optimization UNCONSTRAINED MINIMIZATION minimize x IR n f(x) where the objective
More information1. 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 informationThis is an author version of the contribution published in Topology and its Applications
This is an author version of the contribution published in Topology and its Applications The definitive version is available at http://www.sciencedirect.com/science/article/pii/s0166864109001023 doi:10.1016/j.topol.2009.03.028
More informationOn Machin s formula with Powers of the Golden Section
On Machin s formula with Powers of the Golden Section Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de México C.P. 58089, Morelia, Michoacán, México fluca@matmor.unam.mx Pantelimon
More informationSeparation 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 informationCONGRUENCES 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 informationSHORT-TERM RELATIVE ARBITRAGE IN VOLATILITY-STABILIZED MARKETS
SHORT-TERM RELATIVE ARBITRAGE IN VOLATILITY-STABILIZED MARKETS ADRIAN D. BANNER INTECH One Palmer Square Princeton, NJ 8542, USA adrian@enhanced.com DANIEL FERNHOLZ Department of Computer Sciences University
More informationOn 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 informationThe Factor Sets of Gr-Categories of the Type (Π,A)
International Journal of Algebra, Vol. 4, 2010, no. 14, 655-668 The Factor Sets of Gr-Categories of the Type (Π,A) Nguyen Tien Quang Department of Mathematics, Hanoi National University of Education 136
More informationGeneralization by Collapse
Generalization by Collapse Monroe Eskew University of California, Irvine meskew@math.uci.edu March 31, 2012 Monroe Eskew (UCI) Generalization by Collapse March 31, 2012 1 / 19 Introduction Our goal is
More informationThe (λ, κ)-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 informationSPLITTING FIELDS KEITH CONRAD
SPLITTING FIELDS EITH CONRAD 1. Introuction When is a fiel an f(t ) [T ] is nonconstant, there is a fiel extension / in which f(t ) picks up a root, say α. Then f(t ) = (T α)g(t ) where g(t ) [T ] an eg
More informationTENSOR PRODUCT IN CATEGORY O κ.
TENSOR PRODUCT IN CATEGORY O κ. GIORGIA FORTUNA Let V 1,..., V n be ĝ κ -modules. Today we will construct a new object V 1 V n in O κ that plays the role of the usual tensor product. Unfortunately in fact
More information3 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