10,483 research outputs found

    Upward-closed hereditary families in the dominance order

    Get PDF
    The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Hammer et al. and Merris, the degree sequences of threshold and split graphs form upward-closed sets within the dominance orders they belong to, i.e., any degree sequence majorizing a split or threshold sequence must itself be split or threshold, respectively. Motivated by the fact that threshold graphs and split graphs have characterizations in terms of forbidden induced subgraphs, we define a class F\mathcal{F} of graphs to be dominance monotone if whenever no realization of ee contains an element F\mathcal{F} as an induced subgraph, and dd majorizes ee, then no realization of dd induces an element of F\mathcal{F}. We present conditions necessary for a set of graphs to be dominance monotone, and we identify the dominance monotone sets of order at most 3.Comment: 15 pages, 6 figure

    Arc-quasianalytic functions

    Full text link
    We work with quasianalytic classes of functions. Consider a real-valued function y = f(x) on an open subset U of Euclidean space, which satisfies a quasianalytic equation G(x, y) = 0. We prove that f is arc-quasianalytic (i.e., its restriction to every quasianalytic arc is quasianalytic) if and only if f becomes quasianalytic after (a locally finite covering of U by) finite sequences of local blowing-ups. This generalizes a theorem of the first two authors on arc-analytic functions.Comment: 12 page

    Two properties of vectors of quadratic forms in Gaussian random variables

    Get PDF
    We study distributions of random vectors whose components are second order polynomials in Gaussian random variables. Assuming that the law of such a vector is not absolutely continuous with respect to Lebesgue measure, we derive some interesting consequences. Our second result gives a characterization of limits in law for sequences of such vectors.Comment: 14 page

    Reply to "Comment on `Quenches in quantum many-body systems: One-dimensional Bose-Hubbard model reexamined' ''

    Full text link
    In his Comment [see preceding Comment, Phys. Rev. A 82, 037601 (2010)] on the paper by Roux [Phys. Rev. A 79, 021608(R) (2009)], Rigol argued that the energy distribution after a quench is not related to standard statistical ensembles and cannot explain thermalization. The latter is proposed to stem from what he calls the eigenstate thermalization hypothesis and which boils down to the fact that simple observables are expected to be smooth functions of the energy. In this Reply, we show that there is no contradiction or confusion between the observations and discussions of Roux and the expected thermalization scenario discussed by Rigol. In addition, we emphasize a few other important aspects, in particular the definition of temperature and the equivalence of ensemble, which are much more difficult to show numerically even though we believe they are essential to the discussion of thermalization. These remarks could be of interest to people interested in the interpretation of the data obtained on finite-size systems.Comment: 3 page

    Distance distribution in random graphs and application to networks exploration

    Full text link
    We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of determining the proportion of edges connecting nodes that are at identical distance from the source node. The evolution of this quantity with the probability of existence of the edges exhibits intriguing oscillatory behavior. In order to perform our analysis, we introduce a new way of computing the distribution of distances between nodes. Our method outperforms previous similar analyses and leads to estimates that coincide remarkably well with numerical simulations. It allows us to characterize the phase transitions appearing when the connectivity probability varies.Comment: 12 pages, 8 figures (18 .eps files

    Dispersion of carbon nanotubes in polypropylene via multilayer coextrusion: Influence on the mechanical properties

    Get PDF
    The authors would like to thank PSA for funding this research and providing some of the materials used in this study. We also would like to thank R. Glénat, P. Soria, E. Dandeu, A. Grand- montagne and A. Dubruc for their help in the preparation and the optical and mechanical characterizations of the samples presented in this study.Multilayer coextrusion was used to disperse Carbon Nanotubes (CNT) in polypropylene (PP). The dilution of commercially available masterbatches using a twin-screw extruder was first applied to produce several formulations, which were then mixed with PP using a multilayer coextrusion device to obtain films or pellets with CNT concentrations between 0.1 and 1%wt. The influence of the specific mechanical energy (SME) during the dilution step, of the addition of a compatibilizer, and of the multilayer tool on the CNT dispersion within the matrix was highlighted. The effect of the dispersion on the thermomechanical properties of the resulting materials was studied. We showed notably that films containing 0.2%wt CNT, 1%wt of PPgAm, prepared at high SME presented a Young’s modulus increase of 25e30% without significant decrease in the elongation at break. These results, using low amounts of CNT and industrially available devices, may show a new path for producing nanocomposites

    Observation of implicit complexity by non confluence

    Get PDF
    We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of cons-free programs, the class of programs with an interpretation, and the class of programs with a quasi-interpretation together with a termination proof by the product path ordering. They all correspond to PTIME. We prove that adding non confluence to the rules leads to respectively PTIME, NPTIME and PSPACE. Our thesis is that the separation of the classes is actually a witness of the intentional properties of the initial classes of programs

    Fast optimal transition between two equilibrium states

    Full text link
    We demonstrate a technique based on invariants of motion for a time-dependent Hamiltonian, allowing a fast transition to a final state identical in theory to that obtained through a perfectly adiabatic transformation. This method is experimentally applied to the fast decompression of an ultracold cloud of Rubidium 87 atoms held in a harmonic magnetic trap, in the presence of gravity. We are able to decompress the trap by a factor of 15 within 35 ms with a strong suppression of the sloshing and breathing modes induced by the large vertical displacement and curvature reduction of the trap. When compared to a standard linear decompression, we achieve a gain of a factor of 37 on the transition time.Comment: 5 pages, 4 figures, an error in Eq. (2) has been correcte
    corecore