64,947 research outputs found

    Avoiding vincular patterns on alternating words

    Get PDF
    A word w=w1w2⋯wnw=w_1w_2\cdots w_n is alternating if either w1w3⋯w_1w_3\cdots (when the word is up-down) or w1>w2w4<⋯w_1>w_2w_4<\cdots (when the word is down-up). The study of alternating words avoiding classical permutation patterns was initiated by the authors in~\cite{GKZ}, where, in particular, it was shown that 123-avoiding up-down words of even length are counted by the Narayana numbers. However, not much was understood on the structure of 123-avoiding up-down words. In this paper, we fill in this gap by introducing the notion of a cut-pair that allows us to subdivide the set of words in question into equivalence classes. We provide a combinatorial argument to show that the number of equivalence classes is given by the Catalan numbers, which induces an alternative (combinatorial) proof of the corresponding result in~\cite{GKZ}. Further, we extend the enumerative results in~\cite{GKZ} to the case of alternating words avoiding a vincular pattern of length 3. We show that it is sufficient to enumerate up-down words of even length avoiding the consecutive pattern 132‾\underline{132} and up-down words of odd length avoiding the consecutive pattern 312‾\underline{312} to answer all of our enumerative questions. The former of the two key cases is enumerated by the Stirling numbers of the second kind.Comment: 25 pages; To appear in Discrete Mathematic

    Pattern-avoiding alternating words

    Get PDF
    A word w=w1w2⋯wnw=w_1w_2\cdots w_n is alternating if either w1w3⋯w_1w_3\cdots (when the word is up-down) or w1>w2w4<⋯w_1>w_2w_4<\cdots (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words. We enumerate up-down (equivalently, down-up) words via finding a bijection with order ideals of a certain poset. Further, we show that the number of 123-avoiding up-down words of even length is given by the Narayana numbers, which is also the case, shown by us bijectively, with 132-avoiding up-down words of even length. We also give formulas for enumerating all other cases of avoidance of a permutation pattern of length 3 on alternating words

    Phases and phase stabilities of Fe3X alloys (X=Al, As, Ge, In, Sb, Si, Sn, Zn) prepared by mechanical alloying

    Get PDF
    Mechanical alloying with a Spex 8000 mixer/mill was used to prepare several alloys of the Fe3X composition, where the solutes X were from groups IIB, IIIB, IVB, and VB of the periodic table. Using x-ray diffractometry and Mössbauer spectrometry, we determined the steady-state phases after milling for long times. The tendencies of the alloys to form the bcc phase after milling are predicted well with the modified usage of a Darken–Gurry plot of electronegativity versus metallic radius. Thermal stabilities of some of these phases were studied. In the cases of Fe3Ge and Fe3Sn, there was the formation of transient D03 and B2 order during annealing, although this ordered structure was replaced by equilibrium phases upon further annealing

    Optimal Controlled Teleportation

    Full text link
    We give the analytic expressions of maximal probabilities of successfully controlled teleportating an unknown qubit via every kind of tripartite states. Besides, another kind of localizable entanglement is also determined. Furthermore, we give the sufficient and necessary condition that a three-qubit state can be collapsed to an EPR pair by a measurement on one qubit, and characterize the three-qubit states that can be used as quantum channel for controlled teleporting a qubit of unknown information with unit probability and with unit fidelity.Comment: 4 page
    • …
    corecore