Weighted Hardy spaces for the unit disc: approximation properties

In this paper we study basic properties of the weighted Hardy space for the unit disc with the weight function satisfying Muckenhoupt's (Aq) condition, and study related approximation problems (expansion, moment and interpolation) with respect to two incomplete systems of holomorphic functions in this space.

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.

Solving higher-dimensional continuous time stochastic control problems by value function regression

The paper develops a method to solve higher-dimensional stochasticcontrol problems in continuous time. A finite difference typeapproximation scheme is used on a coarse grid of low discrepancypoints, while the value function at intermediate points is obtainedby regression. The stability properties of the method are discussed,and applications are given to test problems of up to 10 dimensions.Accurate solutions to these problems can be obtained on a personalcomputer.

Surface collective oscillations of metal clusters and spheres: Random-phase-approximation sum-rules approach

Using the once and thrice energy-weighted moments of the random-phase-approximation strength function, we have derived compact expressions for the average energy of surface collective oscillations of clusters and spheres of metal atoms. The L=0 volume mode has also been studied. We have carried out quantal and semiclassical calculations for Na and Ag systems in the spherical-jellium approximation. We present a rather thorough discussion of surface diffuseness and quantal size effects on the resonance energies.

Spin and density longitudinal response of quantum dots in the time-dependent local-spin-density approximation

The longitudinal dipole response of a quantum dot has been calculated in the far-infrared regime using local-spin-density-functional theory. We have studied the coupling between the collective spin and density modes as a function of the magnetic field. We have found that the spin dipole mode and single-particle excitations have a sizable overlap, and that the magnetoplasmon modes can be excited by the dipole spin operator if the dot is spin polarized. The frequency of the dipole spin edge mode presents an oscillation which is clearly filling factor (v) related. We have found that the spin dipole mode is especially soft for even-n values. Results for selected numbers of electrons and confining potentials are discussed.

Spin polarized neutron matter and magnetic susceptibility within the Brueckner-Hartree-Fock approximation

The Brueckner-Hartree-Fock formalism is applied to study spin polarized neutron matter properties. Results of the total energy per particle as a function of the spin polarization and density are presented for two modern realistic nucleon-nucleon interactions, Nijmegen II and Reid93. We find that the dependence of the energy on the spin polarization is practically parabolic in the full range of polarizations. The magnetic susceptibility of the system is computed. Our results show no indication of a ferromagnetic transition which becomes even more difficult as the density increases.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

Analytical Dirac-Hartree-Fock-Slater screening function for atoms (Z=1-92)

An analytical approximation, depending on five parameters, for the atomic screening function is proposed. The corresponding electrostatic potential takes a simple analytical form (superposition of three Yukawa potentials) well suited to most practical applications. Parameters in the screening function, determined by an analytical fitting procedure to Dirac-Hartree-Fock-Slater (DHFS) self-consistent data, are given for Z=1¿92. The reliability of this analytical approach is demonstrated by showing that (a) Born cross sections for elastic scattering of fast charged particles by the present analytical field and by the DHFS field practically coincide and (b) one-electron binding energies computed from the independent-particle model with our analytical field (corrected for exchange and electrostatic self-interaction) agree closely with the DHFS energy eigenvalues.

Single period Markowitz portfolio selection, performance gauging and duality: a variation on Luenberger's shortage function

Markowitz portfolio theory (1952) has induced research into the efficiency of portfolio management. This paper studies existing nonparametric efficiency measurement approaches for single period portfolio selection from a theoretical perspective and generalises currently used efficiency measures into the full mean-variance space. Therefore, we introduce the efficiency improvement possibility function (a variation on the shortage function), study its axiomatic properties in the context of Markowitz efficient frontier, and establish a link to the indirect mean-variance utility function. This framework allows distinguishing between portfolio efficiency and allocative efficiency. Furthermore, it permits retrieving information about the revealed risk aversion of investors. The efficiency improvement possibility function thus provides a more general framework for gauging the efficiency of portfolio management using nonparametric frontier envelopment methods based on quadratic optimisation.

Embedding theorems of function classes, IV

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

Embedding theorems of function classes, II

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

The period function of the generalized Lotka-Volterra centers

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