نتایج جستجو برای: ordered semihypergroups

تعداد نتایج: 50793  

Journal: :bulletin of the iranian mathematical society 2012
renyu zhao

let r be a ring, m a right r-module and (s,≤) a strictly ordered monoid. in this paper we will show that if (s,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ s, then the module [[ms,≤]] of generalized power series is a uniserial right [[rs,≤]] ]]-module if and only if m is a simple right r-module and s is a chain monoid.

Journal: :bulletin of the iranian mathematical society 2015
m. mahmoudi h. moghbeli-damaneh

in this paper, some categorical properties of the category ${bf cpo}_{{bf act}text{-}s}$ of all {cpo $s$-acts}, cpo's equipped with actions of a monoid $s$ on them, and strict continuous action-preserving maps between them is considered. in particular, we describe products and coproducts in this category, and consider monomorphisms and epimorphisms. also, we show that the forgetful functor from...

Journal: :journal of agricultural science and technology 2016
a. elias m. nohmi k. yasunobu a. ishida

customer satisfaction is the most important element for developing and sustaining organizational priorities and practices. thus, we examined farmers’ overall satisfaction with agricultural extension services and its determinants using data collected from 150 beneficiary farmers in north west ethiopia. the findings show that about 55% of the interviewees were satisfied whereas 45% of them were d...

Journal: :J. Comb. Theory, Ser. A 1994
William F. Doran IV

C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted ~K,,.,. In this paper, we generalize his work by defining a new operation on ordered pairs of lattices called shuffling. L1 shuffle L2 is denoted by L 1 M L2. The resulting L 1 M L 2 are not necessarily lattices but are posets. The lattices ~/U~, n correspond to the special cases N, ~ Nm. In this paper,...

2012
Manny Rayner Pierrette Bouillon Johanna Gerlach

We describe an experiment carried out using a French version of CALL-SLT, a web-enabled CALL game in which students at each turn are prompted to give a semi-free spoken response which the system then either accepts or rejects. The central question we investigate is whether the response is appropriate; we do this by extracting pairs of utterances where both members of the pair are responses by t...

Journal: :Australasian J. Combinatorics 2009
Vincent E. Castellana D. G. Hoffman

A Minimal Cover by Triples is an ordered pair (V, T ) where V is a finite set and T is a collection of three-element subsets of V with the properties that every pair of elements of V appear together in at least one element of T and if any element of T is removed, the first property no longer holds. In this paper we explore the possible values |T | can take on for a given |V |. In addition, cons...

2016
Wei-Dong Jiang Feng Qi Gradimir V. Milovanović

We find the greatest value λ and the least value μ such that the double inequality C(λa + (1 − λ)b, λb+ (1 − λ)a) < αA(a, b) + (1 − α)T (a, b) < C(μa + (1 − μ)b, μb+ (1− μ)a) holds for all α ∈ (0, 1) and a, b > 0 with a 6= b, where C(a, b), A(a, b), and T (a, b) denote respectively the contraharmonic, arithmetic, and Toader means of two positive numbers a and b.

2010
Dahai Fu Yanrui Wu Yihong Tang

Ownership structure and industry characteristics as internal and external factors respectively significantly impact the export performance of Chinese manufacturing firms. Three different yet related models, namely, logit, tobit and ordered probit models, that correspond to three different indicators of export performance are considered. It was found that the export performance of Chinese manufa...

Journal: :Electr. J. Comb. 2015
Jian Liu Andrew Y. Z. Wang

A bipartition of n is an ordered pair of partitions (λ, μ) such that the sum of all of the parts equals n. In this article, we concentrate on the function c5(n), which counts the number of bipartitions (λ, μ) of n subject to the restriction that each part of μ is divisible by 5. We explicitly establish four Ramanujan type congruences and several infinite families of congruences for c5(n) modulo 3.

2013
Melissa Santini

Introduction The beginning chapter in the UCSMP Geometry book introduces students to four definitions of a point dot as a point, location as a point, ordered pair as a point, and a network node as a point. A lot of information is presented to students but not necessarily a lot of physical experience with each idea. The Artistic Expression Institute in the Educator's Science and Mathematics Inst...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید