Contractive metrics for a Boltzmann equation for granular gases: diffusive equilibriaThe Patterson-Sullivan embedding and minimal volume entropy for outer space

We quantify the long-time behavior of a system of (partially) inelastic particles in a stochastic thermostat by means of the contractivity of a suitable metric in the set of probability measures. Existence, uniqueness, boundedness of moments and regularity of a steady state are derived from this basic property. The solutions of the kinetic model are proved to converge exponentially as t→ ∞ to this diffusive equilibrium in this distance metrizing the weak convergence of measures. Then, we prove a uniform bound in time on Sobolev norms of the solution, provided the initial data has a finite norm in the corresponding Sobolev space. These results are then combined, using interpolation inequalities, to obtain exponential convergence to the diffusive equilibrium in the strong L¹-norm, as well as various Sobolev norms.

The Patterson-Sullivan embedding and minimal volume entropy for outer space

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

Marx's analysis of the falling rate of profit on the first version of volume III of capital

The paper provides a description and analysis of the Hodgskin section of Theories of Surplus Value and the general law section of the first version of Volume III of Capital. It then considers Part III of Volume III, the evolution of Marx's thought and various interpretations of his theory in the light of this analysis. It is suggested that Marx thought that the rate of profit must fall and even in the 1870s hoped to be able to provide a demonstration of this. However the main conclusions are: 1. Marx's major attempt to show that the rate of profit must fall occurred in the general law section. 2. Part III does not contain a demonstration that the rate of profit must fall. 3. Marx was never able to demonstrate that the rate of profit must fall and he was aware of this.

A maximal domain of preferences for tops-only rules in the division problem

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, continuity, and "tops-onlyness". These domains (called weakly single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.

On the number of K3,3-minor-free and maximal K3,3-minor-free graphs

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

Maximal C*-algebras of quotients and injective envelopes of C*-algebras

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

New estimates for the maximal singular integral

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

A characterization of two weight norm inequalities for maximal singular integrals

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

Maximal operators and differentiation theorems for sparse sets

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

Two weight inequalities for maximal truncations of dyadic Calderón-Zygmund operators

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

High tidal volume ventilation affects neuronal activation in mechanically ventilated rats

Els malalts crítics presenten sovint seqüeles cognitives a llarg termini, l’aplicació de ventilació mecànica (VM) pot contribuir al seu desenvolupament. El principal objectiu del nostre estudi fou investigar l’efecte de dos patrons de ventilació (volum corrent elevat/baix) en l’activació neuronal (expressió de c-fos) en determinades àrees cerebrals en un model en rates. Després de 3 hores sota VM, es va trobar activació neuronal; la seva intensitat va ser superior al grup de volum corrent elevat, suggerint un efecte iatrogènic de la VM al cervell. Aquests resultats suggereixen que cal aprofundir en l’estudi del crosstalk cervell-pulmó en malalts crítics sota VM.

A new automated method versus continuous positive airway pressure method for measuring pressure-volume curves in patients with acute lung injury

Objective: To compare pressure–volume (P–V) curves obtained with the Galileo ventilator with those obtained with the CPAP method in patients with ALI or ARDS receiving mechanical ventilation. P–V curves were fitted to a sigmoidal equation with a mean R2 of 0.994 ± 0.003. Lower (LIP) and upper inflection (UIP), and deflation maximum curvature (PMC) points calculated from the fitted variables showed a good correlation between methods with high intraclass correlation coefficients. Bias and limits of agreement for LIP, UIP and PMC obtained with the two methods in the same patient were clinically acceptable.

Counterexamples to some pointwise estimates of the maximal Cauchy transform in terms of the Cauchy transform

Motivated by the work of Mateu, Orobitg, Pérez and Verdera, who proved inequalities of the form $T_*f\lesssim M(Tf)$ or $T_*f\lesssim M^2(Tf)$ for certain singular integral operators $T$, such as the Hilbert or the Beurling transforms, we study the possibility of establishing this type of control for the Cauchy transform along a Lipschitz graph. We show that this is not possible in general, and we give a partial positive result when the graph is substituted by a Jordan curve.

Implementació de la cerca d'un subgraf comú maximal a dos grafs mitjançant colles

La memòria que ací es presenta s'emmarca dins de l'àrea de teoria de grafs. En concret es treballa la implementació d'un algorisme per trobar el subgraf comú maximal (SCM) de dos grafs mitjançant la cerca de colles maximals (CM). L'aportació principal del projecte consisteix en, donats dos grafs qualsevol, trobar el seu graf associat per tal de poder cercar la seva colla maximal (CM). I així, utilitzant funcions existents en el llenguatge de programació, poder trobar el seu subgraf comú maximal (SCM), necessari per calcular la distància entre grafs i així determinar quan d'isomorfs són.