Automorphisms of Partially Commutative Groups II: Combinatorial Subgroups

We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show how Aut(G) decomposes in terms of the connected components of C: obtaining a particularly clear decomposition theorem in the special case where C has no isolated vertices. If C has no vertices of a type we call dominated then we give a semi-direct decompostion of Aut(G) into a subgroup of locally conjugating automorphisms by the subgroup stabilising a certain lattice of "admissible subsets" of the vertices of C. We then characterise those graphs for which Aut(G) is a product (not necessarily semi-direct) of two such subgroups.Comment: 7 figures, 63 pages. Notation and definitions clarified and typos corrected. 2 new figures added. Appendix containing details of presentation and proof of a theorem adde

East Asia and the global/transatlantic/Western crisis

This paper introduces the special collection on East Asia and the Global Crisis. After justifying why a focus on East Asia is appropriate, it draws out the main themes that run through the individual contributions. These are the extent to which the region is decoupling from the global economy (or the West), the increasing legitimacy of statist alternatives to neoliberal development strategies, and the impact of crises on the definition of ―region‖ and the functioning of regional institutions and governance mechanisms

Faster linearizability checking via PP-compositionality

Linearizability is a well-established consistency and correctness criterion for concurrent data types. An important feature of linearizability is Herlihy and Wing's locality principle, which says that a concurrent system is linearizable if and only if all of its constituent parts (so-called objects) are linearizable. This paper presents $P$-compositionality, which generalizes the idea behind the locality principle to operations on the same concurrent data type. We implement $P$-compositionality in a novel linearizability checker. Our experiments with over nine implementations of concurrent sets, including Intel's TBB library, show that our linearizability checker is one order of magnitude faster and/or more space efficient than the state-of-the-art algorithm.Comment: 15 pages, 2 figure