260,256 research outputs found

    A strong operator topology adiabatic theorem

    Full text link
    We prove an adiabatic theorem for the evolution of spectral data under a weak additive perturbation in the context of a system without an intrinsic time scale. For continuous functions of the unperturbed Hamiltonian the convergence is in norm while for a larger class functions, including the spectral projections associated to embedded eigenvalues, the convergence is in the strong operator topology.Comment: 15 pages, no figure

    Adaptive Gibbs samplers

    Get PDF
    We consider various versions of adaptive Gibbs and Metropolis- within-Gibbs samplers, which update their selection probabilities (and perhaps also their proposal distributions) on the fly during a run, by learning as they go in an attempt to optimise the algorithm. We present a cautionary example of how even a simple-seeming adaptive Gibbs sampler may fail to converge. We then present various positive results guaranteeing convergence of adaptive Gibbs samplers under certain conditions

    Generating functions for Wilf equivalence under generalized factor order

    Full text link
    Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set (P,P)(P, \leq_P) by setting uPwu \leq_P w if there is a subword vv of ww of the same length as uu such that the ii-th character of vv is greater than or equal to the ii-th character of uu for all ii. This subword vv is called an embedding of uu into ww. For the case where PP is the positive integers with the usual ordering, they defined the weight of a word w=w1wnw = w_1\ldots w_n to be wt(w)=xi=1nwitn\text{wt}(w) = x^{\sum_{i=1}^n w_i} t^{n}, and the corresponding weight generating function F(u;t,x)=wPuwt(w)F(u;t,x) = \sum_{w \geq_P u} \text{wt}(w). They then defined two words uu and vv to be Wilf equivalent, denoted uvu \backsim v, if and only if F(u;t,x)=F(v;t,x)F(u;t,x) = F(v;t,x). They also defined the related generating function S(u;t,x)=wS(u)wt(w)S(u;t,x) = \sum_{w \in \mathcal{S}(u)} \text{wt}(w) where S(u)\mathcal{S}(u) is the set of all words ww such that the only embedding of uu into ww is a suffix of ww, and showed that uvu \backsim v if and only if S(u;t,x)=S(v;t,x)S(u;t,x) = S(v;t,x). We continue this study by giving an explicit formula for S(u;t,x)S(u;t,x) if uu factors into a weakly increasing word followed by a weakly decreasing word. We use this formula as an aid to classify Wilf equivalence for all words of length 3. We also show that coefficients of related generating functions are well-known sequences in several special cases. Finally, we discuss a conjecture that if uvu \backsim v then uu and vv must be rearrangements, and the stronger conjecture that there also must be a weight-preserving bijection f:S(u)S(v)f: \mathcal{S}(u) \rightarrow \mathcal{S}(v) such that f(u)f(u) is a rearrangement of uu for all uu.Comment: 23 page

    The quantum bit commitment theorem

    Full text link
    Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be impossible, but the claim is repeatedly challenged. The quantum bit commitment theorem is reviewed here and the central conceptual point, that an `Einstein-Podolsky-Rosen' attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. There is, indeed, no loophole in the theorem.Comment: LaTeX, 25 pages. Forthcoming in Foundations of Physics, May 200

    Unions Impose Stability on a Turbulent Construction Industry

    Get PDF
    Grabelsky31_Unions_Impose_Stability_on_a_Turbulent_Construction_Industry.pdf: 133 downloads, before Oct. 1, 2020

    Quivers and Three-Dimensional Lie Algebras

    Full text link
    We study a family of three-dimensional Lie algebras LμL_\mu that depend on a continuous parameter μ\mu. We introduce certain quivers, which we denote by Qm,nQ_{m,n} (m,nZ)(m,n \in \mathbb{Z}) and Q×Q_{\infty \times \infty}, and prove that idempotented versions of the enveloping algebras of the Lie algebras LμL_{\mu} are isomorphic to the path algebras of these quivers modulo certain ideals in the case that μ\mu is rational and non-rational, respectively. We then show how the representation theory of the quivers Qm,nQ_{m,n} and Q×Q_{\infty\times\infty} can be related to the representation theory of quivers of affine type AA, and use this relationship to study representations of the Lie algebras LμL_\mu. In particular, though it is known that the Lie algebras LμL_\mu are of wild representation type, we show that if we impose certain restrictions on weight decompositions, we obtain full subcategories of the category of representations of LμL_\mu that are of finite or tame representation type.Comment: 18 page

    Motivation and Performance

    Get PDF
    Faculty reflection on VCU Great Bike Race Book course. Course Description: This track will explore how motivation links to learning and performance
    corecore