Robustness of entanglement

In the quest to completely describe entanglement in the general case of a finite number of parties sharing a physical system of finite-dimensional Hilbert space an entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurance of entanglement against noise and jamming. Its properties are studied comprehensively. Analytical expressions for the robustness are given for pure states of two-party systems, and analytical bounds for mixed states of two-party systems. Specific results are obtained mainly for the qubit-qubit system (qubit denotes quantum bit). As by-products local pseudomixtures are generalized, a lower bound for the relative volume of separable states is deduced, and arguments for considering convexity a necessary condition of any entanglement measure are put forward.

Search for nonstandard Higgs boson in diphoton events at p anti-p collisions

We estimate the attainable limits on the coupling of a nonstandard Higgs boson to two photons taking into account the data collected by the Fermilab collaborations on diphoton events. We based our analysis on a general set of dimension-6 effective operators that give rise to anomalous couplings in the bosonic sector of the standard model. If the coefficients of all blind operators have the same magnitude, indirect bounds on the anomalous triple vector-boson couplings can also be inferred, provided there is no large cancellation in the Higgs-gamma-gamma coupling.

Limits on Anomalous Couplings from Higgs Boson Production at the Fermilab Tevatron Collider

We estimate the attainable limits on the coefficients of dimension-6 operators from the analysis of Higgs boson phenomenology, in the framework of a SUL(2)UY(1) gauge-invariant effective Lagrangian. Our results, based on the data sample already collected by the collaborations at Fermilab Tevatron, show that the coefficients of Higgs-vector boson couplings can be determined with unprecedented accuracy. Assuming that the coefficients of all blind operators are of the same magnitude, we are also able to impose more restrictive bounds on the anomalous vector-boson triple couplings than the present limit from double gauge boson production at the Tevatron collider.

Black holes from nucleating strings

We evaluate the probability that a loop of string that has spontaneously nucleated during inflation will form a black hole upon collapse, after the end of inflation. We then use the observational bounds on the density of primordial black holes to put constraints on the parameters of the model. Combining these constraints with current upper limits on the expansion rate during inflation, we conclude that the density of black holes formed from nucleating strings is too low to be observed. Also, constraints on domain wall nucleation and monopole pair production during inflation are briefly discussed.

Photon spectrum produced by the late decay of a cosmic neutrino background

We obtain the photon spectrum induced by a cosmic background of unstable neutrinos. We study the spectrum in a variety of cosmological scenarios and also we allow for the neutrinos having a momentum distribution (only a critical matter-dominated universe and neutrinos at rest have been considered until now). Our results can be helpful when extracting bounds on neutrino electric and magnetic moments from cosmic photon background observations.

Statistical mechanical theory of an oscillating isolated system: The relaxation to equilibrium

In this Contribution we show that a suitably defined nonequilibrium entropy of an N-body isolated system is not a constant of the motion, in general, and its variation is bounded, the bounds determined by the thermodynamic entropy, i.e., the equilibrium entropy. We define the nonequilibrium entropy as a convex functional of the set of n-particle reduced distribution functions (n ? N) generalizing the Gibbs fine-grained entropy formula. Additionally, as a consequence of our microscopic analysis we find that this nonequilibrium entropy behaves as a free entropic oscillator. In the approach to the equilibrium regime, we find relaxation equations of the Fokker-Planck type, particularly for the one-particle distribution function.

Sequential decisions in allocation problems

