Results 61 to 70 of about 1,315,581 (82)

Partially Ordered, Primitive Regular Semigroups

open access: yes, 1973
The theory of partially ordered, primitive regular semigroups is developed under the hypothesis that the partial order admits enough integral idempotents. This is done in analogy to the theory of partially ordered groups. In particular, results are given
Rompke, Jurgen
core  

Ordered Response Models for Sovereign Debt Ratings [PDF]

open access: yes
Using ordered logit and probit plus random effects ordered probit approaches, we study the determinants of sovereign debt ratings. We found that the last procedure is the best for panel data as it takes into account the additional cross-section error ...
António Afonso   +2 more
core  

Externalities, Consumption Constraints and Regular Economies [PDF]

open access: yes
We consider a general model of pure exchange economies with consumption externalities. Households may have different consumption sets and each consumption set is described by a function called possibility function.
Jean-Marc Bonnisseau   +1 more
core  

On completely regular 2-duo ordered semihypergroups

Journal of Information and Optimization Sciences, 2023
The concept of duo ordered semihypergroups was introduced by Ardekani and Davvaz in 2018. In this paper, we introduce the concept of n-duo ordered semihypergroups. We show that every duo ordered semihypergroup is an n-duo ordered semihypergroup (n ≥ 2),  but the converse is not generally true.
Wichayaporn Jantanan   +4 more
openaire   +1 more source

Characterizations of Right Regular Ordered LA-Semihypergroups via Soft Hyperideals

2018
In this paper, we introduce soft hyperideals in ordered LA-semihypergroups through new approach and investigate some useful results. Further, we define right regular ordered LA-semihypergroup and characterize right regular ordered LA-semihypergroups using soft hyperideals.
M. Y. Abbasi   +2 more
openaire   +1 more source

On 3-regular 4-ordered graphs [PDF]

open access: yesDiscrete Mathematics, 2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1,…,vkof G there exists a cycle (respectively, hamiltonian cycle) in G containing these k vertices in the specified order.
Mészáros, Karola
exaly   +2 more sources

Characterizations of Some Regularities of Ordered Gamma-Semihypergroups in Terms of Interval-Valued Q-Fuzzy Gamma-Hyperideals

International Journal of Innovative Computing, Information and Control, 2021
Sanpan, Hataikhan   +3 more
openaire   +1 more source

Regularities in Ordered n-Ary Semihypergroups

Mathematics, 2021
Jukkrit Daengsaen   +1 more
exaly  

A novel investigation on fuzzy hyperideals in ordered $$*$$-semihypergroups

Computational and Applied Mathematics, 2021
Naveed Yaqoob
exaly  

A new approach towards int-soft hyperideals in ordered ternary semihypergroups

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Kostaq Hila
exaly  

Home - About - Disclaimer - Privacy