Superconducting p-branes and extremal black holes

In Einstein-Maxwell theory, magnetic flux lines are "expelled" from a black hole as extremality is approached, in the sense that the component of the field strength normal to the horizon goes to zero. Thus, extremal black holes are found to exhibit the sort of ¿Meissner effect¿ which is characteristic of superconducting media. We review some of the evidence for this effect and present new evidence for it using recently found black hole solutions in string theory and Kaluza-Klein theory. We also present some new solutions, which arise naturally in string theory, which are non-superconducting extremal black holes. We present a nice geometrical interpretation of these effects derived by looking carefully at the higher dimensional configurations from which the lower dimensional black hole solutions are obtained. We show that other extremal solitonic objects in string theory (such as p-branes) can also display superconducting properties. In particular, we argue that the relativistic London equation will hold on the world volume of ¿light¿ superconducting p-branes (which are embedded in flat space), and that minimally coupled zero modes will propagate in the adS factor of the near-horizon geometries of "heavy," or gravitating, superconducting p-branes.

The Bonenblust-Hille inequality for homogeneous polynomials is hypercontractive

The Bohnenblust-Hille inequality says that the $\ell^{\frac{2m}{m+1}}$ -norm of the coefficients of an $m$-homogeneous polynomial $P$ on $\Bbb{C}^n$ is bounded by $\| P \|_\infty$ times a constant independent of $n$, where $\|\cdot \|_\infty$ denotes the supremum norm on the polydisc $\mathbb{D}^n$. The main result of this paper is that this inequality is hypercontractive, i.e., the constant can be taken to be $C^m$ for some $C>1$. Combining this improved version of the Bohnenblust-Hille inequality with other results, we obtain the following: The Bohr radius for the polydisc $\mathbb{D}^n$ behaves asymptotically as $\sqrt{(\log n)/n}$ modulo a factor bounded away from 0 and infinity, and the Sidon constant for the set of frequencies $\bigl\{ \log n: n \text{a positive integer} \le N\bigr\}$ is $\sqrt{N}\exp\{(-1/\sqrt{2}+o(1))\sqrt{\log N\log\log N}\}$.

Epireflections and supercompact cardinals

We prove that, under suitable assumptions on a category C, the existence of supercompact cardinals implies that every absolute epireflective class of objects of C is a small-orthogonality class. More precisely, if L is a localization functor on an accessible category C such that the unit morphism X→LX is an extremal epimorphism for all X, and the class of L-local objects is defined by an absolute formula with parameters, then the existence of a supercompact cardinal above the cardinalities of the parameters implies that L is a localization with respect to some set of morphisms.

Directional discrepancy in two dimensions

In the present paper, we study the geometric discrepancy with respect to families of rotated rectangles. The well-known extremal cases are the axis-parallel rectangles (logarithmic discrepancy) and rectangles rotated in all possible directions (polynomial discrepancy). We study several intermediate situations: lacunary sequences of directions, lacunary sets of finite order, and sets with small Minkowski dimension. In each of these cases, extensions of a lemma due to Davenport allow us to construct appropriate rotations of the integer lattice which yield small discrepancy.

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.

Statistical treatment of grain-size curves and empirical distributions: densities as compositions?

The preceding two editions of CoDaWork included talks on the possible considerationof densities as infinite compositions: Egozcue and D´ıaz-Barrero (2003) extended theEuclidean structure of the simplex to a Hilbert space structure of the set of densitieswithin a bounded interval, and van den Boogaart (2005) generalized this to the setof densities bounded by an arbitrary reference density. From the many variations ofthe Hilbert structures available, we work with three cases. For bounded variables, abasis derived from Legendre polynomials is used. For variables with a lower bound, westandardize them with respect to an exponential distribution and express their densitiesas coordinates in a basis derived from Laguerre polynomials. Finally, for unboundedvariables, a normal distribution is used as reference, and coordinates are obtained withrespect to a Hermite-polynomials-based basis.To get the coordinates, several approaches can be considered. A numerical accuracyproblem occurs if one estimates the coordinates directly by using discretized scalarproducts. Thus we propose to use a weighted linear regression approach, where all k-order polynomials are used as predictand variables and weights are proportional to thereference density. Finally, for the case of 2-order Hermite polinomials (normal reference)and 1-order Laguerre polinomials (exponential), one can also derive the coordinatesfrom their relationships to the classical mean and variance.Apart of these theoretical issues, this contribution focuses on the application of thistheory to two main problems in sedimentary geology: the comparison of several grainsize distributions, and the comparison among different rocks of the empirical distribution of a property measured on a batch of individual grains from the same rock orsediment, like their composition

Microdiàlisis cerebral aplicada a l'estudi del metabolisme energètic i a la resposta neuroinflamatòria dels pacients amb traumatisme cranioencefàlic

