A lattice-ordered abelian group is called ultrasimplicial iff every finite set of positive elements belongs to the monoid generated by some finite set of positive Z-independent elements. This property originates from Elliott's classification of AF C U -algebras. Using fans and their desingularizatio
Monoids of Intervals of Ordered Abelian Groups
β Scribed by Friedrich Wehrung
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 423 KB
- Volume
- 182
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
For any partially ordered abelian group G, we relate the structure of the ordered Ž . Ž monoid ⳠG of inter¨als of G i.e., nonempty, upward directed lower subsets of . G , to various properties of G, as for example interpolation properties, or topological properties of the state space when G has an order-unit. This allows us to solve a problem by K. R. Goodearl by proving that even in most natural cases, multiplier groups of dimension groups often fail to be interpolation groups. Furthermore, the study of monoids of intervals in the totally ordered case yields a characterization of Hahn powers of the real line by a first-order sentence on the positive interval monoid.
π SIMILAR VOLUMES
A new strict hierarchy for the pseudovariety of aperiodic monoids is described. The nth level of the hierarchy is the pseudovariety of all divisors of monoids of full transformations of finite chains respecting some n-chain of inter¨als. The levels can be obtained by iterated semidirect product of t
We consider the framework of pairwise comparison matrices over abelian linearly ordered groups. We introduce the notion of -proportionality that allows us to provide new characterizations of the consistency, efΓcient algorithms for checking the consistency and for building a consistent matrix. Moreo
## Abstract We prove that, with the single exception of the 2βgroup __C__, the Cayley table of each Abelian group appears in a face 2βcolorable triangular embedding of a complete regular tripartite graph in an orientable surface. Β© 2009 Wiley Periodicals, Inc. J Combin Designs 18: 71β83, 2010
Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a