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.

Pure braid subgroups of braided Thompson's groups

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

Minimal lenght elements of Thompson's groups F(p)

We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.

Metric properties of the braided Thompson's groups

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

Tree automorphisms and quasi-isometries of Thompson's group F

We prove that automorphisms of the infinite binary rooted tree T2 do not yield quasi-isometries of Thompson's group F, except for the map which reverses orientation on the unit interval, a natural outer automorphism of F. This map, together with the identity map, forms a subgroup of Aut(T2) consisting of 2-adic automorphisms, following standard terminology used in the study of branch groups. However, for more general p, we show that the analgous groups of p-adic tree automorphisms do not give rise to quasiisometries of F(p).

Conjugacy in Thompson's groups

We give a unified solution the conjugacy problem in Thompson’s groups F, V , and T using strand diagrams, and we analyze the complexity of the resulting algorithms.

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.

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.

The simultaneous conjugacy problem in groups of piecewise linear functions

Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give an elementary proof for the solution of the latter question. This relies purely on the description of F as the group of piecewise linear orientation-preserving homeomorphisms of the unit. The techniques we develop allow us also to solve the ordinary conjugacy problem as well, and we can compute roots and centralizers. Moreover, these techniques can be generalized to solve the same questions in larger groups of piecewise-linear homeomorphisms.

Imatges i paraules : poesia visual catalana a la primera avantguarda

Es pregunta pels trets característics de la poesia visual de la primera avantguarda, els que resten fidels a la inspiració europea i els que sorgeixen com a resposta particular mediatitzada per unes determinades condicions socioculturals, i de quina manera aquests trets prenen cos en la producció poètica.

eJugueteLandia

En aquest projecte s'han desenvolupat tecnologies d'avantguarda, com ara la plataforma J2EE de Sun Microsystems i Jakarta Tomcat de Apache, totes de reconegut prestigi en la comunitat OpenSource. No s'han d'oblidar tampoc totes les que fan d'aquest projecte una solució professional, com ara XHTML o JavaScript.

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.