La tècnica de la microdiàlisis cerebral (MDC) és un instrument que proporciona informació rellevant en la monitorització del metabolisme cerebral en els pacients neurocrítics. El lactat i l’índex lactat-piruvat (ILP) són dos marcadors utilitzats per a la detecció de la hipòxia cerebral en pacients que han patit un traumatisme cranioencefàlic (TCE). Aquests dos marcadors poden estar anormalment elevats en circumstàncies que no cursen amb hipòxia tissular. Per una altra banda la recent aparició dels catèters de MDC amb porus de major mida denominats d’”alta resolució”, permet ampliar el rang de molècules que es poden detectar en el dialitzat. Objectius: 1) descriure les característiques del metabolisme energètic cerebral que s’observa en la fase aguda dels pacients que han patit un TCE en base als dos indicadors del metabolisme anaeròbic: lactat i ILP, i 2) determinar la recuperació relativa (RR) de les molècules implicades en la resposta neuroinflamatòria: de IL-1β, IL- 6, IL-8 i IL-10. Material i mètodes: Es van seleccionar 46 pacients d’una cohort de pacients amb TCE moderat o greu ingressats a la Unitat de Cures Intensives de l’Hospital Universitari de la Vall d’Hebron i monitoritzats amb MDC. Es van analitzar els nivells de lactat i ILP i es va correlacionar amb els nivells de PtiO2. Es van realitzar experiments in vitro per estudiar la recuperació de les membranes de 100 KDa per tal de poder interpretar posteriorment els nivells reals de les molècules estudiades en l’espai extracel•lular del teixit cerebral. Resultats: La concordança entre el lactat i l’índex LP per a determinar episodis de disfunció metabòlica va ser dèbil (índex de kappa = 0,36, IC 95%: 0,34-0,39). Més del 80% dels casos en què el lactat i l’índex LP es trobaven incrementats, els valors de la PtiO2 es van trobar dins els rangs de normalitat (PtiO2&15mmHg). La recuperació de les citoquines a través de la membrana de microdiàlisis va ser menor de l’esperat tenint en compte la mida dels porus de la membrana. Conclusions: el lactat i l’índex LP elevats va ser una troballa freqüent després d’un TCE i no es va relacionar, en la majoria de casos, amb episodis d’hipòxia tissular. Per un altra part la mida del porus de la membrana no és l’únic paràmetre indicador de la RR de macromolècules.

Equidistribution estimates for Fekete points on complex manifolds

We study the equidistribution of Fekete points in a compact complex manifold. These are extremal point configurations defined through sections of powers of a positive line bundle. Their equidistribution is a known result. The novelty of our approach is that we relate them to the problem of sampling and interpolation on line bundles, which allows us to estimate the equidistribution of the Fekete points quantitatively. In particular we estimate the Kantorovich-Wasserstein distance of the Fekete points to its limiting measure. The sampling and interpolation arrays on line bundles are a subject of independent interest, and we provide necessary density conditions through the classical approach of Landau, that in this context measures the local dimension of the space of sections of the line bundle. We obtain a complete geometric characterization of sampling and interpolation arrays in the case of compact manifolds of dimension one, and we prove that there are no arrays of both sampling and interpolation in the more general setting of semipositive line bundles.

La teoría de Morales-Ramis y el algoritmo de Kovacic

La teor\'\ı a de Morales–Ramis es la teor\'\ı a de Galois en el contextode los sistemas din\'amicos y relaciona dos tipos diferentes de integrabilidad:integrabilidad en el sentido de Liouville de un sistema hamiltonianoe integrabilidad en el sentido de la teor\'\ı a de Galois diferencial deuna ecuaci\'on diferencial. En este art\'\i culo se presentan algunas aplicacionesde la teor\'\i a de Morales–Ramis en problemas de no integrabilidadde sistemas hamiltonianos cuya ecuaci\'on variacional normal a lo largode una curva integral particular es una ecuaci\'on diferencial lineal desegundo orden con coeficientes funciones racionales. La integrabilidadde la ecuaci\'on variacional normal es analizada mediante el algoritmode Kovacic.

Greenhouse gases and climatic states of minimum entropy production

The hypothesis of minimum entropy production is applied to a simple one-dimensional energy balance model and is analysed for different values of the radiative forcing due to greenhouse gases. The extremum principle is used to determine the planetary “conductivity” and to avoid the “diffusive” approximation, which is commonly assumed in this type of model. For present conditions the result at minimum radiative entropy production is similar to that obtained by applying the classical model. Other climatic scenarios show visible differences, with better behaviour for the extremal case

Identifying protein-coding genes in genomic sequences

The vast majority of the biology of a newly sequenced genome is inferred from the set of encoded proteins. Predicting this set is therefore invariably the first step after the completion of the genome DNA sequence. Here we review the main computational pipelines used to generate the human reference protein-coding gene sets.

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 the problem 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.

Experimental design on the simplex

Optimum experimental designs depend on the design criterion, the model andthe design region. The talk will consider the design of experiments for regressionmodels in which there is a single response with the explanatory variables lying ina simplex. One example is experiments on various compositions of glass such asthose considered by Martin, Bursnall, and Stillman (2001).Because of the highly symmetric nature of the simplex, the class of models thatare of interest, typically Scheff´e polynomials (Scheff´e 1958) are rather differentfrom those of standard regression analysis. The optimum designs are also ratherdifferent, inheriting a high degree of symmetry from the models.In the talk I will hope to discuss a variety of modes for such experiments. ThenI will discuss constrained mixture experiments, when not all the simplex is availablefor experimentation. Other important aspects include mixture experimentswith extra non-mixture factors and the blocking of mixture experiments.Much of the material is in Chapter 16 of Atkinson, Donev, and Tobias (2007).If time and my research allows, I would hope to finish with a few comments ondesign when the responses, rather than the explanatory variables, lie in a simplex.ReferencesAtkinson, A. C., A. N. Donev, and R. D. Tobias (2007). Optimum ExperimentalDesigns, with SAS. Oxford: Oxford University Press.Martin, R. J., M. C. Bursnall, and E. C. Stillman (2001). Further results onoptimal and efficient designs for constrained mixture experiments. In A. C.Atkinson, B. Bogacka, and A. Zhigljavsky (Eds.), Optimal Design 2000,pp. 225–239. Dordrecht: Kluwer.Scheff´e, H. (1958). Experiments with mixtures. Journal of the Royal StatisticalSociety, Ser. B 20, 344–360.1

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.