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.

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.

Refinement criteria for global illumination using convex funcions

In several computer graphics areas, a refinement criterion is often needed to decide whether to goon or to stop sampling a signal. When the sampled values are homogeneous enough, we assume thatthey represent the signal fairly well and we do not need further refinement, otherwise more samples arerequired, possibly with adaptive subdivision of the domain. For this purpose, a criterion which is verysensitive to variability is necessary. In this paper, we present a family of discrimination measures, thef-divergences, meeting this requirement. These convex functions have been well studied and successfullyapplied to image processing and several areas of engineering. Two applications to global illuminationare shown: oracles for hierarchical radiosity and criteria for adaptive refinement in ray-tracing. Weobtain significantly better results than with classic criteria, showing that f-divergences are worth furtherinvestigation in computer graphics. Also a discrimination measure based on entropy of the samples forrefinement in ray-tracing is introduced. The recursive decomposition of entropy provides us with a naturalmethod to deal with the adaptive subdivision of the sampling region

Magnetic properties and domain-wall motion in single-crystal BaFe10.2Sn0.74Co0.66O19

The magnetic properties of BaFe12O19 and BaFe10.2Sn0.74Co0.66O19 single crystals have been investigated in the temperature range (1.8 to 320 K) with a varying field from -5 to +5 T applied parallel and perpendicular to the c axis. Low-temperature magnetic relaxation, which is ascribed to the domain-wall motion, was performed between 1.8 and 15 K. The relaxation of magnetization exhibits a linear dependence on logarithmic time. The magnetic viscosity extracted from the relaxation data, decreases linearly as temperature goes down, which may correspond to the thermal depinning of domain walls. Below 2.5 K, the viscosity begins to deviate from the linear dependence on temperature, tending to be temperature independent. The near temperature independence of viscosity suggests the existence of quantum tunneling of antiferromagnetic domain wall in this temperature range.

Corrigendum stable matchings and preferences of couples

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Paths to stability for matching markets with couples

We study two-sided matching markets with couples and show that for a natural preference domain for couples, the domain of weakly responsive preferences, stable outcomes can always be reached by means of decentralized decision making. Starting from an arbitrary matching, we construct a path of matchings obtained from `satisfying' blocking coalitions that yields a stable matching. Hence, we establish a generalization of Roth and Vande Vate's (1990) result on path convergence to stability for decentralized singles markets. Furthermore, we show that when stable matchings exist, but preferences are not weakly responsive, for some initial matchings there may not exist any path obtained from `satisfying' blocking coalitions that yields a stable matching.

On group strategy-proof mechanisms for a many-to-one matching model

For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of preferences (which contains the domain of responsive preferences of the college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking Lemma holds as well. We exhibit an example showing that none of these three results remain true if the preferences of firms are substitutable but not quota q-separable.

Corrigendum: stable matchings and preferences of couples

We correct an omission in the definition of the domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Permutations defining convex permutominoes

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

Generic optimality conditions for semi-algebraic convex programs

We consider linear optimization over a nonempty convex semi-algebraic feasible region F. Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique \active" manifold, around which F is \partly smooth", and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of the optimal solution. The active manifold consists, locally, of these perturbed optimal solutions; it is independent of the representation of F, and is eventually identified by a variety of iterative algorithms such as proximal and projected gradient schemes. These results extend to unbounded sets F.

On stability of solutions to systems of convex inequalities

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

Convex linear combination processes for compositions

Aitchison and Bacon-Shone (1999) considered convex linear combinations ofcompositions. In other words, they investigated compositions of compositions, wherethe mixing composition follows a logistic Normal distribution (or a perturbationprocess) and the compositions being mixed follow a logistic Normal distribution. Inthis paper, I investigate the extension to situations where the mixing compositionvaries with a number of dimensions. Examples would be where the mixingproportions vary with time or distance or a combination of the two. Practicalsituations include a river where the mixing proportions vary along the river, or acrossa lake and possibly with a time trend. This is illustrated with a dataset similar to thatused in the Aitchison and Bacon-Shone paper, which looked at how pollution in aloch depended on the pollution in the three rivers that feed the loch. Here, I explicitlymodel the variation in the linear combination across the loch, assuming that the meanof the logistic Normal distribution depends on the river flows and relative distancefrom the source origins

Impedance boundary conditions for pseudo-spectral time-domain methods in room acoustics

The pseudo-spectral time-domain (PSTD) method is an alternative time-marching method to classicalleapfrog finite difference schemes in the simulation of wave-like propagating phenomena. It is basedon the fundamentals of the Fourier transform to compute the spatial derivatives of hyperbolic differential equations. Therefore, it results in an isotropic operator that can be implemented in an efficient way for room acoustics simulations. However, one of the first issues to be solved consists on modeling wallabsorption. Unfortunately, there are no references in the technical literature concerning to that problem. In this paper, assuming real and constant locally reacting impedances, several proposals to overcome this problem are presented, validated and compared to analytical solutions in different scenarios.

Impedance boundary conditions for pseudo-spectral time-domain methods in room acoustics

The Pseudo-Spectral Time Domain (PSTD) method is an alternative time-marching method to classical leapfrog finite difference schemes inthe simulation of wave-like propagating phenomena. It is based on the fundamentals of the Fourier transform to compute the spatial derivativesof hyperbolic differential equations. Therefore, it results in an isotropic operator that can be implemented in an efficient way for room acousticssimulations. However, one of the first issues to be solved consists on modeling wall absorption. Unfortunately, there are no references in thetechnical literature concerning to that problem. In this paper, assuming real and constant locally reacting impedances, several proposals toovercome this problem are presented, validated and compared to analytical solutions in different scenarios.