On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Computing congruences of modular forms and Galois representations modulo prime powers

This article starts a computational study of congruences of modular forms and modular Galoisrepresentations modulo prime powers. Algorithms are described that compute the maximum integermodulo which two monic coprime integral polynomials have a root in common in a sensethat is defined. These techniques are applied to the study of congruences of modular forms andmodular Galois representations modulo prime powers. Finally, some computational results withimplications on the (non-)liftability of modular forms modulo prime powers and possible generalisationsof level raising are presented.

On the robustness of least-squares Monte Carlo (LSM) for pricing American derivatives

This paper analyses the robustness of Least-Squares Monte Carlo, a techniquerecently proposed by Longstaff and Schwartz (2001) for pricing Americanoptions. This method is based on least-squares regressions in which theexplanatory variables are certain polynomial functions. We analyze theimpact of different basis functions on option prices. Numerical resultsfor American put options provide evidence that a) this approach is veryrobust to the choice of different alternative polynomials and b) few basisfunctions are required. However, these conclusions are not reached whenanalyzing more complex derivatives.

On bounds for network revenue management

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

Macaulay style formulas for sparse resultants

We present formulas for computing the resultant of sparse polyno- mials as a quotient of two determinants, the denominator being a minor of the numerator. These formulas extend the original formulation given by Macaulay for homogeneous polynomials.

A numerical characterization of hypersurface singularities

In this note we give a numerical characterization of hypersurface singularities in terms of the normalized Hilbert-Samuel coefficients, and we interpret this result from the point of view of rigid polynomials.

UBVRI photometry of G, K, M Hipparcos stars. II.

As indicated by Grenon (1989), the data of the present series of reports on the UBVRI photometry of late-type stars in the Hipparcos Input Catalog are to be employed in computations of Hipparcos observing time, as well as in evaluating the observability of faint stars by the satellite. Attention is here given to late type stars in the V = 8-12 range, including distant red giants in the Galactic plane (Hipparcos proposal 189), as well as high proper motion stars included in the G, LTT, LP, and MCC catalogs.

Optimal strategies for sending information through a quantum channel

Quantum states can be used to encode the information contained in a direction, i.e., in a unit vector. We present the best encoding procedure when the quantum state is made up of N spins (qubits). We find that the quality of this optimal procedure, which we quantify in terms of the fidelity, depends solely on the dimension of the encoding space. We also investigate the use of spatial rotations on a quantum state, which provide a natural and less demanding encoding. In this case we prove that the fidelity is directly related to the largest zeros of the Legendre and Jacobi polynomials. We also discuss our results in terms of the information gain.

Black holes as fundamental strings: Comparing the absorption of scalars

The recently proposed correspondence principle of Horowitz and Polchinski provides a concrete means to relate (among others) black holes with electric Neveu-SchwarzNeveu-Schwarz charges to fundamental strings and correctly match their entropies. We further test this correspondence by examining the greybody factors in the absorption rates of neutral, minimally coupled scalars by a near extremal black hole. Perhaps surprisingly, the results disagree in general with the absorption by weakly coupled strings. Though this does not disprove the correspondence, it indicates that it might not be simple in this region of the black hole parameter space.

Black diholes

We present and analyze exact solutions of the Einstein-Maxwell and Einstein-Maxwell-dilaton equations that describe static pairs of oppositely charged extremal black holes, i.e., black diholes. The holes are suspended in equilibrium in an external magnetic field, or held apart by cosmic strings. We comment as well on the relation of these solutions to brane-antibrane configurations in string and M theory.

Statistical description of rotating Kaluza-Klein black holes

We extend the recent microscopic analysis of extremal dyonic Kaluza-Klein (D0-D6) black holes to cover the regime of fast rotation in addition to slow rotation. Fastly rotating black holes, in contrast to slow ones, have nonzero angular velocity and possess ergospheres, so they are more similar to the Kerr black hole. The D-brane model reproduces their entropy exactly, but the mass gets renormalized from weak to strong coupling, in agreement with recent macroscopic analyses of rotating attractors. We discuss how the existence of the ergosphere and superradiance manifest themselves within the microscopic model. In addition, we show in full generality how Myers-Perry black holes are obtained as a limit of Kaluza-Klein black holes, and discuss the slow and fast rotation regimes and superradiance in this context.

Microstates of a neutral black hole in M theory

We consider vacuum solutions in M theory of the form of a five-dimensional Kaluza-Klein black hole cross T6. In a certain limit, these include the five-dimensional neutral rotating black hole (cross T6). From a type-IIA standpoint, these solutions carry D0 and D6 charges. We show that there is a simple D-brane description which precisely reproduces the Hawking-Bekenstein entropy in the extremal limit, even though supersymmetry is completely broken.