Genesis and evolution of the Evx and Mox genes and the extended Hox and ParaHox gene clusters

Background: Hox and ParaHox gene clusters are thought to have resulted from the duplication of a ProtoHox gene cluster early in metazoan evolution. However, the origin and evolution of the other genes belonging to the extended Hox group of homeobox-containing genes, that is, Mox and Evx, remains obscure. We constructed phylogenetic trees with mouse, amphioxus and Drosophila extended Hox and other related Antennapedia-type homeobox gene sequences and analyzed the linkage data available for such genes.Results: We claim that neither Mox nor Evx is a Hox or ParaHox gene. We propose a scenariothat reconciles phylogeny with linkage data, in which an Evx/Mox ancestor gene linked to aProtoHox cluster was involved in a segmental tandem duplication event that generated an arrayof all Hox-like genes, referred to as the `coupled¿ cluster. A chromosomal breakage within thiscluster explains the current composition of the extended Hox cluster (with Evx, Hox and Moxgenes) and the ParaHox cluster.Conclusions: Most studies dealing with the origin and evolution of Hox and ParaHox clustershave not included the Hox-related genes Mox and Evx. Our phylogenetic analyses and theavailable linkage data in mammalian genomes support an evolutionary scenario in which anancestor of Evx and Mox was linked to the ProtoHox cluster, and that a tandem duplication of alarge genomic region early in metazoan evolution generated the Hox and ParaHox clusters, plusthe cluster-neighbors Evx and Mox. The large `coupled¿ Hox-like cluster EvxHox/MoxParaHox wassubsequently broken, thus grouping the Mox and Evx genes to the Hox clusters, and isolating theParaHox cluster.

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.

A maximal domain of preferences for tops-only rules in the division problem

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, continuity, and "tops-onlyness". These domains (called weakly single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.

Factor decomposition of spatial income inequality: a revision

Duro and Esteban (1998) proposed an additive decomposition of Theil populationweighted index by four income multiplicative factors (in spatial contexts). This note makes some additional methodological points: first, it argues that interaction effects are taken into account in the factoral indexes although only in a fairly restrictive way. As a consequence, we suggest to rewrite the decomposition formula as a sum of strict Theil indexes plus the interactive terms; second, it might be instructive to aggregate some of the initial factors; third, this decomposition can be immediately extended to the between- and within-group components.

The density of injective endomorphisms of a free group

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

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.

Inter-group conflict and intra-group punishment in an experimental contest game

We study how conflict in a contest game is influenced by rival parties being groups and by group members being able to punish each other. Our main motivation stems from the analysis of socio-political conflict. The relevant theoretical prediction in our setting is that conflict expenditures are independent of group size and independent of whether punishment is available or not. We find, first, that our results contradict the independence of group-size prediction: conflict expenditures of groups are substantially larger than those of individuals, and both are substantially above equilibrium. Towards the end of the experiment material losses in groups are 257% of the predicted level. There is, however, substantial heterogeneity in the investment behaviour of individual group members. Second, allowing group members to punish each other after individual contributions to the contest effort are revealed leads to even larger conflict expenditures. Now material losses are 869% of the equilibrium level and there is much less heterogeneity in individual group members' investments. These results contrast strongly with those from public goods experiments where punishment enhances efficiency and leads to higher material payoffs.