[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player

Origin of a restraining bend in an evolving strike-slip system: The Cenozoic As Pontes basin (NW Spain)

The As Pontes basin (12 km2), NW Iberian Peninsula, is bounded by a double restraining bend of a dextral strike-slip fault, which is related to the western onshore end of the Pyrenean belt. Surface and subsurface data obtained from intensive coal exploration and mining in the basin since the 1960s together with additional structural and stratigraphic sequence analysis allowed us to determine the geometric relationships between tectonic structures and stratigraphic markers. The small size of the basin and the large amount of quality data make the As Pontes basin a unique natural laboratory for improving our understanding of the origin and evolution of restraining bends. The double restraining bend is the end stage of the structural evolution of a compressive underlapping stepover, where the basin was formed. During the first stage (stepover stage), which began ca. 30 Ma ago (latest Rupelian) and lasted 3.4 My, two small isolated basins bounded by thrusts and normal faults were formed. For 1.3 My, the strike-slip faults, which defined the stepover, grew towards each other until joining and forming the double restraining bend, which bounds one large As Pontes basin (transition stage). The history of the basin was controlled by the activity of the double restraining bend for a further 3.4 My (restraining bend stage) and ended in mid-Aquitanian times (ca. 22 Ma).

Criteria for hitting probabilities with applications to systems of stochastic wave equations

We develop several results on hitting probabilities of random fields which highlight the role of the dimension of the parameter space. This yields upper and lower bounds in terms of Hausdorff measure and Bessel-Riesz capacity, respectively. We apply these results to a system of stochastic wave equations in spatial dimension k >- 1 driven by a d-dimensional spatially homogeneous additive Gaussian noise that is white in time and colored in space.

Retaining principal components for discrete variables

The present study discusses retention criteria for principal components analysis (PCA) applied to Likert scale items typical in psychological questionnaires. The main aim is to recommend applied researchers to restrain from relying only on the eigenvalue-than-one criterion; alternative procedures are suggested for adjusting for sampling error. An additional objective is to add evidence on the consequences of applying this rule when PCA is used with discrete variables. The experimental conditions were studied by means of Monte Carlo sampling including several sample sizes, different number of variables and answer alternatives, and four non-normal distributions. The results suggest that even when all the items and thus the underlying dimensions are independent, eigenvalues greater than one are frequent and they can explain up to 80% of the variance in data, meeting the empirical criterion. The consequences of using Kaiser"s rule are illustrated with a clinical psychology example. The size of the eigenvalues resulted to be a function of the sample size and the number of variables, which is also the case for parallel analysis as previous research shows. To enhance the application of alternative criteria, an R package was developed for deciding the number of principal components to retain by means of confidence intervals constructed about the eigenvalues corresponding to lack of relationship between discrete variables.

mGPT: a probabilistic planner based on heuristic search

We describe the version of the GPT planner to be used in the planning competition. This version, called mGPT, solves mdps specified in the ppddllanguage by extracting and using different classes of lower bounds, along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations of the mdp where alternativeprobabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms, on the other hand, use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state with the greedy policy.

Width and serialization of classical planning problems

We introduce a width parameter that bounds the complexity of classical planning problems and domains, along with a simple but effective blind-search procedure that runs in time that is exponential in the problem width. We show that many benchmark domains have a bounded and small width provided thatgoals are restricted to single atoms, and hence that such problems are provably solvable in low polynomial time. We then focus on the practical value of these ideas over the existing benchmarks which feature conjunctive goals. We show that the blind-search procedure can be used for both serializing the goal into subgoals and for solving the resulting problems, resulting in a ‘blind’ planner that competes well with a best-first search planner guided by state-of-the-art heuristics. In addition, ideas like helpful actions and landmarks can be integrated as well, producing a planner with state-of-the-art performance.

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.

Gene Promoter Evolution Targets the Center of the Human Protein Interaction Network

Assessing the contribution of promoters and coding sequences to gene evolution is an important step toward discovering the major genetic determinants of human evolution. Many specific examples have revealed the evolutionary importance of cis-regulatory regions. However, the relative contribution of regulatory and coding regions to the evolutionary process and whether systemic factors differentially influence their evolution remains unclear. To address these questions, we carried out an analysis at the genome scale to identify signatures of positive selection in human proximal promoters. Next, we examined whether genes with positively selected promoters (Prom+ genes) show systemic differences with respect to a set of genes with positively selected protein-coding regions (Cod+ genes). We found that the number of genes in each set was not significantly different (8.1% and 8.5%, respectively). Furthermore, a functional analysis showed that, in both cases, positive selection affects almost all biological processes and only a few genes of each group are located in enriched categories, indicating that promoters and coding regions are not evolutionarily specialized with respect to gene function. On the other hand, we show that the topology of the human protein network has a different influence on the molecular evolution of proximal promoters and coding regions. Notably, Prom+ genes have an unexpectedly high centrality when compared with a reference distribution (P = 0.008, for Eigenvalue centrality). Moreover, the frequency of Prom+ genes increases from the periphery to the center of the protein network (P = 0.02, for the logistic regression coefficient). This means that gene centrality does not constrain the evolution of proximal promoters, unlike the case with coding regions, and further indicates that the evolution of proximal promoters is more efficient in the center of the protein network than in the periphery. These results show that proximal promoters have had a systemic contribution to human evolution by increasing the participation of central genes in the evolutionary process.

On the bicanonical map of irregular varieties

From the point of view of uniform bounds for the birationality of pluricanonical maps, irregular varieties of general type and maximal Albanese dimension behave similarly to curves. In fact Chen-Hacon showed that, at least when their holomorphic Euler characteristic is positive, the tricanonical map of such varieties is always birational. In this paper we study the bicanonical map. We consider the natural subclass of varieties of maximal Albanese dimension formed by primitive varieties of Albanese general type. We prove that the only such varieties with non-birational bicanonical map are the natural higher-dimensional generalization to this context of curves of genus $2$: varieties birationally equivalent to the theta-divisor of an indecomposable principally polarized abelian variety. The proof is based on the (generalized) Fourier-Mukai transform.