Exact diagonalization of SU( N ) Heisenberg and Affleck-Kennedy-Lieb-Tasaki chains using the full SU( N ) symmetry
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Recently, several approaches for communications using chaos have been presented, often showing less than acceptable performance. In this paper, a short introduction to the topic is given, and it is shown that such methods can be efficient—if the informatio ...
Convex polyhedra are important objects in various areas of mathematics and other disciplines. A fundamental result, known as Minkowski-Weyl theorem, states that every polyhedron admits two types of representations, either as the solution set to a finite sy ...
A secret sharing scheme derives from a given secret certain shares (or shadows) which are distributed to users. The secret can be recovered only by certain predetermined groups. In the first secret sharing schemes only the number of the participants in the ...
We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose codi ...
This volume gives a general outline of the various activities which took place during the research semester Group Representation Theory, held in Lausanne, Switzerland, from January to June, 2005. There are contributions by : J.F. Carlson, R. Kessar, M. Lin ...
In this paper, we introduce novel schemes for scalable Distributed Video Coding (DVC), dealing with temporal, spatial and quality scalabilities. More specifically, conventional coding is used to obtain a base layer. DVC is then applied to generate enhancem ...
We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of the trees, show ...
We study spatial learning and navigation for autonomous agents. A state space representation is constructed by unsupervised Hebbian learning during exploration. As a result of learning, a representation of the continuous two-dimensional (2-D) manifold in t ...
Institute of Electrical and Electronics Engineers2004
This paper proposes a novel generic scheme enabling the combination of multiple inclusion representations to propagate numerical constraints. The scheme allows bringing into the constraint propagation framework the strength of inclusion techniques coming f ...
Swiss Federal Institute of Technology in Lausanne (EPFL)2004
Every convex polyhedron in the Euclidean space Rd admits both H- and V-representation. For both formats, a representation is canonical if it is minimal and unique up to some elementary operations. In this paper, we extend the usual definition of canonic ...
