Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Dariush Heidari"'
Autor:
Dariush Heidari, Irina Cristea
Publikováno v:
Mathematics, Vol 8, Iss 7, p 1064 (2020)
In this paper, we define and study the concept of the factorizable semihypergroup, i.e., a semihypergroup that can be written as a hyperproduct of two proper sub-semihypergroups. We consider some classes of semihypergroups such as regular semihypergr
Externí odkaz:
https://doaj.org/article/31cd98ec10df47efaaebb91f2691c63c
Autor:
Dariush Heidari, Irina Cristea
Publikováno v:
Symmetry, Vol 11, Iss 1, p 100 (2019)
In this paper, we introduce and characterize the breakable semihypergroups, a natural generalization of breakable semigroups, defined by a simple property: every nonempty subset of them is a subsemihypergroup. Then, we present and discuss on an exten
Externí odkaz:
https://doaj.org/article/2f6fae1a16ee46bd9510ac50a645359e
Autor:
Dariush Heidari, Saeed Doostali
Publikováno v:
Soft Computing. 25:7247-7256
Symbolic execution is one of the most important testing techniques to ensure the quality of software systems that need to be dependable and reliable. This technique systematically explores the program of the subject system which is represented by an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca51bd4c0e5744cd7e692a17efcc9d08
https://doi.org/10.1007/s00500-021-05812-3
https://doi.org/10.1007/s00500-021-05812-3
Autor:
Dariush Heidari, Bijan Davvaz
Publikováno v:
Eurasian Mathematical Journal. 11:35-41
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::caea450029fb7844deebb50953cefabb
https://doi.org/10.32523/2077-9879-2020-11-3-35-41
https://doi.org/10.32523/2077-9879-2020-11-3-35-41
Autor:
Dariush Heidari
Publikováno v:
Afrika Matematika. 31:585-588
In this paper, we prove various inclusion relationships among different classes of algebraic structures and hyperstructures of type U on the right of finite size. In particular, we consider in detail the inclusion properties $$\mathcal{G}_n\subseteq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c258b6b5e164e13bee50c5a74fa4a5bf
https://doi.org/10.1007/s13370-019-00743-7
https://doi.org/10.1007/s13370-019-00743-7
Autor:
Dariush Heidari, Bijan Davvaz
Publikováno v:
Algebraic structures and their applications. 6:49-56
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f21b050da0e6e99e7129aaa724391ec
https://doi.org/10.29252/asta.6.1.49
https://doi.org/10.29252/asta.6.1.49
Publikováno v:
Communications in Algebra. 47:2209-2219
Polygroups are a generalization of groups in which the composition of any two elements are a non-empty set. In this paper, first we recall the concept of polygroups and introduce a new construction...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b156dad002aaea593c61ca68dc047389
https://doi.org/10.1080/00927872.2018.1530254
https://doi.org/10.1080/00927872.2018.1530254
Autor:
Domenico Freni, Dariush Heidari
In this paper, we prove that the minimum size of a hypergroup of type U on the right which contains a proper subsemihypergroup of type U on the right of size 6 and a subgroup of size ≥2 is 18. We s...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f84b418ef6211a52af419de4d514f31e
http://hdl.handle.net/11390/1184479
http://hdl.handle.net/11390/1184479
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 39:707-721
This paper deals with certain algebraic systems called polygroups. A polygroup is a completely regular, reversible in itself hypergroup. The concept of topological polygroups is a generalization of the concept of topological groups. In this paper, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c537c424c58a290a46e8537a7c7ecb8
https://doi.org/10.1007/s40840-015-0136-y
https://doi.org/10.1007/s40840-015-0136-y
Autor:
Dariush Heidari, Bijan Davvaz
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 11:1950047
In this paper, we consider polygroup [Formula: see text] and prove necessary and sufficient conditions such that [Formula: see text] is non-commutative. Then by using the Maple programming, we obtain all polygroups of order less than five up to isomo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d97abb1da1460a0d74ec6929965fbc1d
https://doi.org/10.1142/s1793830919500472
https://doi.org/10.1142/s1793830919500472