Dynamical systems of type (m,n) and their C*-algebras

Given positive integers n and m, we consider dynamical systems in which n copies of a topological space is homeomorphic to m copies of that same space. The universal such system is shown to arise naturally from the study of a C*-algebra we denote by Om;n, which in turn is obtained as a quotient of the well known Leavitt C*-algebra Lm;n, a process meant to transform the generating set of partial isometries of Lm;n into a tame set. Describing Om;n as the crossed-product of the universal (m; n) -dynamical system by a partial action of the free group Fm+n, we show that Om;n is not exact when n and m are both greater than or equal to 2, but the corresponding reduced crossed-product, denoted Or m;n, is shown to be exact and non-nuclear. Still under the assumption that m; n &= 2, we prove that the partial action of Fm+n is topologically free and that Or m;n satisfies property (SP) (small projections). We also show that Or m;n admits no finite dimensional representations. The techniques developed to treat this system include several new results pertaining to the theory of Fell bundles over discrete groups.

The generator problem for Z-stable C*-algebras

The generator problem was posed by Kadison in 1967, and it remains open until today. We provide a solution for the class of C*-algebras absorbing the Jiang-Su algebra Z tensorially. More precisely, we show that every unital, separable, Z-stable C*-algebra A is singly generated, which means that there exists an element x є A that is not contained in any proper sub-C*- algebra of A. To give applications of our result, we observe that Z can be embedded into the reduced group C*-algebra of a discrete group that contains a non-cyclic, free subgroup. It follows that certain tensor products with reduced group C*-algebras are singly generated. In particular, C*r (F ∞) ⨂ C*r (F ∞) is singly generated.

The unbounded dead-end depth propertie is not a group invariant

Vegeu el resum a l'inici del document del fitxer adjunt

Examples of retracts in a free group that are not the fixed subgroup of any group of automorphisms

Let F be a free group of rank at least three. We show that some retracts of F previously studied by Martino-Ventura are not equal to the fixed subgroup of any group of automorphisms of F. This shows that, in F, there exist subgroups that are equal to the fixed subgroup of some set of endomorphisms but are not equal to the fixed subgroup of any set of automorphisms. Moreover, we determine the Galois monoids of these retracts, where, by the Galois monoid of a subgroup H of F, we mean the monoid consisting of all endomorphisms of F that fix H.

The automorphism group of a free-by-cyclic group in rank 2

Vegeu el resum a l'inici del document del fitxer adjunt

Growth of positive words and lower bounds of the growth rate for Thompson's group (F)p

Vegeu el resum a l'inici del document del fitxer adjunt.

Computational explorations in Thompson's group F

Here we describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult question whether or not Thompson's group is amenable. We also describe experiments to estimate the exponential growth rate of F and the rate of escape of symmetric random walks with respect to the standard generating set.

Combinatorial and metric properties of Thompson's group T

We discuss metric and combinatorial properties of Thompson's group T, such as the normal forms for elements and uniqueness of tree pair diagrams. We relate these properties to those of Thompson's group F when possible, and highlight combinatorial differences between the two groups. We define a set of unique normal forms for elements of T arising from minimal factorizations of elements into convenient pieces. We show that the number of carets in a reduced representative of T estimates the word length, that F is undistorted in T, and that cyclic subgroups of T are undistorted. We show that every element of T has a power which is conjugate to an element of F and describe how to recognize torsion elements in T.

On group strategy-proof mechanisms for a many-to-one matching model

For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of preferences (which contains the domain of responsive preferences of the college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking Lemma holds as well. We exhibit an example showing that none of these three results remain true if the preferences of firms are substitutable but not quota q-separable.

When does universal peace prevail? Secession and group formation in rent seeking contests and policy conflicts

This paper analyzes secession and group formation in a general model of contest inspired by Esteban and Ray (1999). This model encompasses as special cases rent seeking contests and policy conflicts, where agents lobby over the choice of a policy in a one-dimensional policy space. We show that in both models the grand coalition is the efficient coalition structure and agents are always better off in the grand coalition than in a symmetric coalition structure. Individual agents (in the rent seeking contest) and extremists (in the policy conflict) only have an incentive to secede when they anticipate that their secession will not be followed by additional secessions. Incentives to secede are lower when agents cooperate inside groups. The grand coalition emerges as the unique subgame perfect equilibrium outcome of a sequential game of coalition formation in rent seeking contests.

The density of injective endomorphisms of a free group

"Vegeu el resum a l'inici del document del fitxer adjunt."

The Cuntz semigroup, the Elliott conjecture, and dimension functions on C*-Algebras

We prove that the Cuntz semigroup is recovered functorially from the Elliott invariant for a large class of C¤-algebras. In particular, our results apply to the largest class of simple C¤-algebras for which K-theoretic classification can be hoped for. This work has three significant consequences. First, it provides new conceptual insight into Elliott's classification program, proving that the usual form of the Elliott conjecture is equivalent, among Z-stable algebras, to a conjecture which is in general substantially weaker and for which there are no known counterexamples. Second and third, it resolves, for the class of algebras above, two conjectures of Blackadar and Handelman concerning the basic structure of dimension functions on C¤-algebras. We also prove in passing that the Kuntz-Pedersen semigroup is recovered functorially from the Elliott invariant for all simple unital C¤-algebras of interest.

Real rank zero algebras have the corona factorization property

The purpose of this short note is to prove that a stable separable C*-algebra with real rank zero has the so-called corona factorization property, that is, all the full multiplier projections are properly in finite. Enroute to our result, we consider conditions under which a real rank zero C*-algebra admits an injection of the compact operators (a question already considered in [21]).

Organisational structure, communication and group ethics

This paper investigates experimentally how organisational decision processes affect the moral motivations of actors inside a firm that must forego profits to reduce harming a third party. In a "vertical" treatment, one insider unilaterally sets the harm-reduction strategy; the other can only accept or quit. In a "horizontal" treatment, the insiders decide by consensus. Our 2-by-2 design also controls for communication effects. In our data, communication makes vertical firms more ethical; voice appears to mitigate "responsibility-alleviation" in that subordinates with voice feel responsible for what their firms do. Vertical firms are then more ethical than the horizontal firms for which our bargaining data reveal a dynamic form of responsibility-alleviation and our chat data indicate a strong "insider-outsider" effect.

Chain conditions for Leavitt path algebras

In this paper, results known about the artinian and noetherian conditions for the Leavitt path algebras of graphs with finitely many vertices are extended to all row-finite graphs. In our first main result, necessary and sufficient conditions on a row-finite graph E are given so that the corresponding (not necessarily unital) Leavitt path K-algebra L(E) is semisimple. These are precisely the algebras L(E)for which every corner is left (equivalently, right)artinian. They are also precisely the algebras L(E) for which every finitely generated left (equivalently, right) L(E)-module is artinian. In our second main result, we give necessary and sufficient conditions for every corner of L(E) to be left (equivalently, right) noetherian. They also turn out to be precisely those algebras L(E) for which every finitely generated left(equivalently, right) L(E)-module is noetherian. In both situations, isomorphisms between these algebras and appropriate direct sums of matrix rings over K or K[x, x−1] are provided. Likewise, in both situations, equivalent graph theoretic conditions on E are presented.