A Note on the periodic orbits and topological entropy of graph maps

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits

What is the european social model? an aproximation based on Spanish case

The public perception of the EU in Spain varies greatly. The most positive aspects of Spanish membership are associated with the consolidation of democracy, economic growth, the introduction of the euro, the growth in employment and structural and cohesion funds, the increase in the female participation rate, and the equal opportunities policies. The analysts are in favour of common objectives in the employment policy and multi-level government. The less positive aspects of the EU are the risks of losing social protection and loss of employment in some sectors due to mergers of multinationals and delocalization of companies towards Eastern Europe. The continuous demands for reform of the welfare state, the toughening of the conditions of access to social benefit and the reform of the labour market are also seen as problematic issues. Risks of competitive cuts and social dumping.

Free triples, large indifference classes and the majority rule

We present a new domain of preferences under which the majority relation is always quasi-transitive and thus Condorcet winners always exist. We model situations where a set of individuals must choose one individual in the group. Agents are connected through some relationship that can be interpreted as expressing neighborhood, and which is formalized by a graph. Our restriction on preferences is as follows: each agent can freely rank his immediate neighbors, but then he is indifferent between each neighbor and all other agents that this neighbor "leads to". Hence, agents can be highly perceptive regarding their neighbors, while being insensitive to the differences between these and other agents which are further removed from them. We show quasi-transitivity of the majority relation when the graph expressing the neighborhood relation is a tree. We also discuss a further restriction allowing to extend the result for more general graphs. Finally, we compare the proposed restriction with others in the literature, to conclude that it is independent of any previously discussed domain restriction.

Restricted walks in regular trees

Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.

Stable rank of leavitt path algebra

We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.

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.

Orthogonal systems in finite grahps

To a finite graph there corresponds a free partially commutative group: with the given graph as commutation graph. In this paper we construct an orthogonality theory for graphs and their corresponding free partially commutative groups. The theory developed here provides tools for the study of the structure of partially commutative groups, their universal theory and automorphism groups. In particular the theory is applied in this paper to the centraliser lattice of such groups.

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.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

Procesamiento de imágenes biológicas

Este proyecto se ha desarrollado a petición del CSIC. El proyecto consiste en crear una aplicación que automatice la localización y obtención de la intensidad de unos puntos luminosos en las células que aparecen en el vídeo. También se desea identificar en qué estadio celular se encuentran las células y si los puntos hallados están en la zona del septim ring. Para ello, se ha hecho un estudio y probado dos métodos para la localización de los puntos y se ha realizado un filtro mediante Adaboost para la localización de las células. También se ha realizado una interfaz gráfica para el usuario final.

A theoretical and practical study on linear reforms of dual taxes

We extend the linear reforms introduced by Pf¨ahler (1984) to the case of dual taxes. We study the relative effect that linear dual tax cuts have on the inequality of income distribution -a symmetrical study can be made for dual linear tax hikes-. We also introduce measures of the degree of progressivity for dual taxes and show that they can be connected to the Lorenz dominance criterion. Additionally, we study the tax liability elasticity of each of the reforms proposed. Finally, by means of a microsimulation model and a considerably large data set of taxpayers drawn from 2004 Spanish Income Tax Return population, 1) we compare different yield-equivalent tax cuts applied to the Spanish dual income tax and 2) we investigate how much income redistribution the dual tax reform (Act ‘35/2006’) introduced with respect to the previous tax.

Estimation of lean meat content in pig carcasses using X-ray Computed Tomography and PLS regression

Lean meat percentage (LMP) is an important carcass quality parameter. The aim of this work is to obtain a calibration equation for the Computed Tomography (CT) scans with the Partial Least Square Regression (PLS) technique in order to predict the LMP of the carcass and the different cuts and to study and compare two different methodologies of the selection of the variables (Variable Importance for Projection — VIP- and Stepwise) to be included in the prediction equation. The error of prediction with cross-validation (RMSEPCV) of the LMP obtained with PLS and selection based on VIP value was 0.82% and for stepwise selection it was 0.83%. The prediction of the LMP scanning only the ham had a RMSEPCV of 0.97% and if the ham and the loin were scanned the RMSEPCV was 0.90%. Results indicate that for CT data both VIP and stepwise selection are good methods. Moreover the scanning of only the ham allowed us to obtain a good prediction of the LMP of the whole carcass.

Bioinformática: interfaz gráfica para comparación de genomas vía web

El proyecto consiste en un entorno gráfico cuyo fin es el de visualizar, estudiar e interpretar la conservación de código genético existente entre los diferentes genomas. Una interface que permite cargar hasta ocho genomas para ser comparados en detalle, por pares o entre todos ellos a la vez. El gráfico que se muestra en la interfaz, representa los Maximal Unique Matchings entre cada par de genomas, lo que significa coincidencias de la mayor longitud posible no repetidas, en las secuencias de ADN de las especies comparadas. La finalidad es el estudio de las evoluciones que han ido apareciendo entre diferentes organismos o los genes que comparten unas especies con otras.

Statistical properties of subgroups of free groups

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations are determined) by randomly chosen k-tuples of reduced words, whose maximal length is allowed to tend to infinity. In this paper we adopt a different, though equally natural point of view: we investigate the statistical properties of the same objects, but with respect to the so-called graph-based distribution, recently introduced by Bassino, Nicaud and Weil. Here, subgroups (and finite presentations) are determined by randomly chosen Stallings graphs whose number of vertices tends to infinity. Our results show that these two distributions behave quite differently from each other, shedding a new light on which properties of finitely generated subgroups can be considered frequent or rare. For example, we show that malnormal subgroups of a free group are negligible in the raph-based distribution, while they are exponentially generic in the word-based distribution. Quite surprisingly, a random finite presentation generically presents the trivial group in this new distribution, while in the classical one it is known to generically present an infinite hyperbolic group.

Eines interactives per l'aprenentatge de la dinàmica i el control dels convertidors de potència

El projecte s'ha centrat en el disseny i desenvolupament de laboratoris virtuals per a la docència del dispositius i mètodes de gestió d’energia. Això s’ha realitzat a dos nivells clarament diferenciats, el primer grup de laboratoris correspon als convertidors electrònics de potencia i el segon grup de laboratoris correspon a un conjunt de casos d’aplicacions concretes. En el primer grup es descriu el detall del funcionament dels diferents elements mentre que en el segon els descriuen les idees i conceptes bàsics de funcionament. Els laboratoris virtuals de convertidors electrònics de potència inclouen el convertidor elevador (boost), el convertidor reductor (buck), i convertidors acobladors magnèticament. Aquestes permeten estudiar el comportament dinàmica des d’un punt de vista commutat o bé promitjat, les aplicacions incorporen també la possibilitat de sintonitzar els controladors. Aquestes aplicacions han estat desenvolupades per ser un complement per les sessions de pràctiques presencials. Els laboratoris virtuals d’aplicacions, inclouen els sistema de transport metropolità, el vehicle híbrid i els sistemes de gestió de talls transitoris en el subministrament d’energia principalment. Aquestes laboratoris permeten introduir els estudiants de forma qualitativa en els diferents conceptes i tècniques emprades en els sistemes de generació, transport i transformació d’energia. Totes les aplicacions han estat desenvolupades emprant Easy JAVA Simulations, aquesta eina permet desenvolupar laboratoris multiplataforma fàcilment distribuïbles a través d’internet.