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."

Of Coalition and Speed: Passage and Duration of Statutes in Uruguay's Parliament, 1985-2000

We report preliminary findings from analysis of a database under construction. The paper explores the legislative process in search for some of the alleged consequences of cabinet coalitions in a presidential system. Coalition effects should be less evident in the success of executive initiatives: strategic behavior hampers this intuitive measure of performance. Better measures, because less subject to strategic considerations, are the odds of passage of legislators' bills and the time proposals take to be approved. Thus measured, coalition effects are discernible. Analysis of the universe of proposals processed in the fragmented Uruguayan Parliament between 1985 and 2000 reveals that coalition, observed about half the period, swells success rates of coalition members by 60% on average (and by as much as 150% for those close to the president). Event history analysis shows that coalitions cut the wait for an executive bill by 3 months, 1/6th the average wait. The reverse effect is felt on the duration of legislators' bills.

Fast numerical algorithms for the computation of invariant tori in Hamiltonian systems

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.

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."

Predictive and distributed routing balancing (PR-DRB): high speed interconnection networks

Current parallel applications running on clusters require the use of an interconnection network to perform communications among all computing nodes available. Imbalance of communications can produce network congestion, reducing throughput and increasing latency, degrading the overall system performance. On the other hand, parallel applications running on these networks posses representative stages which allow their characterization, as well as repetitive behavior that can be identified on the basis of this characterization. This work presents the Predictive and Distributed Routing Balancing (PR-DRB), a new method developed to gradually control network congestion, based on paths expansion, traffic distribution and effective traffic load, in order to maintain low latency values. PR-DRB monitors messages latencies on intermediate routers, makes decisions about alternative paths and record communication pattern information encountered during congestion situation. Based on the concept of applications repetitiveness, best solution recorded are reapplied when saved communication pattern re-appears. Traffic congestion experiments were conducted in order to evaluate the performance of the method, and improvements were observed.

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.

Analytical expressions for the flame front speed in the downward combustion of thin solid fuels and comparison to experiments

We derive analytical expressions for the propagation speed of downward combustion fronts of thin solid fuels with a background flow initially at rest. The classical combustion model for thin solid fuels that consists of five coupled reaction-convection-diffusion equations is here reduced into a single equation with the gas temperature as the single variable. For doing so we apply a two-zone combustion model that divides the system into a preheating region and a pyrolyzing region. The speed of the combustion front is obtained after matching the temperature and its derivative at the location that separates both regions.We also derive a simplified version of this analytical expression expected to be valid for a wide range of cases. Flame front velocities predicted by our analyticalexpressions agree well with experimental data found in the literature for a large variety of cases and substantially improve the results obtained from a previous well-known analytical expression

Effect of initial conditions on the speed of reaction-diffusion fronts

The effect of initial conditions on the speed of propagating fronts in reaction-diffusion equations is examined in the framework of the Hamilton-Jacobi theory. We study the transition between quenched and nonquenched fronts both analytically and numerically for parabolic and hyperbolic reaction diffusion. Nonhomogeneous media are also analyzed and the effect of algebraic initial conditions is also discussed

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.