Indistinguishable Chargeon-Fluxion Pairs in the Quantum Double of Finite Groups

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, arXiv:1006.5479 includes all results of this paper

Scientific paper

We consider the category of finite dimensional representations of the quantum double of a finite group as a modular tensor category. We study auto-equivalences of this category whose induced permutations on the set of simple objects (particles) are of the special form of PJ, where J sends every particle to its charge conjugation and P is a transposition of a chargeon-fluxion pair. We prove that if the underlying group is the semidirect product of the additive and multiplicative groups of a finite field, then such an auto-equivalence exists. In particular, we show that for S_3 (the permutation group over three letters) there is a chargeon and a fluxion which are not distinguishable. Conversely, by considering such permutations as modular invariants, we show that a transposition of a chargeon-fluxion pair forms a modular invariant if and only if the corresponding group is isomorphic to the semidirect product of the additive and multiplicative groups of a finite near-field.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Indistinguishable Chargeon-Fluxion Pairs in the Quantum Double of Finite Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Indistinguishable Chargeon-Fluxion Pairs in the Quantum Double of Finite Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Indistinguishable Chargeon-Fluxion Pairs in the Quantum Double of Finite Groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-289250

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.