Relativistic mean-field interaction with density-dependent meson-nucleon vertices based on microscopical calculations

Although ab initio calculations of relativistic Brueckner theory lead to large scalar isovector fields in nuclear matter, at present, successful versions of covariant density functional theory neglect the interactions in this channel. A new high-precision density functional DD-MEδ is presented which includes four mesons, σ, ω, δ, and ρ, with density-dependent meson-nucleon couplings. It is based to a large extent on microscopic ab initiocalculations in nuclear matter. Only four of its parameters are determined by adjusting to binding energies and charge radii of finite nuclei. The other parameters, in particular the density dependence of the meson-nucleon vertices, are adjusted to nonrelativistic and relativistic Brueckner calculations of symmetric and asymmetric nuclear matter. The isovector effective mass mp*−mn* derived from relativistic Brueckner theory is used to determine the coupling strength of the δ meson and its density dependence.

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.

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.

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.

On locally finite transitive two-ended digraphs

Projecte de recerca elaborat a partir d’una estada al Department de Matemàtica Aplicada de la Montanuniversität Leoben, Àustria, entre agost i desembre del 2006. L’ objectiu ha estat fer recerca sobre digrafs infinits amb dos finals, connexos i localment finits, i, en particular, en digrafs amb dos finals i altament arc-transitius. Malnic, Marusic et al. van introduir un nou tipus de relació d’equivalència en els vèrtexs d’un dígraf, anomenades relacions d’assolibilitat, que generalitzen i tenen el seu origen en un problema posat per Cameron et al., on les classes de la relació d’equivalència eren vèrtexs que pertanyien a un camí alternat del dígraf . Malnic et al. en el mencionat article van establir connexions ben estretes entre aquestes relacions d’assolibilitat i l'estructura de finals i creixement dels digrafs localment finits i transitius. En aquest treball, s’ha caracteritzat per complet aquestes relacions d’assolibitat en el cas de dígrafs localment finits i transitius amb exactament dos finals, en termes de la descomposició en números primers del número de línies que genera el digraf amb dos finals. A més, es nega la Conjectura 1 sostinguda per Seifter que afirmava que un digraf connex localment finit amb més d’un final era necessàriament o be 0-, 1- o altament arc-transitiu. Seifer havia donat una solució parcial a la conjectura pel cas de digrafs regulars amb grau primer que tinguin un conjunt de tall connex. En aquest treball, es descriu una família infinita de dígrafs regulars de grau dos, amb dos finals, exactament 2-arc transitius i no 3-arc transitius. Així, es nega la Conjectura de Seifter en el cas general, fins i tot per grau primer. Tot i així, la solució parcial donada per Seifter en el seu article és en cert sentit la millor possible i l'existència un conjunt de tall connex essencial.

Symmetric planar central configurations of five bodies: Euler plus two

We study planar central configurations of the five-body problem where three of the bodies are collinear, forming an Euler central configuration of the three-body problem, and the two other bodies together with the collinear configuration are in the same plane. The problem considered here assumes certain symmetries. From the three bodies in the collinear configuration, the two bodies at the extremities have equal masses and the third one is at the middle point between the two. The fourth and fifth bodies are placed in a symmetric way: either with respect to the line containing the three bodies, or with respect to the middle body in the collinear configuration, or with respect to the perpendicular bisector of the segment containing the three bodies. The possible stacked five-body central configurations satisfying these types of symmetries are: a rhombus with four masses at the vertices and a fifth mass in the center, and a trapezoid with four masses at the vertices and a fifth mass at the midpoint of one of the parallel sides.

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.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Computing hypergraph width measures exactly

Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tree decompositions of graphs to the case of hypergraphs and obtain fast exact algorithms. As a consequence, we provide algorithms which, given a hypergraph H on n vertices and m hyperedges, compute the generalized hypertree-width of H in time O*(2n) and compute the fractional hypertree-width of H in time O(1.734601n.m).1

Creació d'un Sistema d'Informació Geogràfic per a la consulta i gestió de la base de vèrtexs geodèsics de Catalunya amb Geomedia PRO 6.0©

L'objectiu és realitzar una explicació dels passos i les tasques realitzades per a la construcció d'un Sistema d'Informació Geogràfica (SIG) que permeti la gestió de vèrtex geodèsics de Catalunya i la implementació de l'algorisme de Delaunay sobre un conjunt de vèrtex seleccionats.

SIG per a la gestió dels vèrtexs geodèsics de Catalunya amb Geomedia

L¿objectiu del projecte es estudiar el que és i el que no és un sistema d¿informació geogràfica,conèixer la tecnologia associada a aquests sistemes, així com el tipus i format de les dades que fan servir. Tanmateix, l¿estudi no és només teòric i, per conèixer els mecanismes de automatització que ofereix GeoMedia, s¿implementa una petita eina de gestió de vèrtexs geodèsics centrada al territori de Catalunya que fa servir Oracle, com a gestor de bases de dades.

La integració de persones amb discapacitats en el lleure. Una resposta educativa i social : les colònies integradores

Aquest vol ser un treball que, emmarcat dins l'esfera del lleure, centri la seva atenció en la interrelació dels vèrtexs d'un triangle que formen els següents components: un grup d'infants i d'adolescents, un grup de monitors i unes activitats de lleure. Els objectius van dirigits als nens i als monitors, perquè aquesta empresa la construeixen entre tots els que hi prenen part. La intervenció psicopedagògica vol aconseguir que la interacció d'aquests elements, en aquest context, possibiliti que tots els nens assoleixin uns objectius educatius i socials determinats. No es tracta d'un plantejament descriptiu dels tipus d'aprenentatge que tenen lloc a la colònia, alguns tan evidents com l'aprenentatge per imitació de models o l'aprenentatge vicari per a l'aprenentatge social d'actituds i de comportaments, sinó d'assessorar els monitors sobre com han d'intervenir en les relacions que s'estableixen en el si de la colònia per tal d'arribar a aconseguir els canvis en els comportaments i en les actituds.

Spain in Europe 2004-2008

In March of 2004, the Observatory of European Foreign Policy published a special monograph about Spain in Europe (1996-2004) in digital format. The objective of the monograph was to analyse Spain’s foreign policy agenda and strategy during the period of José María Aznar’s presidency. As the title suggests, one of the initial suppositions of the analysis is the Europeanization of Spanish foreign activities. Is that how it was? Did Aznar’s Spain see the world and relate to it through Brussels? The publication was well received, considering the number of visits received and above all the institutions which asked to link the publication to their web pages. Among these, the EUobserver published the introduction to the piece in English titled Aznar: thinking locally, acting in Europe (described by the EUobserver as a paper of utmost importance). The fact that the elections were held three days after the tragic events of the 11th of March dramatically increased interest in Spain and the implications for Europe. This publication is the second of its type, in this case analysing the period of the Zapatero government (2004-2008). Once again the starting premise (the Europeanization of the agenda and the methods employed) has been considered by the analysts. And once again the articles collected in this publication serve to “triangulate” the analysis. Spain and Europe are two vertices (more or less distant, in essence and in form) which the authors handle in their analysis of the case (third vertex).

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Identification of geometrically consistent interest points for 3D scene reconstruction

We propose an algorithm that extracts image features that are consistent with the 3D structure of the scene. The features can be robustly tracked over multiple views and serve as vertices of planar patches that suitably represent scene surfaces, while reducing the redundancy in the description of 3D shapes. In other words, the extracted features will off er good tracking properties while providing the basis for 3D reconstruction with minimum model complexity