Refinement monoids and adaptable separated graphs
نویسندگان
چکیده
منابع مشابه
Embedding simple commutative monoids into simple refinement monoids
Say that a cone is a commutative monoid that is in addition conical, i.e., satisfies x+y=0 ⇒ x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind, satisfying in addition various divisibility conditions. We do this in particular for all cones, or for all separative cones, or for all...
متن کاملSynchronization 5: Graphs and monoids
From graphs to monoids and back In this section of the notes we describe a pair of maps between graphs on the vertex set Ω and transformation monoids on Ω. These maps do not form a 'Galois correspondence' but have some nice properties relevant to the synchronization project. Since G will always be a group, we use X to denote a graph. From graphs to monoids The map in this direction is simple: t...
متن کاملEndomorphism monoids of chained graphs
For any complete chain I whose distinct elements are separated by cover pairs, and for every family {Mi | i∈ I} of monoids, we construct a family of graphs {Gi | i∈ I} such that Gi is a proper induced subgraph of Gj for all i; j∈ I with i ¡ j, Gi = ⋂ {Gj | j∈ I; i ¡ j} whenever i = inf{ j∈ I | j¿ i} in I , Gi = ⋃ {Gj | j∈ I; j ¡ i} whenever i = sup{ j∈ I | j¡ i} in I , the endomorphism monoid o...
متن کاملSpatial Query Optimization Utilizing Early Separated Filter and Refinement Strategy
| Due to the high complexity and large volume of spatial data, a spatial query is usually processed in two steps, called the lter step and the re nement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of...
متن کاملSpatial Query Optimization Utilizingearly Separated Filter and Refinement
| Due to the high complexity and large volume of spatial data, a spatial query has been processed in two steps, called the lter step and the reenement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2019
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-019-10077-2