Domain Modeling with Monoids
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Introduction to Linear Bialgebra
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by University of New Mexico University of New Mexico UNM Digital Repository Mathematics and Statistics Faculty and Staff Publications Academic Department Resources 2005 INTRODUCTION TO LINEAR BIALGEBRA Florentin Smarandache University of New Mexico, [email protected] W.B. Vasantha Kandasamy K. Ilanthenral Follow this and additional works at: https://digitalrepository.unm.edu/math_fsp Part of the Algebra Commons, Analysis Commons, Discrete Mathematics and Combinatorics Commons, and the Other Mathematics Commons Recommended Citation Smarandache, Florentin; W.B. Vasantha Kandasamy; and K. Ilanthenral. "INTRODUCTION TO LINEAR BIALGEBRA." (2005). https://digitalrepository.unm.edu/math_fsp/232 This Book is brought to you for free and open access by the Academic Department Resources at UNM Digital Repository. It has been accepted for inclusion in Mathematics and Statistics Faculty and Staff Publications by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. INTRODUCTION TO LINEAR BIALGEBRA W. B. Vasantha Kandasamy Department of Mathematics Indian Institute of Technology, Madras Chennai – 600036, India e-mail: [email protected] web: http://mat.iitm.ac.in/~wbv Florentin Smarandache Department of Mathematics University of New Mexico Gallup, NM 87301, USA e-mail: [email protected] K. Ilanthenral Editor, Maths Tiger, Quarterly Journal Flat No.11, Mayura Park, 16, Kazhikundram Main Road, Tharamani, Chennai – 600 113, India e-mail: [email protected] HEXIS Phoenix, Arizona 2005 1 This book can be ordered in a paper bound reprint from: Books on Demand ProQuest Information & Learning (University of Microfilm International) 300 N. -
On Free Quasigroups and Quasigroup Representations Stefanie Grace Wang Iowa State University
Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2017 On free quasigroups and quasigroup representations Stefanie Grace Wang Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Mathematics Commons Recommended Citation Wang, Stefanie Grace, "On free quasigroups and quasigroup representations" (2017). Graduate Theses and Dissertations. 16298. https://lib.dr.iastate.edu/etd/16298 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. On free quasigroups and quasigroup representations by Stefanie Grace Wang A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Jonathan D.H. Smith, Major Professor Jonas Hartwig Justin Peters Yiu Tung Poon Paul Sacks The student author and the program of study committee are solely responsible for the content of this dissertation. The Graduate College will ensure this dissertation is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2017 Copyright c Stefanie Grace Wang, 2017. All rights reserved. ii DEDICATION I would like to dedicate this dissertation to the Integral Liberal Arts Program. The Program changed my life, and I am forever grateful. It is as Aristotle said, \All men by nature desire to know." And Montaigne was certainly correct as well when he said, \There is a plague on Man: his opinion that he knows something." iii TABLE OF CONTENTS LIST OF TABLES . -
Discriminants and the Monoid of Quadratic Rings
DISCRIMINANTS AND THE MONOID OF QUADRATIC RINGS JOHN VOIGHT Abstract. We consider the natural monoid structure on the set of quadratic rings over an arbitrary base scheme and characterize this monoid in terms of discriminants. Quadratic field extensions K of Q are characterized by their discriminants. Indeed, there is a bijection 8Separable quadratic9 < = ∼ × ×2 algebras over Q −! Q =Q : up to isomorphism ; p 2 ×2 Q[ d] = Q[x]=(x − d) 7! dQ wherep a separable quadratic algebra over Q is either a quadratic field extension or the algebra Q[ 1] ' Q × Q of discriminant 1. In particular, the set of isomorphism classes of separable quadratic extensions of Q can be given the structure of an elementary abelian 2-group, with identity element the class of Q × Q: we have simply p p p Q[ d1] ∗ Q[ d2] = Q[ d1d2] p × ×2 up to isomorphism. If d1; d2; dp1d2 2pQ n Q then Q( d1d2) sits as the third quadratic subfield of the compositum Q( d1; d2): p p Q( d1; d2) p p p Q( d1) Q( d1d2) Q( d2) Q p Indeed, ifpσ1 isp the nontrivial elementp of Gal(Q( d1)=Q), then therep is a unique extension of σ1 to Q( d1; d2) leaving Q( d2) fixed, similarly with σ2, and Q( d1d2) is the fixed field of the composition σ1σ2 = σ2σ1. This characterization of quadratic extensions works over any base field F with char F 6= 2 and is summarized concisely in the Kummer theory isomorphism H1(Gal(F =F ); {±1g) = Hom(Gal(F =F ); {±1g) ' F ×=F ×2: On the other hand, over a field F with char F = 2, all separable quadratic extensions have trivial discriminant and instead they are classified by the (additive) Artin-Schreier group F=}(F ) where }(F ) = fr + r2 : r 2 F g Date: January 17, 2021. -
Arxiv:2011.04704V2 [Cs.LO] 22 Mar 2021 Eain,Bttre Te Opttoal Neetn Oessuc Models Interesting Well
Domain Semirings United Uli Fahrenberg1, Christian Johansen2, Georg Struth3, and Krzysztof Ziemia´nski4 1Ecole´ Polytechnique, Palaiseau, France 2 University of Oslo, Norway 3University of Sheffield, UK 4University of Warsaw, Poland Abstract Domain operations on semirings have been axiomatised in two different ways: by a map from an additively idempotent semiring into a boolean subalgebra of the semiring bounded by the additive and multiplicative unit of the semiring, or by an endofunction on a semiring that induces a distributive lattice bounded by the two units as its image. This note presents classes of semirings where these approaches coincide. Keywords: semirings, quantales, domain operations 1 Introduction Domain semirings and Kleene algebras with domain [DMS06, DS11] yield particularly simple program ver- ification formalisms in the style of dynamic logics, algebras of predicate transformers or boolean algebras with operators (which are all related). There are two kinds of axiomatisation. Both are inspired by properties of the domain operation on binary relations, but target other computationally interesting models such as program traces or paths on digraphs as well. The initial two-sorted axiomatisation [DMS06] models the domain operation as a map d : S → B from an additively idempotent semiring (S, +, ·, 0, 1) into a boolean subalgebra B of S bounded by 0 and 1. This seems natural as domain elements form powerset algebras in the target models mentioned. Yet the domain algebra B cannot be chosen freely: B must be the maximal boolean subalgebra of S bounded by 0 and 1 and equal to the set Sd of fixpoints of d in S. The alternative, one-sorted axiomatisation [DS11] therefore models d as an endofunction on a semiring S that induces a suitable domain algebra on Sd—yet generally only a bounded distributive lattice. -
Ring (Mathematics) 1 Ring (Mathematics)
Ring (mathematics) 1 Ring (mathematics) In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition (called the additive group of the ring) and a monoid under multiplication such that multiplication distributes over addition.a[›] In other words the ring axioms require that addition is commutative, addition and multiplication are associative, multiplication distributes over addition, each element in the set has an additive inverse, and there exists an additive identity. One of the most common examples of a ring is the set of integers endowed with its natural operations of addition and multiplication. Certain variations of the definition of a ring are sometimes employed, and these are outlined later in the article. Polynomials, represented here by curves, form a ring under addition The branch of mathematics that studies rings is known and multiplication. as ring theory. Ring theorists study properties common to both familiar mathematical structures such as integers and polynomials, and to the many less well-known mathematical structures that also satisfy the axioms of ring theory. The ubiquity of rings makes them a central organizing principle of contemporary mathematics.[1] Ring theory may be used to understand fundamental physical laws, such as those underlying special relativity and symmetry phenomena in molecular chemistry. The concept of a ring first arose from attempts to prove Fermat's last theorem, starting with Richard Dedekind in the 1880s. After contributions from other fields, mainly number theory, the ring notion was generalized and firmly established during the 1920s by Emmy Noether and Wolfgang Krull.[2] Modern ring theory—a very active mathematical discipline—studies rings in their own right. -
EXAMPLES of CHAIN DOMAINS 1. Introduction In
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 3, March 1998, Pages 661{667 S 0002-9939(98)04127-6 EXAMPLES OF CHAIN DOMAINS R. MAZUREK AND E. ROSZKOWSKA (Communicated by Ken Goodearl) Abstract. Let γ be a nonzero ordinal such that α + γ = γ for every ordinal α<γ. A chain domain R (i.e. a domain with linearly ordered lattices of left ideals and right ideals) is constructed such that R is isomorphic with all its nonzero factor-rings and γ is the ordinal type of the set of proper ideals of R. The construction provides answers to some open questions. 1. Introduction In [6] Leavitt and van Leeuwen studied the class of rings which are isomorphic with all nonzero factor-rings. They proved that forK every ring R the set of ideals of R is well-ordered and represented by a prime component∈K ordinal γ (i.e. γ>0andα+γ=γfor every ordinal α<γ). In this paper we show that the class contains remarkable examples of rings. Namely, for every prime component ordinalK γ we construct a chain domain R (i.e. a domain whose lattice of left ideals as well as the lattice of right ideals are linearly ordered) such that R and γ is the ordinal type of the set of proper ideals of R. We begin the construction∈K by selecting a semigroup that has properties analogous to those we want R to possess ( 2). The desired ring R is the Jacobson radical of a localization of a semigroup ring§ of the selected semigroup with respect to an Ore set ( 3). -
Free Medial Quandles
Algebra Univers. 78 (2017) 43–54 DOI 10.1007/s00012-017-0443-2 Published online May 23, 2017 © 2017 The Author(s) Algebra Universalis This article is an open access publication Free medial quandles Premyslˇ Jedlicka,ˇ Agata Pilitowska, and Anna Zamojska-Dzienio Abstract. This paper gives the construction of free medial quandles as well as free n-symmetric medial quandles and free m-reductive medial quandles. 1. Introduction A binary algebra (Q, ) is called a rack if the following conditions hold, for · every x, y, z Q: ∈ x(yz)=(xy)(xz) (we say Q is left distributive), • the equation xu = y has a unique solution u Q (we say Q is a left • ∈ quasigroup). An idempotent rack is called a quandle (we say Q is idempotent if xx = x for every x Q). A quandle Q is medial if, for every x, y, u, v Q, ∈ ∈ (xy)(uv)=(xu)(yv). An important example of a medial quandle is an abelian group A with an operation defined by a b = (1 h)(a)+h(b), where h is an automorphism ∗ ∗ − of A. This construction is called an affine quandle (or sometimes an Alexander quandle) and denoted by Aff(A, h). In the literature [6, 7], the group A is 1 usually considered to be a Z[t, t− ]-module, where t a = h(a), for each a A. · ∈ We shall adopt this point of view here as well and we usually write Aff(A, r) instead, where r is a ring element. Note that in universal algebra terminology, an algebra is said to be affine if it is polynomially equivalent to a module. -
On the Hall Algebra of Semigroup Representations Over F1
ON THE HALL ALGEBRA OF SEMIGROUP REPRESENTATIONS OVER F1 MATT SZCZESNY Abstract. Let A be a finitely generated semigroup with 0. An A–module over F1 (also called an A–set), is a pointed set (M, ∗) together with an action of A. We define and study the Hall algebra HA of the category CA of finite A–modules. HA is shown to be the universal enveloping algebra of a Lie algebra nA, called the Hall Lie algebra of CA. In the case of the hti - the free monoid on one generator hti, the Hall algebra (or more precisely the Hall algebra of the subcategory of nilpotent hti-modules) is isomorphic to Kreimer’s Hopf algebra of rooted forests. This perspective allows us to define two new commutative operations on rooted forests. We also consider the examples when A is a quotient of hti by a congruence, and the monoid G ∪{0} for a finite group G. 1. introduction The aim of this paper is to define and study the Hall algebra of the category of set- theoretic representations of a semigroup. Classically, Hall algebras have been studied in the context abelian categories linear over finite fields Fq. Given such a category A, finitary in the sense that Hom(M, N)andExt1(M, N) are finite-dimensional ∀ M, N ∈ A (and therefore finite sets), we may construct from A an associative algebra HA defined 1 over Z , called the Ringel-Hall algebra of A. Asa Z–module, HA is freely generated by the isomorphism classes of objects in A, and its structure constants are expressed in terms of the number of extensions between objects. -
Structure of Some Idempotent Semirings
Journal of Computer and Mathematical Sciences, Vol.7(5), 294-301, May 2016 ISSN 0976-5727 (Print) (An International Research Journal), www.compmath-journal.org ISSN 2319-8133 (Online) Structure of Some Idempotent Semirings N. Sulochana1 and T. Vasanthi2 1Assistant Professor, Department of Mathematics, K.S.R.M College of Engineering, Kadapa-516 003, A. P., INDIA. Email: [email protected] 2Professor of Mathematics, Department of Mathematics, Yogi Vemana University, Kadapa-516 003, A. P., INDIA. (Received on: May 30, 2016) ABSTRACT In this paper we study the notion of some special elements such as additive idempotent, idempotent, multiplicatively sub-idempotent, regular, absorbing and characterize these subidempotent and almost idempotent semiring. It is prove that, if S is a subidempotent semiring and (S, ) be a band, then S is a mono semiring and S is k - regular. 2000 Mathematics Subject Classification: 20M10, 16Y60. Keywords: Integral Multiple Property (IMP); Band; Mono Semirings; Rectangular Band; Multiplicatively Subidempotent; k-regular. 1. INTRODUCTION The concept of semirings was first introduced by Vandiver in 1934. However the developments of the theory in semirings have been taking place since 1950. The theory of rings and the theory of semigroups have considerable impact on the developments of the theory of semirings and ordered semirings. It is well known that if the multiplicative structure of an ordered semiring is a rectangular band then its additive structure is a band. P.H. Karvellas2 has proved that if the multiplicative structure of a semiring is a regular semigroup and if the additive structure is an inverse semigroup, then the additive structure is commutative. -
Unique Factorization Monoids and Domains
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 28, Number 2, May 1971 UNIQUE FACTORIZATION MONOIDS AND DOMAINS R. E. JOHNSON Abstract. It is the purpose of this paper to construct unique factorization (uf) monoids and domains. The principal results are: (1) The free product of a well-ordered set of monoids is a uf-monoid iff every monoid in the set is a uf-monoid. (2) If M is an ordered monoid and F is a field, the ring ^[[iW"]] of all formal power series with well-ordered support is a uf-domain iff M is naturally ordered (i.e., whenever b <a and aMp\bM¿¿0, then aMQbM). By a monoid, we shall always mean a cancellative semigroup with identity element. All rings are assumed to have unities, and integral domains and fields are not assumed to be commutative. If R is an integral domain, then the multiplicative monoid of nonzero elements is denoted by i?x. For any ring or monoid A, U(A) will denote its group of units. A monoid M is called a unique factorization monoid (uf-monoid) iff for every mEM — U(M), any two factorizations of m have a common refinement. That is, if m=aia2 ■ ■ ■ ar = bib2 ■ ■ ■ bs, then the a's and 6's can be factored, say ai = ci • • • c,, a2 = a+i ■ ■ ■Cj, ■ ■ ■ , 61 = di ■ ■ ■dk, b2=dk+i ■ ■ • dp, ■ ■ ■ , in such a way that cn=dn for all n. An integral domain R is called a unique factorization domain (uf-domain) iff Rx is a uf-monoid. A monoid M with relation < is said to be ordered by < iff < is a transitive linear ordering such that whenever a<b then ac<bc and ca<cb for all cEM. -
On Strategy-Proofness and Semilattice Single-Peakedness Jordi Massó April 2019
On Strategy-Proofness and Semilattice Single-Peakedness Jordi Massó April 2019 Barcelona GSE Working Paper Series Working Paper nº 1087 On strategy-proofness and semilattice single-peakedness∗ Agust´ın G. Bonifacio† Jordi Mass´o‡ April 11, 2019 Abstract We study social choice rules defined on the domain of semilattice single- peaked preferences. Semilattice single-peakedness has been identified as the necessary condition that a set of preferences must satisfy so that the set can be the domain of a strategy-proof, tops-only, anonymous and unanimous rule. We characterize the class of all such rules on that domain and show that they are deeply related to the supremum of the underlying semilattice structure. Keywords: Strategy-proofness; Unanimity; Anonymity; Tops-onlyness; Single-peakedness. JEL Classification Numbers: D71. 1 Introduction We characterize the class of all strategy-proof and simple rules defined on the domain of semilattice single-peaked preferences. A rule is a systematic procedure to select ∗We thank Salvador Barber`a, Shurojit Chatterji and Bernardo Moreno for helpful comments and suggestions. Bonifacio acknowledges financial support received from the UNSL, through grant 319502, and from the Consejo Nacional de Investigaciones Cient´ıficas y T´ecnicas (CONICET), through grant PIP 112-200801-00655. Mass´oacknowledges financial support received from the Span- ish Ministry of Economy and Competitiveness, through grant ECO2017-83534-P and through the Severo Ochoa Programme for Centres of Excellence in R&D (SEV-2015-0563), and from the Gener- alitat de Catalunya, through grant SGR2017-711. †Instituto de Matem´atica Aplicada San Luis, Universidad Nacional de San Luis and CONICET, San Luis, Argentina; e-mail: [email protected] ‡Departament d’Economia i d’Hist`oria Econ`omica, Universitat Aut`onoma de Barcelona, and Barcelona GSE, Spain; e-mail: [email protected] 1 an alternative as a function of the declared profile of agents’ preferences. -
Modal Semirings Revisited
Modal Semirings Revisited Jules Desharnais1 and Georg Struth2 1 D´epartement d’informatique et de g´enie logiciel, Pavillon Adrien-Pouliot, 1065, avenue de la M´edecine, Universit´e Laval, Qu´ebec, QC, Canada G1V 0A6 [email protected] 2 Department of Computer Science University of Sheffield, S1 4DP, United Kingdom [email protected] Abstract. A new axiomatisation for domain and codomain on semirings and Kleene algebras is proposed. It is much simpler, more general and more flexible than a predecessor, and it is particularly suitable for pro- gram analysis and program construction via automated deduction. Dif- ferent algebras of domain elements for distributive lattices, (co-)Heyting algebras and Boolean algebras arise by adapting this axiomatisation. Modal operators over all these domain algebras are then easy to define. The calculus of the previous axiomatisation arises as a special case. An application in terms of a fully automated proof of a modal correspon- dence result for L¨ob’s formula is also presented. 1 Introduction Kleene algebras are foundational structures in computing with applications rang- ing from program semantics, construction and refinement to rewriting and con- currency control. Most current variants are close relatives of Kozen’s elegant axiomatisation [17, 18], and share some important features: They focus on the essential operations for modelling programs and similar discrete systems. They support abstract and concise reasoning about such systems within first-order equational calculi. They have rich model classes that include relations, languages, paths in graphs, program traces and predicate transformers. And they enable a new kind of automated program analysis and construction that is supported by automated theorem provers (ATP systems) [10, 11, 13, 25].