Uniform estimates in the Poincare-Aronszajn theorem on the separation of singularities of analytic functions

We study the possibility of splitting any bounded analytic function $f$ with singularities in a closed set $E\cup F$ as a sum of two bounded analytic functions with singularities in $E$ and $F$ respectively. We obtain some results under geometric restrictions on the sets $E$ and $F$ and we provide some examples showing the sharpness of the positive results.

Analytic approximation of matrix functions in Lp

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

Inversion of analytic characteristic functions and infinite convolutions of exponential and Laplace densities

This paper shows that certain quotients of entire functions are characteristic functions. Under some conditions, we provide expressions for the densities of such characteristic functions which turn out to be generalized Dirichlet series which in turn can be expressed as an infinite linear combination of exponential or Laplace densities. We apply these results to several examples.

Classes of measures generated by capacities

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

Calibration of CES functions for real-world multisectoral modeling

We show how to calibrate CES production and utility functions when indirect taxation affecting inputs and consumption is present. These calibrated functions can then be used in computable general equilibrium models. Taxation modifies the standard calibration procedures since any taxed good has two associated prices and a choice of reference value units has to be made. We also provide an example of computer code to solve the calibration of CES utilities under two alternate normalizations. To our knowledge, this paper fills a methodological gap in the CGE literature.

On the growth rate of minor-closed classes of graphs

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

Weighted norm inequalities for Fourier transforms of radial functions

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

On the system of the functions x (s) / (s-r)k

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

Reduction theorems for operators on the cones of monotone functions

For a quasilinear operator on the semiaxis a reduction theorem is proved on the cones of monotone functions in Lp - Lq setting for 0 < q < ∞, 1<= p < ∞. The case 0 < p < 1 is also studied for operators with additional properties. In particular, we obtain critera for three-weight inequalities for the Hardy-type operators with Oinarov' kernel on monotone functions in the case 0 < q < p <= 1.

Transnational study of roles/functions and associated ICT competencies for Higher Education teachers

Aquest estudi forma part del projecte eLene-TLC1 Virtual Campus (2007-2008) recolzat pel programa eLearning de la Comissió Europea. L'objectiu d'aquest projecte és que els professors i els estudiants facin el millor ús possible de les TIC en l'educació superior, preparant als professors per als estudiants de la generació xarxa, permetent als estudiants a la transferència de coneixements i pràctiques de la vida quotidiana per al seu aprenentatge i estimular tant la integració plena de pràctiques innovadores d'ensenyament i d'aprenentatge possibilitades per un entorn tecnològic en constant evolució. Per tal de cobrir part d'aquest objectiu general, es va concebre un estudi per examinar les competències en TIC professors d'Educació Superior en entorns d'aprenentatge en línia.

On some geometry and equivalence classes of normal form games

Equivalence classes of normal form games are defined using the geometryof correspondences of standard equilibiurm concepts like correlated, Nash,and robust equilibrium or risk dominance and rationalizability. Resultingequivalence classes are fully characterized and compared across differentequilibrium concepts for 2 x 2 games. It is argued that the procedure canlead to broad and game-theoretically meaningful distinctions of games aswell as to alternative ways of viewing and testing equilibrium concepts.Larger games are also briefly considered.

Deciding analytically or trusting your intuition? The advantadges and disadvantadges of analytic and intuitive thought

Recent research has highlighted the notion that people can make judgmentsand choices by means of two systems that are labeled here tacit(or intuitive) and deliberate (or analytic). Whereas most decisionstypically involve both systems, this chapter examines the conditions underwhich each system is liable to be more effective. This aims to illuminatethe age-old issue of whether and when people should trust intuition or analysis. To do this, a framework is presented to understand how thetacit and deliberate systems work in tandem. Distinctions are also madebetween the types of information typically used by both systems as wellas the characteristics of environments that facilitate or hinder accuratelearning by the tacit system. Next, several experiments that havecontrasted intuitive and analytic modes on the same tasks are reviewed.Together, the theoretical framework and experimental evidence leads tospecifying the trade-off that characterizes their relative effectiveness.Tacit system responses can be subject to biases. In making deliberate systemresponses, however, people might not be aware of the correct rule to dealwith the task they are facing and/or make errors in executing it. Whethertacit or deliberate responses are more valid in particular circumstancesrequires assessing this trade-off. In this, the probability of making errorsin deliberate thought is postulated to be a function of the analytical complexityof the task as perceived by the person. Thus the trade-off is one of bias (inimplicit responses) versus analytical complexity (when tasks are handled indeliberate mode). Finally, it is noted that whereas much attention has beenpaid in the past to helping people make decisions in deliberate mode, effortsshould also be directed toward improving ability to make decisions intacit mode since the effectiveness of decisions clearly depends on both. Thistherefore represents an important frontier for research.

Almost sure testability of classes of densities

Let a class $\F$ of densities be given. We draw an i.i.d.\ sample from a density $f$ which may or may not be in $\F$. After every $n$, one must make a guess whether $f \in \F$ or not. A class is almost surely testable if there exists such a testing sequence such that for any $f$, we make finitely many errors almost surely. In this paper, several results are given that allowone to decide whether a class is almost surely testable. For example, continuity and square integrability are not testable, but unimodality, log-concavity, and boundedness by a given constant are.

The domain and interpretation of utility functions: An exploration

This paper proposes an exploration of the methodology of utilityfunctions that distinguishes interpretation from representation. Whilerepresentation univocally assigns numbers to the entities of the domainof utility functions, interpretation relates these entities withempirically observable objects of choice. This allows us to makeexplicit the standard interpretation of utility functions which assumesthat two objects have the same utility if and only if the individual isindifferent among them. We explore the underlying assumptions of suchan hypothesis and propose a non-standard interpretation according towhich objects of choice have a well-defined utility although individualsmay vary in the way they treat these objects in a specific context.We provide examples of such a methodological approach that may explainsome reversal of preferences and suggest possible mathematicalformulations for further research.

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.