127 research outputs found
Spin dynamics in high- superconductors
Key features of antiferromagnetic dynamical correlations in high-
superconductors cuprates are discussed. In underdoped regime, the sharp
resonance peak, occuring exclusively in the SC state, is accompanied by a
broader contribution located around 30 meV which remains above .
Their interplay may induce incommensurate structure in the superconducting
state.Comment: HTS99 Proceedings Miami (January 7-11 1999
How to kill epsilons with a dagger: a coalgebraic take on systems with algebraic label structure
We propose an abstract framework for modeling state-based systems with internal behavior as e.g. given by silent or ϵ-transitions. Our approach employs monads with a parametrized fixpoint operator † to give a semantics to those systems and implement a sound procedure of abstraction of the internal transitions, whose labels are seen as the unit of a free monoid. More broadly, our approach extends the standard coalgebraic framework for state-based systems by taking into account the algebraic structure of the labels of their transitions. This allows to consider a wide range of other examples, including Mazurkiewicz traces for concurrent systems.Funded by the ERDF through the Programme COMPETE and by the Portuguese Foundation for Science and Technology, project ref. FCOMP-01-0124-FEDER-020537 and SFRH/BPD/71956/2010. Acknowledge support by project ANR 12IS0 2001 PACE
Sound and complete axiomatizations of coalgebraic language equivalence
Coalgebras provide a uniform framework to study dynamical systems, including
several types of automata. In this paper, we make use of the coalgebraic view
on systems to investigate, in a uniform way, under which conditions calculi
that are sound and complete with respect to behavioral equivalence can be
extended to a coarser coalgebraic language equivalence, which arises from a
generalised powerset construction that determinises coalgebras. We show that
soundness and completeness are established by proving that expressions modulo
axioms of a calculus form the rational fixpoint of the given type functor. Our
main result is that the rational fixpoint of the functor , where is a
monad describing the branching of the systems (e.g. non-determinism, weights,
probability etc.), has as a quotient the rational fixpoint of the
"determinised" type functor , a lifting of to the category of
-algebras. We apply our framework to the concrete example of weighted
automata, for which we present a new sound and complete calculus for weighted
language equivalence. As a special case, we obtain non-deterministic automata,
where we recover Rabinovich's sound and complete calculus for language
equivalence.Comment: Corrected version of published journal articl
Functionalized Graphene Sheets Having High Carbon to Oxygen Ratios
Functionalized graphene sheets having a carbon to oxygen molar ratio of at least about 23:1 and method of preparing the same
Layer by layer - Combining Monads
We develop a method to incrementally construct programming languages. Our
approach is categorical: each layer of the language is described as a monad.
Our method either (i) concretely builds a distributive law between two monads,
i.e. layers of the language, which then provides a monad structure to the
composition of layers, or (ii) identifies precisely the algebraic obstacles to
the existence of a distributive law and gives a best approximant language. The
running example will involve three layers: a basic imperative language enriched
first by adding non-determinism and then probabilistic choice. The first
extension works seamlessly, but the second encounters an obstacle, which
results in a best approximant language structurally very similar to the
probabilistic network specification language ProbNetKAT
Non-Deterministic Kleene Coalgebras
In this paper, we present a systematic way of deriving (1) languages of
(generalised) regular expressions, and (2) sound and complete axiomatizations
thereof, for a wide variety of systems. This generalizes both the results of
Kleene (on regular languages and deterministic finite automata) and Milner (on
regular behaviours and finite labelled transition systems), and includes many
other systems such as Mealy and Moore machines
Superconductivity-Induced Anomalies in the Spin Excitation Spectra of Underdoped YBa_2 Cu_3 O_{6+x}
Polarized and unpolarized neutron scattering has been used to determine the
effect of superconductivity on the magnetic excitation spectra of YBa_2 Cu_3
O_{6.5} (T_c = 52K) and YBa_2 Cu_3 O_{6.7} (T_c = 67K). Pronounced enhancements
of the spectral weight centered around 25 meV and 33 meV, respectively, are
observed below T_c in both crystals, compensated predominantly by a loss of
spectral weight at higher energies. The data provide important clues to the
origin of the 40 meV magnetic resonance peak in YBa_2 Cu_3 O_7.Comment: LaTex, 4 pages, 4 ps figures. to appear in Phys. Rev. Let
High energy spin excitations in YBa_2 Cu_3 O_{6.5}
Inelastic neutron scattering has been used to obtain a comprehensive
description of the absolute dynamical spin susceptibility
of the underdoped superconducting cuprate YBa_2 Cu_3 O_{6.5} ()
over a wide range of energies and temperatures ( and ). Spin excitations of two different
symmetries (even and odd under exchange of two adjacent CuO_2 layers) are
observed which, surprisingly, are characterized by different temperature
dependences. The excitations show dispersive behavior at high energies.Comment: 15 pages, 5 figure
Effect of Nonmagnetic Impurities on the Magnetic Resonance Peak in YBa2Cu3O7
The magnetic excitation spectrum of a YBa_2 Cu_3 O_7 crystal containing 0.5%
of nonmagnetic (Zn) impurities has been determined by inelastic neutron
scattering. Whereas in the pure system a sharp resonance peak at E ~ 40 meV is
observed exclusively below the superconducting transition temperature T_c, the
magnetic response in the Zn-substituted system is broadened significantly and
vanishes at a temperature much higher than T_c. The energy-integrated spectral
weight observed near q = (pi,pi) increases with Zn substitution, and only about
half of the spectral weight is removed at T_c
Friends with benefits: implementing corecursion in foundational proof assistants
We introduce AmiCo, a tool that extends a proof assistant, Isabelle/HOL, with flexible function definitions well beyond primitive corecursion. All definitions are certified by the assistant’s inference kernel to guard against inconsistencies. A central notion is that of friends: functions that preserve the productivity of their arguments and that are allowed in corecursive call contexts. As new friends are registered, corecursion benefits by becoming more expressive. We describe this process and its implementation, from the user’s specification to the synthesis of a higher-order definition to the registration of a friend. We show some substantial case studies where our approach makes a difference
- …