Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Copyright © 2021
20 by author (s) and
International Journal of Trend in
Scientific Research and Development
Journal. This is an Open Access article
distributed under
the terms of the
Creative Commons
Attribution License (CC BY 4.0)
(http://creativecommons.org/licenses/by/4.0)
http://creativecommons.org/licenses/by/4.0)
INTRODUCTION
A semiring is an algebraic structure in which we can add Boolean semiring {0, 1} where addition is maximum and
and multiply elements, where multiplication distributes
distribu multiplication is minimum.
over addition.
Tropical algebra is a relatively new area of mathematics
The most familiar examples for semirings in classical which brings together ideas from algebra, order theory
algebra are the semiring of non-negative
negative integers or the and discrete mathematics, and which has numerous
semiring of nonnegative real numbers with ordinary applications in scheduling and optimization, formal
operations of addition and multiplication. The first language theory, numerical analysis and dynamical
examples of semirings appeared in the work of Dedekind systems. Here the primary objects of study are the tropical
[1]. But, then, it was the American mathematician semirings. The tropical semirings based on either the non-
non
Vandiver who used the term “semi-ring”
ring” in his 1934 paper negative integer, the integer or real numbers, but with
for introducing an algebraic structure with two operations unusual semiring operations. Specifically, addition
addit is
of addition and multiplication such that multiplication either maximum (or minimum) and multiplication is usual
distributes on addition [2]. addition.
One of the classic areas of mathematics in which semirings BASIC DEFINITIONS AND PRELIMINARENT RESULTS
arise is the theory of formal languages. A formal language Definition 1: Semiring is an algebraic structure , ,∗
is any set of words (finite strings of symbols) taken from a where S is a set, , and ,∗ are semigroups (i.e.,
fixed finite set, called the alphabet. The set of all languages both operations, addition “ "” and multiplication
from a fixed alphabet can be viewed as a semiring where
" ∗ ", are associative) and those operations satisfy the laws
addition is the union of the languages and multiplication is
of distributivity for both sides:
the concatenation of the languages. Such semirings have
applications in logic and theoretical computer science. ∗ ∗ ∗ and
As a subset of all languages the set of regular languages is ∗ ∗ ∗ , for any
closed under union and concatenation, so is a semiring. By
, , ∈ .
the famous result of Kleene, the regular languages are
precisely the languages accepted by automata [3]. The The concept of semiring in this form was introduced by
operation of an automaton can be simulatedted by repeatedly Vandiver in 1934 [2]. Sometimes we will suppose that a
multiplying the Boolean matrices that encode its rules [4]. semiring S has the neutral element 0 (zero) relatively the
This means that the study of regular languages boils down addition or/and has the neutral element 1 (unit) relatively
to considering finite collections of matrices over the the multiplication and0 ∗ ∗ 0 0 for any ∈ .
Now we need some previous results about semirings and Theorem 5[8]: Let S = (a) be a cyclic semiring of type (k,
cyclic semirings. n). Subsets of form
Theorem 1 [5]: Any finite semifield is isomorphic to the As = {as, …, ak, …, ak+n-1} where s ≤ k they and only they are
product of two semifield: one with a left addition and ideals of S.
another with a right addition. Any finite semifield is Definition 10: Let S = (a) be a finite cyclic semiring of type
idempotent. (k, n) and
Theorem 2 [5]: If a cyclic group G of order n |'| As = {as, …, ak, …, ak+n-1} where s ≤ k an ideal of S, then
with generating element c is isomorphic the product of
two groups G1, and G2 of order m and h respectively, then xρAy ⇔ x, y ϵ As or x = y for all x, y ϵ S.
G1 and G2 are cyclic groups and m and h are coprimes, Lemma 2: Let S be a finite cyclic semiring of type , .
* +
(, ℎ 1, ' ,' . The binary relation ρA on S is a congruence and S/ρA is a
If C is a cyclic semifield, , , |,| then , finite cyclic semiring of type (s, 1) with absorbing element
, - × - , , |, -| (, |- ,| ℎ, where e is an [as] ([as] is the class of congruence ρA containing element
as).
@ IJTSRD | Unique Paper ID – IJTSRD38612 | Volume – 5 | Issue – 2 | January-February 2021 Page 1178
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
Proof. It is evident that S/ρA = {{a}, {a2}, … , {as-1}, {as, … , Theorem 6: Let S be a finite cyclic semiring of type (k, n).
ak, … , ak+n-1}}. Let’s prove that ρA is a congruence. For S is a C-semiring if and only if k ≤ 3, n = pl (p is a prime)
operation of product the relation ρA be the same as and if k = 3 then p ≠ 2.
congruence of Rice for semigroups.
Proof. By lemma 6, n = pl where p is a prime number. By
Let’s prove that ρA is a congruence for addition. Let be a, b, lemma 12, k ≤ 3. If k = 3 then |Ak| = |C| = pl is odd number
c, d ϵ S and aρAb and cρAd. then p ≠ 2.
If a, b ϵ {at,1}, c, d ϵ {at2} where t1, t2 ϵ {1, … , s-1} than a + c The sufficiency is evident.
ϵ [at1 + at2] and
Now, let consider the case when S is an infinite compact
b + d ϵ [at1 + at2]. This means that (a + c)ρA(b + d). semiring.
If a, b ϵ {at}, c, d ϵ As = {as, … , ak, … , ak+n-1} where t ϵ {1, … , Definition 11: The p-adic digit is an integer number
s-1} than by Theorem 3(a + c)ρA(b + d). between 0 and p – 1 (inclusive). A p-adic integer is a
sequence {ai} i ϵ 0 of p-adic digits. We write this sequence
If a, b, c, d ϵ As = {as, … , ak, … , ak+n-1} than by Theorem 3, a
… as … a2a1a0 (that is, the ai are written from left to right).
+ c, b + d ϵ As = {as, … , ak, … , ak+n-1} and (a + c)ρA(b + d).
If n ϵ 0 and n = ak-1ak-2 … a1a0 is its p-adic representation
Therefore we proved that ρA is a congruence. than we identify n with the p-adic integer {ai} i ϵ 0 with ai
= 0 for i ≥ k.
Lemma 3: Let S be a finite cyclic semiring of type (4, 1).
Then, S is not a C-semiring. (For example, 1 is the p-adic integer all whose digits are 0
except the right-most one which is 1 = … 0 … 001).
Proof: In [9] obtained Cally’s tables for addition for all
cyclic semirings of type (4, 1). Definition 12: If α = {ai} i ϵ 0 and β = {bi} i ϵ 0 are two p-
adic integer, we will define their sum. We define by
Here, we can see that for these semirings S, the lattice Sub
induction a sequence {ci} i ϵ 0 of
S isn’t a chain as a2 + a2 ≠ a3. Thus, subsemiring (a2) and
(a3) aren’t comparable. p-adic digits and a sequence {εi} i ϵ 0 of elements of {0, 1}
as follows:
Lemma 4: Let S be a finite cyclic semiring of type (4, n).
Than S is not a C-semiring. ε0 = 0;
By induction, all finite cyclic semirings S of type (k, 1) Zp = G0> G1> G2> … > {e}
where k ≥ 4 are not a C-semirings. .where G0 = &&&&&&&&&&&&&
… 0001 , G1 = &&&&&&&&&&&&&
… 0010 , G2 = &&&&&&&&&&&&&
… 0100 , etc.
Lemma 6: Let S be a finite cyclic semiring of type (k, n) Element e is the identity of Zp.
where k ≥ 4. Then S is not a C-semiring. Theorem 7: Let S be an infinite compact monothetic
Proof. Let S be a finite cyclic semiring of type (k, n) where semiring . S is a C-semiring if and only if:
k ≥ 4 and xρAy ⇔ x, y ϵ Ak or x = y for all x, y ϵ S. By lemma 1. ,∗ is a group topologically isomorphic => . S has
2, the binary relation ρA on S is a congruence and S/ρA is a left addition or right addition or , is a chain at
finite cyclic semiring of type (k, 1). If S is a finite cyclic C- relation of order ≤ ! ⟺ ! ! for all , ! ∈ .
semiring than S/ρA is a finite cyclic C-semiring, which is a 2. ,∗ contains a compact monothetic group H
contradiction. topologically isomorphic => and , ∪ @ and
,∗ is a compact monothetic semigroup of type ii)
From lemma 6 follows of Theorem 3, and 8 ≤ 2. If 8 2 then : ≠ 2. S has left
Lemma 7: Let S be a finite cyclic C-semiring of type (k, n) addition or right addition or , is a chain at
then k ≤ 3. relation of order ≤ ! ⟺ ! ! for all , ! ∈ .
@ IJTSRD | Unique Paper ID – IJTSRD38612 | Volume – 5 | Issue – 2 | January-February 2021 Page 1179
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
addition or right addition or , is a chain at relation Mathematics Studies, p. 3-41, Princeton University
of order ≤ ! ⟺ ! ! for all , ! ∈ . In this case Press, Princeton, 1956.
&&&&&&&
$ is isomorphic the lattice of cloused subsemigroups
[4] Kuich W. and Salomaa A. Semieings, Automata,
of ,∗ . Thus, Theorem 7 follows from the description
Languages, Volume 5 of EATCS Monographs on
of compact monothetic C-semigroups [10].
Theoretical Computer Science. Springer Berlin,
Here we will prove that if , ∪ @ where H = Zp 1986.
and S is a C-semiring than
[5] Vechtomov E. M. Introduction in Semirings, Kirov,
p ≠ 2. Really, if , ∪ @and H = Z2 than closed 2000 (in Russian).
subsemirings
[6] Vechtomov E. M., Orlova I. V. Cyclic Semirings with
H = {b, b2, …, bn, …}* and H1 = {a2, b2,b3, …, bn, …}* are not non idempotent and noncommutative addition,
comparable. The element b is not belongs to H1 and the Fundamental nay and prikladnaia matematika,
element a2 is not belongs to H. (Here X* denote the closure 2015, V.20, N6, pp. 17-41 (in Russian).
of X).
[7] Shevrin L. N. and Ovsyannikov A. J. Semigroups and
CONCLUSION Their Subsemigroups Lattices; Kluver Academic
In the future, we should begin to study compact semirings Publishers, Dordrecht, 1996.
S where &&&&&
$ is a chain. [8] Vechtomov E. M. Orlova I. V. Ideals and
References congruencies of cyclic semirings;Bulletin of
[1] Dedekind R. Uber die Theorie der granzen Syktyvkar University. Seria 1: Mathematics,
algebraiscen Zahlen; Supplement XI P. G. Lejeune Mechanics, Informatics, 2017, N1 (22) pp. 29 – 40
Dirichlet: Vorlesung uber Zahlentheorie 4 Aulf, (in Russian).
DruckAnd Verlag, Braunschweig, 1894. [9] Vechtomov E. M. Orlova I. V. Finite cyclic semirings
[2] Vandiver H. S. Note on a simple type of algebra in without unit; Algebra and Theory of Algorithms.
which cancellation law of addition does not hold; Vserossiiskaia Konferenzia. Ivanovo, 2018. pp. 113
Bulletin of American Mathematics Society, 1934, – 116 (in Russian).
Vol. 40, pp 914-920. [10] Tanana B. P. Topological semigroups with some
[3] Kleene S. C. Representation of events in nerve nets types of the lattices of closed subsemigroups;
and finite automata;In C. E. Shannon And McCarthy, Izvestia Vyzov. Matematika, N4, 1976, pp. 67 – 73
editors, Automata Studies, volume 34 of Annals of (in Russian).
@ IJTSRD | Unique Paper ID – IJTSRD38612 | Volume – 5 | Issue – 2 | January-February 2021 Page 1180