Tropical varieties for non-archimedean analytic spaces

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

Shelah's singular compactness theorem

We present Shelah’s famous theorem in a version for modules, together with a self-contained proof and some examples. This exposition is based on lectures given at CRM in October 2006.

┴N as an Abstract Elementary Class

"Vegeu el resum a l'inici del documents 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.

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.

Strongly non-degenerate Lie algebras

Let A be a semiprime 2 and 3-torsion free non-commutative associative algebra. We show that the Lie algebra Der(A) of(associative) derivations of A is strongly non-degenerate, which is a strong form of semiprimeness for Lie algebras, under some additional restrictions on the center of A. This result follows from a description of the quadratic annihilator of a general Lie algebra inside appropriate Lie overalgebras. Similar results are obtained for an associative algebra A with involution and the Lie algebra SDer(A) of involution preserving derivations of A

Catalan's intervals and realizers of triangulations

The Stanley lattice, Tamari lattice and Kreweras lattice are three remarkable orders defined on the set of Catalan objects of a given size. These lattices are ordered by inclusion: the Stanley lattice is an extension of the Tamari lattice which is an extension of the Kreweras lattice. The Stanley order can be defined on the set of Dyck paths of size n as the relation of being above. Hence, intervals in the Stanley lattice are pairs of non-crossing Dyck paths. In a former article, the second author defined a bijection Φ between pairs of non-crossing Dyck paths and the realizers of triangulations (or Schnyder woods). We give a simpler description of the bijection Φ. Then, we study the restriction of Φ to Tamari’s and Kreweras’ intervals. We prove that Φ induces a bijection between Tamari intervals and minimal realizers. This gives a bijection between Tamari intervals and triangulations. We also prove that Φ induces a bijection between Kreweras intervals and the (unique) realizers of stack triangulations. Thus, Φ induces a bijection between Kreweras intervals and stacktriangulations which are known to be in bijection with ternary trees.

Contraction groups in complete Kac-Moody groups

Let G be an abstract Kac-Moody group over a finite field and G the closure of the image of G in the automorphism group of its positive building. We show that if the Dynkin diagram associated to G is irreducible and neither of spherical nor of affine type, then the contraction groups of elements in G which are not topologically periodic are not closed. (In those groups there always exist elements which are not topologically periodic.)

Projective modules over the Gerasimov-Sakhaev counterexample

We investigate the structure of the so-called Gerasimov- Sakhaev counterexample, which is a particular example of a universal localization, and classify (both finitely and infinitely generated) projective modules over it.

Parabolic and quasiparabolic subgroups of free partially commutative groups

Let Γ be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph Γ, which we call canonical parabolic subgroups. A natural extension of the definition leads to canonical quasiparabolic subgroups. It is shown that the centralisers of subsets of G are the conjugates of canonical quasiparabolic centralisers satisfying certain graph theoretic conditions.

Una aproximació al pensament algebraic a l'Espanya del segle XVI: estudi del manuscrit 2294 de la Biblioteca de la Universitat de Salamanca

Aquest treball analitza el “Tratado y libro de arte mayor o álgebra” que forma part del manuscrit 2294 de la Biblioteca de la Universitat de Salamanca, datat el 1590. El seu autor és Diego Pérez de Mesa. L’objectiu d’aquest estudi és aportar nous elements que ajudin a entendre quin era l’estatus de l’àlgebra a la Península Ibèrica en un segle que va ser clau en el seu desenvolupament. Primer es descriu el manuscrit i després es reflexiona sobre les seves aportacions a la matemàtica, mostrant algunes característiques originals d’aquesta àlgebra enfront d’altres àlgebres de la Península Ibèrica del segle XVI.

Encryption methods using formal power series rings

Recently there has been a great deal of work on noncommutative algebraic cryptography. This involves the use of noncommutative algebraic objects as the platforms for encryption systems. Most of this work, such as the Anshel-Anshel-Goldfeld scheme, the Ko-Lee scheme and the Baumslag-Fine-Xu Modular group scheme use nonabelian groups as the basic algebraic object. Some of these encryption methods have been successful and some have been broken. It has been suggested that at this point further pure group theoretic research, with an eye towards cryptographic applications, is necessary.In the present study we attempt to extend the class of noncommutative algebraic objects to be used in cryptography. In particular we explore several different methods to use a formal power series ring R && x1; :::; xn && in noncommuting variables x1; :::; xn as a base to develop cryptosystems. Although R can be any ring we have in mind formal power series rings over the rationals Q. We use in particular a result of Magnus that a finitely generated free group F has a faithful representation in a quotient of the formal power series ring in noncommuting variables.

Discriminating groups: a comprehensive overview

Discriminating groups were introduced by G.Baumslag, A.Myasnikov and V.Remeslennikov as an outgrowth of their theory of algebraic geometry over groups. However they have taken on a life of their own and have been an object of a considerable amount of study. In this paper we survey the large array results concerning the class of discriminating groups that have been developed over the past decade.

The equation xpyq=zr and groups that act freely on Λ-trees

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

Anàlisi del sistema operatiu RTLinux e implementació d'un entorn de desenvolupament de tasques en temps real (aplicat al control de processos)

El projecte "Anàlisi del sistema operatiu RTLinux i implementació d'un entorn de desenvolupament de tasques en temps real" analitza la possibilitat de crear un entorn de desenvolupament de tasques en temps real per poder crear sistemes de control complex, tot això mitjançant codi lliure. Inicialment es fa un aprenentatge sobre el concepte de temps real, després s'elegeix el sistema operatiu en temps real RTLinux per a crear l'entorn de desenvolupament utilitzant el llenguatge de programació Tcl/Tk. Es creen un conjunt d'aplicacions (pel control computacional) per estudiar la viabilitat de la construcció de l'entorn desitjat per facilitar la tasca de l'usuari final. Aquest projecte obre multitud de possibles camins a continuar: comunicació remota, implementació de planificadors, estudi de controladors, etc.