نتایج جستجو برای: l convex ideals

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

2010
Damir Filipović Gregor Svindland

In this paper we establish a one-to-one correspondence between lawinvariant convex risk measures on L∞ and L. This proves that the canonical model space for the predominant class of law-invariant convex risk measures is L.

2008
G. ARANDA PINO E. PARDO M. SILES

In this paper a bijection between the set of prime ideals of a Leavitt path algebra L K (E) and a certain set which involves maximal tails in E and the prime spectrum of K[x, x −1 ] is established. Necessary and sufficient conditions on the graph E so that the Leavitt path algebra L K (E) is primitive are also found.

Journal: :journal of algebra and related topics 2014
s. ebrahimi atani s. dolati pish hesari m. khoramdel

in this paper, we introduce the notion of primal strong co-ideals and give some results involving them. it is shown thatsubtractive strong co-ideals are intersection of all primal strong co-ideals that contain them. also we prove that the representation of strong co-ideals as reduced intersections of primal strong co-ideals is unique.

Journal: :Journal of the Royal Statistical Society: Series B (Statistical Methodology) 2017

Journal: :Filomat 2022

In this paper, the relationships of induced L-convex spaces with L-hull operators, product spaces, and quotient are discussed. It is shown that structure exactly by convex structure. Moreover, sub-S1, sub- S2, S2 S3 separation axioms introduced in spaces. Some properties them investigated.

Journal: :European Journal of Operational Research 1999
Jesús Mario Bilbao Esperanza A. Lebrón N. Jiménez

A game on a convex geometry is a real-valued function de®ned on the family L of the closed sets of a closure operator which satis®es the ®nite Minkowski±Krein±Milman property. If L is the Boolean algebra 2 N then we obtain a n-person cooperative game. We will introduce convex and quasi-convex games on convex geometries and we will study some properties of the core and the Weber set of these games.

Journal: :Proceedings of the Japan Academy, Series A, Mathematical Sciences 1970

1997
Ralph Freese

An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that this ordered set can be computed in time O(n 2 log 2 n), where n = jLj. This paper is motivated by the problem of eeciently calculating and representing the congruence lattice Con L of a nite lattice L. Of cou...

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

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