COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI SZEGED (HUNGARY), 1980.
|
|
- Edgar Burke
- 5 years ago
- Views:
Transcription
1 COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 33. CONTRIBUTIONS TO LATTICE THEORY SZEGED (HUNGARY), A SURVEY OF PRODUCTS OF LATTICE VARIETIES G. GRATZER - D. KELLY Let y and Wbe varieties of lattices. The ppoduat of y and ~,denoted by y 0 ~, consists of all lattices L for which there is a congruence e on L with every class of e in y and LIe in W. Observe that y 0 ~ contains both y and ~. Moreover, any simple lattice in VoW is already in y or w. This concept was studied extensively for varieties of groups by H. Neumann [30J and later generalized for quasivarieties of universal algebras by A. I. Malfcev [29J. The lattices in Figures 1, 2 and 4 are in!? 0 Q, where Q is the variety of distributive lattices. All the nontrivial classes of a congruence relation are shown in each of these diagrams. Clearly, each class is distributive, and so is the quotient. Let N S be the S-element nonmodular lattice and let N S be the variety it generates. It is easily shown that DoD contains all but two of the varieties convering ~5 (see B. Jonsson and I. Rival [25]). Verification of membership in a product of varie- This research was supported by the NSERC of Canada
2 ties can be simplified by using the results of G. Graczynska [11]. The reader is referred to our paper [15] for further details. Henceforth, this reference is to be understood when no other one is given. H. Neumann [30] showed that the product of two group varieties is again a variety. The same is true for Brouwerian algebras (see P. Kohler [26]). However, the product of two lattice varieties is not necessarily a variety. On the other hand, we show in [16] that gog is a variety. The class QOQ was utilized by S. V. Polin [31]. He did not show that it is a variety, but he did prove that the variety generated by QoQ is distinct from the variety ~ of all lattices. A. I. Mal'cev [29] showed that yo~ is always a quasivariety. In other words, it is closed under the formation of sublattices, direct products, and ultraproducts. Alternatively, it is defined by (equational) implications. Consequently, Yo~ is a variety iff it is closed under homomorphic images. We show that Yo~ is always closed under the formation of ideal lattices, a property not enjoyed by quasivarieties of lattices in general. We now consider a lattice construction that was introduced by R. P. Dilworth [7]. Let L be a lattice. If there is an ideal A of L and a dual ideal B of L such that~ L = AUB, and AnB + Q, then we say that L is obtained by gluing A and B over AnB. Observe that C = AnB is a dual ideal in A and an ideal in B. Moreover, the lattice L is uniquely determined by the lattices A and B and the embeddings of C in A and B. (This construction has been generalized by C. Herrmann [22])
3 For a class ~ of lattices, ~(~) is the class of homomorphic images of lattices in ~ and g(~) is the class of all lattices that are obtained (up to isomorphism) by gluing pairs of lattices in ~. A variety y is czosed under gzuing if ~(y) S y. Let G denote the class of all such varieties. R. P. Dilworth [7] showed that ~, the variety of all modular lattices, is in G. This result was later applied by M. Hall and R. P. Dilworth [21]. It is also known that D E G. For any lattice variety y, it is obvious that Consequently, if yo!? is a variety, then G(V) C VoD ,.., Thus, a necessary condition for yo Q to be a variety is that y contain every simple lattice in G(V). This condition is significant because it is easy to construct simple lattices that belong to G(y): gluing two simple lattices over a nontrivial lattice yields a simple lattice. Let y be a nondistributive variety that is generated by a finite lattice. We shall show that yo!? is not a variety. Suppose, to the contrary, that it is. The lattice of Figure 5 is in ~S o!? and has the lattice S Figure 6 as a must lie in y whenever N S E must contain a homomorphic image. Since S is simple, it y. It now follows that y simple lattice with more than two elements. By Jonsson's Lemma [24], there is a finite bound on the size of simple lattices in y. Let L be a of simple lattice of maximum size in y. Since y cannot contain the simple lattice obtained gluing L to itself over a prime interval, V 0 D is not a variety
4 Let y and Wbe nontrivial lattice varieties that do not contain the lattice S of Figure 6. If we also assume that N5" E y., then it. follows from the previos paragraph that VoW is not a variety" In particular, (Q (I Q) 0!? is not a variety" Let Wbe a nondistributive variety of modular lattices, and y = ~VN5" By J6nsson's Lemma, S ~ V. By chasing Was in K. A. Baker [1], we can construct continuumly many varieties y. for which Y(I!? is not a variety" the quasivarieties V 0 D are all distinct. To membership in of varieties, we make the followlng definitlon: for a lattice L and a quasivariety ~, let 8(L,~) be the (unique) smallest congruence e on L such that LIe E ~. The quotient LI8(L,y) is the maximum homomorphic image of L that lies in y.. In terms of y and W, there Is an easy test whether a lattice L is in yo LEy (I Wiff every class of B(L,!) is in y. (This definition and its application are due to A. I. Mal'cev [29]. ) The congruences.shown In 1, 2, 4 and 5 are all of the form B(L,Q). The infinite lattice of Figure 1 11es in Q(I!? and it is generated by 4 elements. Consequently, QoQ is not locally flnite. (An additlonal property of the lattice in Figure 1 is that it has only two elements in Its max Imum distributive homomorphic image.) We denote an n-element chain by Let L = 02'*C 2 ' the free product of with itself. Since L is in!? 0!?, L is also the D 0 product of with However, C *C is not in PO!? (See [13], (32), or [33) for 4 1 diagrams of' 02*02 and * 1,,) Let y and Nbe varieties with Y2 N. Let L be the free y-lattice by the set X" In symbols, L =
5 = FV(X). If e ;;; e(l,w), then L/e is isomorphic to FW(X). SimIlar results hold for free products and lattices~completely freely generated by posets. The correctness of Figure 2 follows from these observations. (This lattice has 19 elements in its maximum distributive homomorphic image.) Similarly, starting from the completely free lattice generated by the poset H of Figure 3 (given in I. Rival and R. Wille [32]), we obtain the completely Q 0 Q -free lattice gene.rated by H (see Figure 4). The maximum distributive homomorphic image of this lattice has 27 elements. We - - =!?n O!? The!?n,S are distinct by V. B. Lender [27]. We define the dimension of y as the maximum n for which y contains Qn. A. Day [4] has shown that ~ is the only inductively define the quasivariety D n as follows: DO = T, the class of trivial lattices;-d n + 1 = lattice variety that contains every Qn. Therefore, every variety y + ~ has a finite dimension. Consequently, every lattice variety is a product of indecomposable varieties. We show in [16] that, for y E G, yo > is a variety. A.Day [6] has generalized this result by replacing Q by any locally finite variety generated by lattices that are bounded in the sense of McKenzie [28]. These M-bounded lattices are characterized in Day [5J. Using a family of projective modular lattices of R. Freese [9], we show in [16] that G contains continuumly many modular varieties. (In an unpublished appendix to C. Herrmann and A. Huhn [23], some modular members of G are defined by identities.) Thus, applying a result of Lender [27J, there are continuumly many varieties of the form V 0 D. We have not found any variety y for which
6 VoD is a variety but Yf G. Let us call a class; of l~ttices subdirectly complete if every lattice in X can be embedded in a subdirectly irreducible lattice in ~. R. p. Dilworth and R. Freese [8] have shown that ~ is subdirectly complete. ~ is also known to be subdirectly complete. In [18], we show that VoW is subdirectly complete whenever y and ~ are nontrivial varieties. We show that pop contains continuumly many subvarieties in [17]. Consequently, the product of any two nontrivial lattice varieties contains continuumly many subvarieties. Therefore, one may conjecture that any nontrivial subdirectly complete variety of lattices contains continuumly many subvarieties. By Jonsson's Lemma, any subdirectly complete lattice variety is join-irreducible. Thus, we can easily find all solutions of the equation yo W= yv~. (See also [14].) The previous results imply the existence of continuumly many join-irreducible lattice varieties. J. Berman [2] has given a different proof of this statement. We have already observed that p Q is not locally finite. However, it is shown in [19] that!? o!? is generated by its finite members. Since the implications holding in!? o!? can be recursively enumerated (see [15]), it follows that the (free lattice) word problem for!? P is solvable. We use different techniques in [20] to give a primitve recursive basis for the identities of!? Q
7 Figure 1 A lattice in DoD
8 Figure 2 The DOD-free product of C4 and C
9 Figure 3 The poset H
10 AXIS OF ---_ SYMMETRY Figure 4 The completely Q 0 Q-free lattice generated by H
11 Figure 5 A lattice in ~5 o!?
12 Figure 6 A simple lattice
13 REFERENCES [1] K. A. Baker, tices, classes of modular lat J. Math., 28 (1969), [ J. Interval lattices and the [3) A. A, 12 (1981), , lattices all lattices, Universalis, 7 (1977), [4] A., in the classes of lattices, (1978), of all SI? Bull., 21 [5] [6] [7] A. Characterizations of finite lattices that are free lattices, Preprint. A. Private or sublatticesof R. P. The arithmetical of Birkhoff lattices, Duke Math. J., 8 (1941), [8] R. P. Dilworth - R. Generators of lattice varieties, A Universalis, 6 (1976), [9] R.Freese, as modular lattices, Trans. Amep. Math. Soa., 251 (1979), [101 A. M. W. Glass - W. C.Holland - S. H. The structure of varieties, A Uni-, 10 (1980), [11]E., On the sums of double system of lattices, in: Contributions to Universal ( 1975 ), Co l Math. Soa. Janos Bo, vol 17. North-Holland, New York, 1977,
14 [12] E. Graczynska - G. Gratzer, On double systems of lattices, Demonstratio Mathematica, 13 (1980), [13] G. Gratzer, GeneraL Lattice Theory, Pure and Applied Mathematics Series, Academic Press, New York, [14] G. Gratzer - D. Kelly, On a special type of subdirectly irreducible lattice with an application to products of varieties, C. R. Math. Rep. Acad. Sci. Canada, 2 (1980), [15] G. Gratzer - D. Kelly, The product of lattice varieties, to appear. [16] G. Gratzer - D. Kelly, Certain products of lattice varieties that are varieties, to appear. [17] G. Gratzer - D. Kelly, The lattice variety QoQ, to appear. [18] G. Gratzer - D. Kelly, Products of lattice varieties permit embedding into subdirectly irreducible members, to appear. [19] G. Gratzer - D. Kelly, A property of products of locally finite lattice varieties, to appear. [20] G. Gratzer - D. Kelly, Identities satisfied by certain products of lattice varieties, to appear. [21] M. Hall - R. P. Dilworth, The imbedding problem for modular lattices, Ann. of Math., 45 (1944), [22] C. Herrmann, S-verklebte Summen von Verbanden, Math. Z., 130 (1973),
15 [2 c. Herrmann - A. Huhn, Zum Charakteristik modularer (1975), der Math. Z., 144 [24] B. Jonsson, distributive, Math. whose congruence lattices are, 21 (1967), [25] B. Jonsson - I. Rival, Lattice varieties covering the smallest non-modular 82 (1979), J. Math., [26] P. Kohler, Varieties of Brouwerian, Mitt. Math. Bem. Giessen, Heft 116, Giessen [ V. B. Lender, The of of lattices (, Siberian Math. J., 16 (1975), in translation. [28] R. McKenzie, bases and nonmodular lattice varieties, Trans. Amer. Math. Soo., 174 (1972), J A. I. Mal'cev, braic (1967), Mathematios A (Russian), Amsterdam, 1971, of classes of Siberian th. J., 8 translation: The terns, [30] H. Varieties der Mathematik und ihrer, Band 37,, New York, [31] S. V. On identities in congruence lattices of universal Russian, Mat. Zametki, 22 (1977) I
16 [32] I. Rival - R. Wille, Lattices freely generated by partially ordered sets: which can be "drawn"? J. Reine Angew. Math., 310 (1979), [33] H. L. Rolf, The free lattice generated by a set of chains, Paaifia J. Math., 8 (1958), George Gratzer - David Kelly Department of Mathematics University of Manitoba Winnipeg, Manitoba R3T 2N2, Canada
Theorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice.
CONGRUENCE-PRESERVING EXTENSIONS OF FINITE LATTICES TO SEMIMODULAR LATTICES G. GRÄTZER AND E.T. SCHMIDT Abstract. We prove that every finite lattice hasa congruence-preserving extension to a finite semimodular
More informationGeneral Lattice Theory: 1979 Problem Update
Algebra Universalis, 11 (1980) 396-402 Birkhauser Verlag, Basel General Lattice Theory: 1979 Problem Update G. GRATZER Listed below are all the solutions or partial solutions to problems in the book General
More informationLattice Laws Forcing Distributivity Under Unique Complementation
Lattice Laws Forcing Distributivity Under Unique Complementation R. Padmanabhan Department of Mathematics University of Manitoba Winnipeg, Manitoba R3T 2N2 Canada W. McCune Mathematics and Computer Science
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 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 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 informationAn orderly algorithm to enumerate finite (semi)modular lattices
An orderly algorithm to enumerate finite (semi)modular lattices BLAST 23 Chapman University October 6, 23 Outline The original algorithm: Generating all finite lattices Generating modular and semimodular
More informationPURITY IN IDEAL LATTICES. Abstract.
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I.CUZA IAŞI Tomul XLV, s.i a, Matematică, 1999, f.1. PURITY IN IDEAL LATTICES BY GRIGORE CĂLUGĂREANU Abstract. In [4] T. HEAD gave a general definition of purity
More 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 informationModular and Distributive Lattices
CHAPTER 4 Modular and Distributive Lattices Background R. P. DILWORTH Imbedding problems and the gluing construction. One of the most powerful tools in the study of modular lattices is the notion of the
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 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 informationON THE LATTICE OF ORTHOMODULAR LOGICS
Jacek Malinowski ON THE LATTICE OF ORTHOMODULAR LOGICS Abstract The upper part of the lattice of orthomodular logics is described. In [1] and [2] Bruns and Kalmbach have described the lower part of the
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 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 informationGenerating all modular lattices of a given size
Generating all modular lattices of a given size ADAM 2013 Nathan Lawless Chapman University June 6-8, 2013 Outline Introduction to Lattice Theory: Modular Lattices The Objective: Generating and Counting
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 informationFINITE SUBSTRUCTURE LATTICES OF MODELS OF PEANO ARITHMETIC
proceedings of the american mathematical society Volume 117, Number 3, March 1993 FINITE SUBSTRUCTURE LATTICES OF MODELS OF PEANO ARITHMETIC JAMES H. SCHMERL (Communicated by Andreas R. Blass) Abstract.
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 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 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 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 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 informationLIST OF PUBLICATIONS. 1. Published Mathematical Papers
LIST OF PUBLICATIONS E. T. SCHMIDT 1. Published Mathematical Papers [1] G. Grätzer and E. T. Schmidt, Ideals and congruence relations in lattices. I, Magyar Tud. Akad. Mat. Fiz. Oszt. Közl. 7 (1957), 93
More informationLattice Model of Flow
Lattice Model of Flow CS4605 George W. Dinolt Taken From Denning s A Lattice Model of Secure Information Flow, Communications of the ACM, Vol 19, #5, May, 1976 The Plan The Elements of the Model The Flow
More informationLattices with many congruences are planar
Lattices with many congruences are planar Gábor Czédli (University of Szeged) http://www.math.u-szeged.hu/~czedli/ Talk at the 56th SSAOS, Špindlerův Mlýn, September 2 7, 2018 September 4, 2018 Definitions
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 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 informationALGORITHMS FOR FINITE, FINITELY PRESENTED AND FREE LATTICES
ALGORITHMS FOR FINITE, FINITELY PRESENTED AND FREE LATTICES RALPH FREESE Abstract. In this talk we will present and analyze the efficiency of various algorithms in lattice theory. For finite lattices this
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 informationRANDOM POSETS, LATTICES, AND LATTICES TERMS
125 (2000) MATHEMATICA BOHEMICA No. 2, 129 133 RANDOM POSETS, LATTICES, AND LATTICES TERMS Jaroslav Ježek, Václav Slavík, Praha (Received January 6, 1998) Abstract. Algorithms for generating random posets,
More informationCONGRUENCE LATTICES OF PLANAR LATTICES
Acta Math. Hung. 60 (3-4) (1992), 251-268. CONGRUENCE LATTICES OF PLANAR LATTICES G. GRATZER and H. LAKSER (Winnipeg) 1. Introduction. Let L be a lattice. It was proved in N. Funayama and T. Nakayama [5]
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 informationLATTICE VARIETIES COVERING THE SMALLEST NON-MODULAR VARIETY
PACIFIC JOURNAL OF MATHEMATICS Vol 82, No 2, 1979 LATTICE VARIETIES COVERING THE SMALLEST NON-MODULAR VARIETY BJARNI JόNSSON AND IVAN RIVAL There are sixteen varieties of lattices that are known to cover
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 informationGenerating all nite modular lattices of a given size
Generating all nite modular lattices of a given size Peter Jipsen and Nathan Lawless Dedicated to Brian Davey on the occasion of his 65th birthday Abstract. Modular lattices, introduced by R. Dedekind,
More informationUNIVERSAL QUASIVARIETIES OF ALGEBRAS
ACTAS DEL IX CONGRESO DR. ANTONIO A. R. MONTEIRO (2007), Páginas 11 21 UNIVERSAL QUASIVARIETIES OF ALGEBRAS M.E. ADAMS AND W. DZIOBIAK ABSTRACT. Two different notions of universal, one due to Hedrlín and
More informationTHE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE
THE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE GÜNTER ROTE Abstract. A salesperson wants to visit each of n objects that move on a line at given constant speeds in the shortest possible time,
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 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 informationSpecial M-Hyperidentities in Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Type (2,0)
International Mathematical Forum, Vol. 7, 2012, no. 39, 1925-1940 Special M-Hyperidentities in Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Type (2,0) Apinant Anantpinitwatna and
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 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 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 informationFuzzy Join - Semidistributive Lattice
International Journal of Mathematics Research. ISSN 0976-5840 Volume 8, Number 2 (2016), pp. 85-92 International Research Publication House http://www.irphouse.com Fuzzy Join - Semidistributive Lattice
More informationMath 167: Mathematical Game Theory Instructor: Alpár R. Mészáros
Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By
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 informationCollinear Triple Hypergraphs and the Finite Plane Kakeya Problem
Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Joshua Cooper August 14, 006 Abstract We show that the problem of counting collinear points in a permutation (previously considered by the
More 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 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 informationUniversal Algebra and Lattice Theory
Conference on Universal Algebra and Lattice Theory Dedicated to the 80th birthday of Be la Csa ka ny June 21 25, 2012, Szeged, Hungary THURSDAY, June 21 10:00 10:10 Opening Chairperson: Tama s Waldhauser
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 informationMATH 121 GAME THEORY REVIEW
MATH 121 GAME THEORY REVIEW ERIN PEARSE Contents 1. Definitions 2 1.1. Non-cooperative Games 2 1.2. Cooperative 2-person Games 4 1.3. Cooperative n-person Games (in coalitional form) 6 2. Theorems and
More informationLaurence 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 informationarxiv: v1 [math.lo] 24 Feb 2014
Residuated Basic Logic II. Interpolation, Decidability and Embedding Minghui Ma 1 and Zhe Lin 2 arxiv:1404.7401v1 [math.lo] 24 Feb 2014 1 Institute for Logic and Intelligence, Southwest University, Beibei
More informationLaurence Boxer and Ismet KARACA
THE CLASSIFICATION OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.
More 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 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 informationBrief Notes on the Category Theoretic Semantics of Simply Typed Lambda Calculus
University of Cambridge 2017 MPhil ACS / CST Part III Category Theory and Logic (L108) Brief Notes on the Category Theoretic Semantics of Simply Typed Lambda Calculus Andrew Pitts Notation: comma-separated
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 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 informationComputing Unsatisfiable k-sat Instances with Few Occurrences per Variable
Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Department of Computer Science, University of Toronto, shlomoh,szeider@cs.toronto.edu Abstract.
More informationDecompositions of Binomial Ideals
Decompositions of Binomial Ideals Laura Felicia Matusevich Texas A&M University AMS Spring Central Sectional Meeting, April 17, 2016 Polynomial Ideals R = k[x 1 ; : : : ; x n ] the polynomial ring over
More informationSHIMON GARTI AND SAHARON SHELAH
(κ, θ)-weak NORMALITY SHIMON GARTI AND SAHARON SHELAH Abstract. We deal with the property of weak normality (for nonprincipal ultrafilters). We characterize the situation of Q λ i/d = λ. We have an application
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 informationTWIST UNTANGLE AND RELATED KNOT GAMES
#G04 INTEGERS 14 (2014) TWIST UNTANGLE AND RELATED KNOT GAMES Sandy Ganzell Department of Mathematics and Computer Science, St. Mary s College of Maryland, St. Mary s City, Maryland sganzell@smcm.edu Alex
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 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 informationMAT 4250: Lecture 1 Eric Chung
1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose
More 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 informationDistributive Lattices
Distributive Lattices by Taqseer Khan Submitted to Central European University Department of Mathematics and its Applications In partial fulfulment of the requirements for the degree of Master of Science
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 informationOrdered Semigroups in which the Left Ideals are Intra-Regular Semigroups
International Journal of Algebra, Vol. 5, 2011, no. 31, 1533-1541 Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups Niovi Kehayopulu University of Athens Department of Mathematics
More 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 informationIdeals and involutive filters in residuated lattices
Ideals and involutive filters in residuated lattices Jiří Rachůnek and Dana Šalounová Palacký University in Olomouc VŠB Technical University of Ostrava Czech Republic SSAOS 2014, Stará Lesná, September
More informationMETRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES
Bulletin of the Section of Logic Volume 8/4 (1979), pp. 191 195 reedition 2010 [original edition, pp. 191 196] David Miller METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES This is an
More 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 informationResiduated Lattices of Size 12 extended version
Residuated Lattices of Size 12 extended version Radim Belohlavek 1,2, Vilem Vychodil 1,2 1 Dept. Computer Science, Palacky University, Olomouc 17. listopadu 12, Olomouc, CZ 771 46, Czech Republic 2 SUNY
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 informationTHE VARIETY OF MODULAR LATTICES IS NOT GENERATED BY ITS FINITE MEMBERS BY RALPH FREESE1
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 255, November 1979 THE VARIETY OF MODULAR LATTICES IS NOT GENERATED BY ITS FINITE MEMBERS BY RALPH FREESE1 Abstract. This paper proves the result
More informationLattice Properties. Viorel Preoteasa. April 17, 2016
Lattice Properties Viorel Preoteasa April 17, 2016 Abstract This formalization introduces and collects some algebraic structures based on lattices and complete lattices for use in other developments. The
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 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 informationVariations on a theme by Weetman
Variations on a theme by Weetman A.E. Brouwer Abstract We show for many strongly regular graphs, and for all Taylor graphs except the hexagon, that locally graphs have bounded diameter. 1 Locally graphs
More 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 informationOn axiomatisablity questions about monoid acts
University of York Universal Algebra and Lattice Theory, Szeged 25 June, 2012 Based on joint work with V. Gould and L. Shaheen Monoid acts Right acts A is a left S-act if there exists a map : S A A such
More information2 Deduction in Sentential Logic
2 Deduction in Sentential Logic Though we have not yet introduced any formal notion of deductions (i.e., of derivations or proofs), we can easily give a formal method for showing that formulas are tautologies:
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 informationKAPLANSKY'S PROBLEM ON VALUATION RINGS
proceedings of the american mathematical society Volume 105, Number I, January 1989 KAPLANSKY'S PROBLEM ON VALUATION RINGS LASZLO FUCHS AND SAHARON SHELAH (Communicated by Louis J. Ratliff, Jr.) Dedicated
More informationLattices generated by Chip Firing Game: characterizations and recognition algorithm
Lattices generated by Chip Firing Game: characterizations and recognition algorithm PHAN Thi Ha Duong Institute of Mathematics Vietnam Academy of Science and Technology Journées SDA2 2017 : Systèmes Dynamiques,
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 informationMartingale Pricing Theory in Discrete-Time and Discrete-Space Models
IEOR E4707: Foundations of Financial Engineering c 206 by Martin Haugh Martingale Pricing Theory in Discrete-Time and Discrete-Space Models These notes develop the theory of martingale pricing in a discrete-time,
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 informationFUZZY PRIME L-FILTERS
International Journal of Applied Mathematical Sciences ISSN 0973-0176 Volume 9, Number 1 (2016), pp. 37-44 Research India Publications http://www.ripublication.com FUZZY PRIME L-FILTERS M. Mullai Assistant
More informationConference on Lattices and Universal Algebra
Algebra univers. 45 (2001) 107 115 0002 5240/01/030107 09 $ 1.50 + 0.20/0 Birkhäuser Verlag, Basel, 2001 Conference on Lattices and Universal Algebra Szeged, August 3 7, 1998 The Conference on Lattices
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 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 informationThe ruin probabilities of a multidimensional perturbed risk model
MATHEMATICAL COMMUNICATIONS 231 Math. Commun. 18(2013, 231 239 The ruin probabilities of a multidimensional perturbed risk model Tatjana Slijepčević-Manger 1, 1 Faculty of Civil Engineering, University
More information