Geometria integral i convexitat en espais de curvatura holomorfa constant

En aquest treball es tracten qüestions de la geometria integral clàssica a l'espai hiperbòlic i projectiu complex i a l'espai hermític estàndard, els anomenats espais de curvatura holomorfa constant. La geometria integral clàssica estudia, entre d'altres, l'expressió en termes geomètrics de la mesura de plans que tallen un domini convex fixat de l'espai euclidià. Aquesta expressió es dóna en termes de les integrals de curvatura mitja. Un dels resultats principals d'aquest treball expressa la mesura de plans complexos que tallen un domini fixat a l'espai hiperbòlic complex, en termes del que definim com volums intrínsecs hermítics, que generalitzen les integrals de curvatura mitja. Una altra de les preguntes que tracta la geometria integral clàssica és: donat un domini convex i l'espai de plans, com s'expressa la integral de la s-èssima integral de curvatura mitja del convex intersecció entre un pla i el convex fixat? A l'espai euclidià, a l'espai projectiu i hiperbòlic reals, aquesta integral correspon amb la s-èssima integral de curvatura mitja del convex inicial: se satisfà una propietat de reproductibitat, que no es té en els espais de curvatura holomorfa constant. En el treball donem l'expressió explícita de la integral de la curvatura mitja quan integrem sobre l'espai de plans complexos. L'expressem en termes de la integral de curvatura mitja del domini inicial i de la integral de la curvatura normal en una direcció especial: l'obtinguda en aplicar l'estructura complexa al vector normal. La motivació per estudiar els espais de curvatura holomorfa constant i, en particular, l'espai hiperbòlic complex, es troba en l'estudi del següent problema clàssic en geometria. Quin valor pren el quocient entre l'àrea i el perímetre per a successions de figures convexes del pla que creixen tendint a omplir-lo? Fins ara es coneixia el comportament d'aquest quocient en els espais de curvatura seccional negativa i que a l'espai hiperbòlic real les fites obtingudes són òptimes. Aquí provem que a l'espai hiperbòlic complex, les cotes generals no són òptimes i optimitzem la superior.

Tenseness of Riemannian flows

We show that any transversally complete Riemannian foliation &em&F&/em& of dimension one on any possibly non-compact manifold M is tense; namely, (M,&em&F&/em&) admits a Riemannian metric such that the mean curvature form of &em&F&/em& is basic. This is a partial generalization of a result of Domínguez, which says that any Riemannian foliation on any compact manifold is tense. Our proof is based on some results of Molino and Sergiescu, and it is simpler than the original proof by Domínguez. As an application, we generalize some well known results including Masa's characterization of tautness.

External dichotomous noise: The problem of the mean-first-passage time

A retarded backward equation for a non-Markovian process induced by dichotomous noise (the random telegraphic signal) is deduced. The mean-first-passage time of this process is exactly obtained. The Gaussian white noise and the white shot noise limits are studied. Explicit physical results in first approximation are evaluated.

Exact solution to the mean exit time problem for free inertial processes driven by Gaussian white noise

We obtain the exact analytical expression, up to a quadrature, for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise from a region (0,L) in space. We obtain a completely explicit expression for T(x,0) and discuss the dependence of T(x,v) as a function of the size L of the region. We develop a new method that may be used to solve other exit time problems.

The non-linear Dirichlet problem in Hadamard manifolds

We prove existence theorems for the Dirichlet problem for hypersurfaces of constant special Lagrangian curvature in Hadamard manifolds. The first results are obtained using the continuity method and approximation and then refined using two iterations of the Perron method. The a-priori estimates used in the continuity method are valid in any ambient manifold.

Exact solution to the exit-time problem for an undamped free particle driven by Gaussian white noise

In a recent paper [Phys. Rev. Lett. 75, 189 (1995)] we have presented the exact analytical expression for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise out of a region (0,L) in space. In this paper we give a detailed account of the method employed and present results on asymptotic properties and averages of T(x,v).

Mean first-passage time for system driven by the coin-toss square wave

We study the mean-first-passage-time problem for systems driven by the coin-toss square-wave signal. Exact analytic solutions are obtained for the driftless case. We also obtain approximate solutions for the potential case. The mean-first-passage time exhibits discontinuities and a remarkable nonsmooth oscillatory behavior which, to our knowledge, has not been observed for other kinds of driving noise.

The global carbon budget:a conflicting claims problem

Despite global environmental governance has traditionally couched global warming in terms of annual CO2 emissions (a flow), global mean temperature is actually determined by cumulative CO2 emissions in the atmosphere (a stock). Thanks to advances of scientific community, nowadays it is possible to quantify the \global carbon budget", that is, the amount of available cumulative CO2 emissions before crossing the 2oC threshold (Meinshausen et al., 2009). The current approach proposes to analyze the allocation of such global carbon budget among countries as a classical conflicting claims problem (O'Neill, 1982). Based on some appealing principles, it is proposed an efficient and sustainable allocation of the available carbon budget from 2000 to 2050 taking into account different environmental risk scenarios. Keywords: Carbon budget, Conflicting claims problem, Distribution, Climate change. JEL classification: C79, D71, D74, H41, H87, Q50, Q54, Q58.

The orthogonal subcategory problem in homotopy theory

It is known that, in a locally presentable category, localization exists with respect to every set of morphisms, while the statement that localization with respect to every (possibly proper) class of morphisms exists in locally presentable categories is equivalent to a large-cardinal axiom from set theory. One proves similarly, on one hand, that homotopy localization exists with respect to sets of maps in every cofibrantly generated, left proper, simplicial model category M whose underlying category is locally presentable. On the other hand, as we show in this article, the existence of localization with respect to possibly proper classes of maps in a model category M satisfying the above assumptions is implied by a large-cardinal axiom called Vopënka's principle, although we do not know if the reverse implication holds. We also show that, under the same assumptions on M, every endofunctor of M that is idempotent up to homotopy is equivalent to localization with respect to some class S of maps, and if Vopënka's principle holds then S can be chosen to be a set. There are examples showing that the latter need not be true if M is not cofibrantly generated. The above assumptions on M are satisfied by simplicial sets and symmetric spectra over simplicial sets, among many other model categories.

Periodic orbits of the planar collision restricted 3-body problem

Using the continuation method we prove that the circular and the elliptic symmetric periodic orbits of the planar rotating Kepler problem can be continued into periodic orbits of the planar collision restricted 3–body problem. Additionally, we also continue to this restricted problem the so called “comets orbits”.

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.

Periodic orbits near a heteroclinic loop formed by one dimensional orbit and a 2-dimensional manifold: application to the charged collinear 3-body problem

The paper is devoted to the study of a type of differential systems which appear usually in the study of some Hamiltonian systems with 2 degrees of freedom. We prove the existence of infinitely many periodic orbits on each negative energy level. All these periodic orbits pass near the total collision. Finally we apply these results to study the existence of periodic orbits in the charged collinear 3–body problem.

Bribe-proof rules in the division problem

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a strictly preferred share. We characterize all bribe-proof rules as the class of efficient, strategy-proof, and weak replacement monotonic rules. In addition, we identify the functional form of all bribe-proof and tops-only rules.

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.