On cohomologies and extensions of cyclic groups

Cohomology groups H(s)(Z(n), Z(m)) are studied to describe all groups up to isomorphism which are (central) extensions of the cyclic group Z(n) by the Z(n)-module Z(m). Further, for each such a group the number of non-equivalent extensions is determined. (C) 2011 Elsevier B.V. All rights reserved.

CONSTRAINING THE NONEXTENSIVE MASS FUNCTION OF HALOS FROM BAO, CMB AND X-RAY DATA

Clusters of galaxies are the most impressive gravitationally-bound systems in the universe, and their abundance (the cluster mass function) is an important statistic to probe the matter density parameter (Omega(m)) and the amplitude of density fluctuations (sigma(8)). The cluster mass function is usually described in terms of the Press-Schecther (PS) formalism where the primordial density fluctuations are assumed to be a Gaussian random field. In previous works we have proposed a non-Gaussian analytical extension of the PS approach with basis on the q-power law distribution (PL) of the nonextensive kinetic theory. In this paper, by applying the PL distribution to fit the observational mass function data from X-ray highest flux-limited sample (HIFLUGCS), we find a strong degeneracy among the cosmic parameters, sigma(8), Omega(m) and the q parameter from the PL distribution. A joint analysis involving recent observations from baryon acoustic oscillation (BAO) peak and Cosmic Microwave Background (CMB) shift parameter is carried out in order to break these degeneracy and better constrain the physically relevant parameters. The present results suggest that the next generation of cluster surveys will be able to probe the quantities of cosmological interest (sigma(8), Omega(m)) and the underlying cluster physics quantified by the q-parameter.

An extension of the concept of gradient semigroups which is stable under perturbation

In this article we introduce the concept of a gradient-like nonlinear semigroup as an intermediate concept between a gradient nonlinear semigroup (those possessing a Lyapunov function, see [J.K. Hale, Asymptotic Behavior of Dissipative Systems, Math. Surveys Monogr., vol. 25, Amer. Math. Soc., 1989]) and a nonlinear semigroup possessing a gradient-like attractor. We prove that a perturbation of a gradient-like nonlinear semigroup remains a gradient-like nonlinear semigroup. Moreover, for non-autonomous dynamical systems we introduce the concept of a gradient-like evolution process and prove that a non-autonomous perturbation of a gradient-like nonlinear semigroup is a gradient-like evolution process. For gradient-like nonlinear semigroups and evolution processes, we prove continuity, characterization and (pullback and forwards) exponential attraction of their attractors under perturbation extending the results of [A.N. Carvalho, J.A. Langa, J.C. Robinson, A. Suarez, Characterization of non-autonomous attractors of a perturbed gradient system, J. Differential Equations 236 (2007) 570-603] on characterization and of [A.V. Babin, M.I. Vishik, Attractors in Evolutionary Equations, Stud. Math. Appl.. vol. 25, North-Holland, Amsterdam, 1992] on exponential attraction. (C) 2009 Elsevier Inc. All rights reserved.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

Inference for a skew extension of the Grubbs model

In this paper, we discuss inferential aspects for the Grubbs model when the unknown quantity x (latent response) follows a skew-normal distribution, extending early results given in Arellano-Valle et al. (J Multivar Anal 96:265-281, 2005b). Maximum likelihood parameter estimates are computed via the EM-algorithm. Wald and likelihood ratio type statistics are used for hypothesis testing and we explain the apparent failure of the Wald statistics in detecting skewness via the profile likelihood function. The results and methods developed in this paper are illustrated with a numerical example.