2,232 research outputs found

    Representing Partitions on Trees

    Get PDF
    In evolutionary biology, biologists often face the problem of constructing a phylogenetic tree on a set X of species from a multiset Π of partitions corresponding to various attributes of these species. One approach that is used to solve this problem is to try instead to associate a tree (or even a network) to the multiset ΣΠ consisting of all those bipartitions {A,X − A} with A a part of some partition in Π. The rational behind this approach is that a phylogenetic tree with leaf set X can be uniquely represented by the set of bipartitions of X induced by its edges. Motivated by these considerations, given a multiset Σ of bipartitions corresponding to a phylogenetic tree on X, in this paper we introduce and study the set P(Σ) consisting of those multisets of partitions Π of X with ΣΠ = Σ. More specifically, we characterize when P(Σ) is non-empty, and also identify some partitions in P(Σ) that are of maximum and minimum size. We also show that it is NP-complete to decide when P(Σ) is non-empty in case Σ is an arbitrary multiset of bipartitions of X. Ultimately, we hope that by gaining a better understanding of the mapping that takes an arbitrary partition system Π to the multiset ΣΠ, we will obtain new insights into the use of median networks and, more generally, split-networks to visualize sets of partitions

    Institutional Ownership and Return Predictability Across Economically Unrelated Stocks

    Get PDF
    We document strong weekly lead-lag return predictability across stocks from different industries with no customer-supplier linkages (economically unrelated stocks). Between 1980 and 2010, the industry-neutral long-short hedge portfolio earns an average of over 19 basis points per week. This return predictability arises exclusively from pairs of stocks in which there are common institutional owners. This predictability is a new phenomenon which does not originate from the slow information diffusion underlying previously documented lead-lag effects, weekly reversals, momentum, nonsynchronous trading, or other known factors. Our findings suggest that institutional portfolio reallocations can induce return predictability among otherwise unrelated stocks

    Distinct high-T transitions in underdoped Ba1−x_{1-x}Kx_{x}Fe2_{2}As2_{2}

    Get PDF
    In contrast to the simultaneous structural and magnetic first order phase transition T0T_{0} previously reported, our detailed investigation on an underdoped Ba0.84_{0.84}K0.16_{0.16}Fe2_{2}As2_{2} single crystal unambiguously revealed that the transitions are not concomitant. The tetragonal (τ\tau: I4/mmm) - orthorhombic (ϑ\vartheta: Fmmm) structural transition occurs at TS≃T_{S}\simeq 110 K, followed by an adjacent antiferromagnetic (AFM) transition at TN≃T_{N}\simeq 102 K. Hysteresis and coexistence of the τ\tau and ϑ\vartheta phases over a finite temperature range observed in our NMR experiments confirm the first order character of the structural transition and provide evidence that both TST_{S} and TNT_{N} are strongly correlated. Our data also show that superconductivity (SC) develops in the ϑ\vartheta phase below TcT_{c} = 20 K and coexists with long range AFM. This new observation, TS≠TNT_{S}\neq T_{N}, firmly establishes another similarity between the hole-doped BaFe2_{2}As2_{2} via K substitution and the electron-doped iron-arsenide superconductors.Comment: 4 pages, 3 figure

    ‘Rich’ and ‘poor’ in mentalizing: do expert mentalizers exist?

    Get PDF
    Mentalization theory is concerned with the capacity to notice, and make sense of, thoughts and feelings in self and others. This development may be healthy or impaired and therefore, by extension, it may be theorized that expertise in mentalizing can exist. Furthermore, a continuum from impairment to expertise should exist within separate dimensions of mentalizing: of self and of others. This study hypothesized that three groups would be distinguishable on the basis of their mentalizing capacities. In a cross-sectional design, Psychological Therapists (‘expert’ mentalizers; n = 51), individuals with a diagnosis of Borderline Personality Disorder (‘poor’ mentalizers; n = 43) and members of the general population (‘non-clinical controls’; n = 35) completed a battery of self-report measures. These assessed the mentalizing of self and of others (using an extended version of the Reflective Function Questionnaire (RFQ18)), alexithymia and cognitive empathy. As hypothesized, Psychological Therapists’ scores were higher than controls on self-mentalizing and control group scores were higher than those with BPD. Cognitive empathy scores in the BPD group indicated markedly lower capacities than the other two groups. Contrary to predictions, no significant differences were found between groups on mentalizing others in RFQ18 scores. The Psychological Therapist and BPD profiles were characterized by differential impairment in self and others but in opposing directions. Results suggest that the RFQ18 can identify groups with expertise in mentalizing. Implications of these results for the effectiveness of psychological therapy and of Psychological Therapists are discussed

    Injective split systems

    Full text link
    A split system S\mathcal S on a finite set XX, ∣XâˆŁâ‰„3|X|\ge3, is a set of bipartitions or splits of XX which contains all splits of the form {x,X−{x}}\{x,X-\{x\}\}, x∈Xx \in X. To any such split system S\mathcal S we can associate the Buneman graph B(S)\mathcal B(\mathcal S) which is essentially a median graph with leaf-set XX that displays the splits in S\mathcal S. In this paper, we consider properties of injective split systems, that is, split systems S\mathcal S with the property that medB(S)(Y)≠medB(S)(Yâ€Č)\mathrm{med}_{\mathcal B(\mathcal S)}(Y) \neq \mathrm{med}_{\mathrm B(\mathcal S)}(Y') for any 3-subsets Y,Yâ€ČY,Y' in XX, where medB(S)(Y)\mathrm {med}_{\mathcal B(\mathcal S)}(Y) denotes the median in B(S)\mathcal B(\mathcal S) of the three elements in YY considered as leaves in B(S)\mathcal B(\mathcal S). In particular, we show that for any set XX there always exists an injective split system on XX, and we also give a characterization for when a split system is injective. We also consider how complex the Buneman graph B(S)\mathcal B(\mathcal S) needs to become in order for a split system S\mathcal S on XX to be injective. We do this by introducing a quantity for ∣X∣|X| which we call the injective dimension for ∣X∣|X|, as well as two related quantities, called the injective 2-split and the rooted-injective dimension. We derive some upper and lower bounds for all three of these dimensions and also prove that some of these bounds are tight. An underlying motivation for studying injective split systems is that they can be used to obtain a natural generalization of symbolic tree maps. An important consequence of our results is that any three-way symbolic map on XX can be represented using Buneman graphs.Comment: 22 pages, 3 figure

    Folding and unfolding phylogenetic trees and networks

    Get PDF
    Phylogenetic networks are rooted, labelled directed acyclic graphs which are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any phylogenetic network NN can be "unfolded" to obtain a MUL-tree U(N)U(N) and, conversely, a MUL-tree TT can in certain circumstances be "folded" to obtain a phylogenetic network F(T)F(T) that exhibits TT. In this paper, we study properties of the operations UU and FF in more detail. In particular, we introduce the class of stable networks, phylogenetic networks NN for which F(U(N))F(U(N)) is isomorphic to NN, characterise such networks, and show that they are related to the well-known class of tree-sibling networks.We also explore how the concept of displaying a tree in a network NN can be related to displaying the tree in the MUL-tree U(N)U(N). To do this, we develop a phylogenetic analogue of graph fibrations. This allows us to view U(N)U(N) as the analogue of the universal cover of a digraph, and to establish a close connection between displaying trees in U(N)U(N) and reconcilingphylogenetic trees with networks

    An ordinary differential equation model for full thickness wounds and the effects of diabetes

    Get PDF
    Wound healing is a complex process in which a sequence of interrelated phases contributes to a reduction in wound size. For diabetic patients, many of these processes are compromised, so that wound healing slows down. In this paper we present a simple ordinary differential equation model for wound healing in which attention focusses on the dominant processes that contribute to closure of a full thickness wound. Asymptotic analysis of the resulting model reveals that normal healing occurs in stages: the initial and rapid elastic recoil of the wound is followed by a longer proliferative phase during which growth in the dermis dominates healing. At longer times, fibroblasts exert contractile forces on the dermal tissue, the resulting tension stimulating further dermal tissue growth and enhancing wound closure. By fitting the model to experimental data we find that the major difference between normal and diabetic healing is a marked reduction in the rate of dermal tissue growth for diabetic patients. The model is used to estimate the breakdown of dermal healing into two processes: tissue growth and contraction, the proportions of which provide information about the quality of the healed wound. We show further that increasing dermal tissue growth in the diabetic wound produces closure times similar to those associated with normal healing and we discuss the clinical implications of this hypothesised treatment

    High Magnetic Field NMR Studies of LiVGe2_2O6_6, a quasi 1-D Spin S=1S = 1 System

    Full text link
    We report 7^{7}Li pulsed NMR measurements in polycrystalline and single crystal samples of the quasi one-dimensional S=1 antiferromagnet LiVGe2_2O6_6, whose AF transition temperature is TN≃24.5T_{\text{N}}\simeq 24.5 K. The field (B0B_0) and temperature (TT) ranges covered were 9-44.5 T and 1.7-300 K respectively. The measurements included NMR spectra, the spin-lattice relaxation rate (T1−1T_1^{-1}), and the spin-phase relaxation rate (T2−1T_2^{-1}), often as a function of the orientation of the field relative to the crystal axes. The spectra indicate an AF magnetic structure consistent with that obtained from neutron diffraction measurements, but with the moments aligned parallel to the c-axis. The spectra also provide the TT-dependence of the AF order parameter and show that the transition is either second order or weakly first order. Both the spectra and the T1−1T_1^{-1} data show that B0B_0 has at most a small effect on the alignment of the AF moment. There is no spin-flop transition up to 44.5 T. These features indicate a very large magnetic anisotropy energy in LiVGe2_2O6_6 with orbital degrees of freedom playing an important role. Below 8 K, T1−1T_1^{-1} varies substantially with the orientation of B0B_0 in the plane perpendicular to the c-axis, suggesting a small energy gap for magnetic fluctuations that is very anisotropic.Comment: submitted to Phys. Rev.

    Simulating chemistry efficiently on fault-tolerant quantum computers

    Get PDF
    Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf. Comput.}, \textbf{6}:81, 2006]. For a given approximation error Ï”\epsilon, arbitrary single-qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is O(logâĄÏ”)O(\log \epsilon) or O(log⁥logâĄÏ”)O(\log \log \epsilon); with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for Lithium hydride.Comment: 33 pages, 18 figure
    • 

    corecore