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.

Elements of algebraic geometry and the positive theory of partially commutative groups

The first main result of the paper is a criterion for a partially commutative group G to be a domain. It allows us to reduce the study of algebraic sets over G to the study of irreducible algebraic sets, and reduce the elementary theory of G (of a coordinate group over G) to the elementary theories of the direct factors of G (to the elementary theory of coordinate groups of irreducible algebraic sets). Then we establish normal forms for quantifier-free formulas over a non-abelian directly indecomposable partially commutative group H. Analogously to the case of free groups, we introduce the notion of a generalised equation and prove that the positive theory of H has quantifier elimination and that arbitrary first-order formulas lift from H to H * F, where F is a free group of finite rank. As a consequence, the positive theory of an arbitrary partially commutative group is decidable.

Dynamics in Thompson's group F

We describe an explicit relationship between strand diagrams and piecewise-linear functions for elements of Thompson’s group F. Using this correspondence, we investigate the dynamics of elements of F, and we show that conjugacy of one-bump functions can be described by a Mather-type invariant.

SelenoDB 1.0 : a database of selenoprotein genes, proteins and SECIS elements

Selenoproteins are a diverse group of proteinsusually misidentified and misannotated in sequencedatabases. The presence of an in-frame UGA (stop)codon in the coding sequence of selenoproteingenes precludes their identification and correctannotation. The in-frame UGA codons are recodedto cotranslationally incorporate selenocysteine,a rare selenium-containing amino acid. The developmentof ad hoc experimental and, more recently,computational approaches have allowed the efficientidentification and characterization of theselenoproteomes of a growing number of species.Today, dozens of selenoprotein families have beendescribed and more are being discovered in recentlysequenced species, but the correct genomic annotationis not available for the majority of thesegenes. SelenoDB is a long-term project that aims toprovide, through the collaborative effort of experimentaland computational researchers, automaticand manually curated annotations of selenoproteingenes, proteins and SECIS elements. Version 1.0 ofthe database includes an initial set of eukaryoticgenomic annotations, with special emphasis on thehuman selenoproteome, for immediate inspectionby selenium researchers or incorporation into moregeneral databases. SelenoDB is freely available athttp://www.selenodb.org.

Primers resultats dels estudis dels elements marmoris del jaciment de l'antiguitat tardana del Pla de Ses Figueres de l'illa de Cabrera

El Pla de ses Figueres és un jaciment que es troba a la riba del port de Cabrera, una petita illa de 1.836 ha. situada en el sud de les illes Balears. Diversos treballs de prospecció i d’excavació han donat a conèixer una important ocupació humana del lloc centrada en els segles V a VII dC. A les zones intervingudes s’han identificat una factoria de salaons, un possible taller de producció de porpra i una necròpoli. En el present treball s’exposaran set peces de marbre localitzades en dit jaciment dintre del projecte “Recuperació, consolidació i museïtzació del monestir bizantí de l’illa de Cabrera”, el qual ja fa dotze anys que finança ininterrompudament l’Ajuntament de Palma.

Group preference structures in AHP–group decision making

This paper presents a procedure that allows us to determine the preference structures(PS) associated to each of the different groups of actors that can be identified in a groupdecision making problem with a large number of individuals. To that end, it makesuse of the Analytic Hierarchy Process (AHP) (Saaty, 1980) as the technique to solvediscrete multicriteria decision making problems. This technique permits the resolutionof multicriteria, multienvironment and multiactor problems in which subjective aspectsand uncertainty have been incorporated into the model, constructing ratio scales correspondingto the priorities relative to the elements being compared, normalised in adistributive manner (wi = 1). On the basis of the individuals’ priorities we identifydifferent clusters for the decision makers and, for each of these, the associated preferencestructure using, to that end, tools analogous to those of Multidimensional Scaling.The resulting PS will be employed to extract knowledge for the subsequent negotiationprocesses and, should it be necessary, to determine the relative importance of thealternatives being compared using anyone of the existing procedures

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.

Bounding right-arm rotation distances

Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson's group F with respect to different generating sets, including both finite and infinite generating sets.

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.

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."