Results 1  10
of
373
On Rényi entropies of disjoint intervals in conformal field theory
"... Abstract. We study the Rényi entropies of N disjoint intervals in the conformal field theories given by the free compactified boson and the Ising model. They are computed as the 2N point function of twist fields, by employing the partition function of the model on a particular class of Riemann surf ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We study the Rényi entropies of N disjoint intervals in the conformal field theories given by the free compactified boson and the Ising model. They are computed as the 2N point function of twist fields, by employing the partition function of the model on a particular class of Riemann
Entanglement entropy of two disjoint intervals in critical c=1 theories
, 2011
"... We study the scaling of the Rényi entanglement entropy of two disjoint blocks of critical lattice models described by conformal field theories with central charge c = 1. We provide the analytic conformal field theory result for the second order Rényi entropy for a free boson compactified on an orb ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We study the scaling of the Rényi entanglement entropy of two disjoint blocks of critical lattice models described by conformal field theories with central charge c = 1. We provide the analytic conformal field theory result for the second order Rényi entropy for a free boson compactified
Geometric Modular Action for Disjoint Intervals and Boundary Conformal Field Theory
, 2009
"... ..."
DisjointInterval Topological Sort: A Useful Concept in Serializability Theory
"... The theory of serializability for concurrency control of databases has been extensively studied I: ESWA76, STEA76, BERN79, PAPA79, SETH8 11. In this paper, we introduce a unifying concept in ..."
Abstract
 Add to MetaCart
The theory of serializability for concurrency control of databases has been extensively studied I: ESWA76, STEA76, BERN79, PAPA79, SETH8 11. In this paper, we introduce a unifying concept in
Hierarchical Arc Consistency for Disjoint Real Intervals in Constraint Logic Programming
 COMPUTATIONAL INTELLIGENCE
, 1992
"... There have been many proposals for adding sound implementations of numeric processing to Prolog. This paper describes an approach to numeric constraint processing which has been implemented in Echidna, a new constraint logic programming (CLP) language. Echidna uses consistency algorithms which can a ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
hierarchical arc consistency algorithm specialized for numeric constraints. This gives Echidna two advantages over other systems. First, the union of disjoint intervals can be represented directly. Other approaches require trying each disjoint interval in turn during backtrack search. Second, the hierarchical
Entanglement entropy for disjoint subsystems
"... Abstract. FisherHartwig formula has been successful applied to describe the von Neumann and Rényi entropies of a block of spins in the ground state of XX spin chain. It was based on a determinant representation. In this paper, we generalize the free fermion method to obtain an exact formulation fo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
for the entropy of any finite subsystem in XX spin chain. Based on this, we derive a determinant representation of the entropy of multiple disjoint intervals in the ground state of XX model.
Entanglement entropy of two disjoint blocks in XY chains
, 2010
"... We study the Rènyi entanglement entropies of two disjoint intervals in XY chains. We exploit the exact solution of the model in terms of free Majorana fermions and we show how to construct the reduced density matrix in the spin variables by taking properly into account the JordanWigner string betw ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
We study the Rènyi entanglement entropies of two disjoint intervals in XY chains. We exploit the exact solution of the model in terms of free Majorana fermions and we show how to construct the reduced density matrix in the spin variables by taking properly into account the JordanWigner string
CrossDisjoint Pairs Of Clouds In The Interval Lattice
 ALGORITHMS AND COMBINATORICS B
, 1996
"... Let I n be the lattice of intervals in the Boolean lattice L n . For A; B ae I n the pair of clouds (A; B) is crossdisjoint, if I " J = OE for I 2 A , J 2 B . We prove that for such pairs jAjjBj 3 2n\Gamma2 and that this bound is best possible. Optimal pairs are up to obvious isomorphisms u ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Let I n be the lattice of intervals in the Boolean lattice L n . For A; B ae I n the pair of clouds (A; B) is crossdisjoint, if I " J = OE for I 2 A , J 2 B . We prove that for such pairs jAjjBj 3 2n\Gamma2 and that this bound is best possible. Optimal pairs are up to obvious isomorphisms
ON CYCLES FOR THE DOUBLING MAP WHICH ARE DISJOINT FROM AN INTERVAL
"... Abstract. Let T: [0,1] → [0,1] be the doubling map and let 0 < a < b < 1. We say that an integer n ≥ 3 is bad for (a,b) if all ncycles for T intersect (a,b). Let B(a,b) denote the set of all n which are bad for (a,b). In this paper we completely describe the sets: D2 = {(a,b) : B(a,b)is f ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Let T: [0,1] → [0,1] be the doubling map and let 0 < a < b < 1. We say that an integer n ≥ 3 is bad for (a,b) if all ncycles for T intersect (a,b). Let B(a,b) denote the set of all n which are bad for (a,b). In this paper we completely describe the sets: D2 = {(a,b) : B(a,b)is finite} and D3 = {(a,b) : B(a,b) = ∅}. In particular, we show that if b − a < 1 (a,b) ∈ D3, both constants being sharp. 6, then (a,b) ∈ D2, and if b − a ≤ 2 15, then
Results 1  10
of
373