The simultaneous conjugacy problem in groups of piecewise linear functions

Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give an elementary proof for the solution of the latter question. This relies purely on the description of F as the group of piecewise linear orientation-preserving homeomorphisms of the unit. The techniques we develop allow us also to solve the ordinary conjugacy problem as well, and we can compute roots and centralizers. Moreover, these techniques can be generalized to solve the same questions in larger groups of piecewise-linear homeomorphisms.

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.

The period function of the generalized Lotka-Volterra centers

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

An Atkinson-Gini family of social evaluation functions

We investigate the properties of a family of social evaluation functions and inequality indices which merge the features of the family of Atkinson (1970) and S-Gini (Donaldson and Weymark (1980, 1983), Yitzhaki (1983) and Kakwani (1980)) indices. Income inequality aversion is captured by decreasing marginal utilities, and aversion to rank inequality is captured by rank-dependent ethical weights, thus providing an ethically-flexible dual basis for the assessment of inequality and equity. These ocial evaluation functions can be interpreted as average utility corrected for the illfare of relative deprivation. They can alternatively be understood as averages of altruistic well-being in a population. They moreover have a simple graphical interpretation.

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.

On Cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Second, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.

Nonlinear models and small sample performance of the generalized method of moments

In this paper I explore the issue of nonlinearity (both in the datageneration process and in the functional form that establishes therelationship between the parameters and the data) regarding the poorperformance of the Generalized Method of Moments (GMM) in small samples.To this purpose I build a sequence of models starting with a simple linearmodel and enlarging it progressively until I approximate a standard (nonlinear)neoclassical growth model. I then use simulation techniques to find the smallsample distribution of the GMM estimators in each of the models.

Transformation kernel density estimation of actuarial loss functions

[cat] Es presenta un estimador nucli transformat que és adequat per a distribucions de cua pesada. Utilitzant una transformació basada en la distribució de probabilitat Beta l’elecció del paràmetre de finestra és molt directa. Es presenta una aplicació a dades d’assegurances i es mostra com calcular el Valor en Risc.

Transformation kernel density estimation of actuarial loss functions

[cat] Es presenta un estimador nucli transformat que és adequat per a distribucions de cua pesada. Utilitzant una transformació basada en la distribució de probabilitat Beta l’elecció del paràmetre de finestra és molt directa. Es presenta una aplicació a dades d’assegurances i es mostra com calcular el Valor en Risc.

Periodic points of holomorphic maps via Lefschetz numbers

In this paper we study the set of periods of holomorphic maps on compact manifolds, using the periodic Lefschetz numbers introduced by Dold and Llibre, which can be computed from the homology class of the map. We show that these numbers contain information about the existence of periodic points of a given period; and, if we assume the map to be transversal, then they give us the exact number of such periodic orbits. We apply this result to the complex projective space of dimension n and to some special type of Hopf surfaces, partially characterizing their set of periods. In the first case we also show that any holomorphic map of CP(n) of degree greater than one has infinitely many distinct periodic orbits, hence generalizing a theorem of Fornaess and Sibony. We then characterize the set of periods of a holomorphic map on the Riemann sphere, hence giving an alternative proof of Baker's theorem.

Measurement of the specific heat and determination of the thermodynamic functions of relaxed amorphous silicon

The specific heat, cp, of two amorphous silicon (a-Si) samples has been measured by differential scanning calorimetry in the 100–900K temperature range. When the hydrogen content is reduced by thermal annealing, cp approaches the value of crystalline Si (c-Si). Within experimental accuracy, we conclude that cp of relaxed pure a-Si coincides with that of c-Si. This result is used to determine the enthalpy, entropy, and Gibbs free energy of defect-free relaxed a-Si. Finally, the contribution of structural defects on these quantities is calculated and the melting point of several states of a-Si is predicted

Parallel characterizations of a generalized shapley value and a generalized banzhaf value for cooperative games with level structure of cooperation

We present parallel characterizations of two different values in the framework of restricted cooperation games. The restrictions are introduced as a finite sequence of partitions defined on the player set, each of them being coarser than the previous one, hence forming a structure of different levels of a priori unions. On the one hand, we consider a value first introduced in Ref. [18], which extends the Shapley value to games with different levels of a priori unions. On the other hand, we introduce another solution for the same type of games, which extends the Banzhaf value in the same manner. We characterize these two values using logically comparable properties.

Clarke critical values of subanalytic Lipschitz continuous functions

We prove that any subanalytic locally Lipschitz function has the Sard property. Such functions are typically nonsmooth and their lack of regularity necessitates the choice of some generalized notion of gradient and of critical point. In our framework these notions are defined in terms of the Clarke and of the convex-stable subdifferentials. The main result of this note asserts that for any subanalytic locally Lipschitz function the set of its Clarke critical values is locally finite. The proof relies on Pawlucki's extension of the Puiseuxlemma. In the last section we give an example of a continuous subanalytic function which is not constant on a segment of "broadly critical" points, that is, points for which we can find arbitrarily short convex combinations of gradients at nearby points.

Generating trees for permutations avoiding generalized patterns

We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones.