Statistics of linked strings

DOI10.1142/S0217732392003220MaRDI QIDQ2727281zbMATH OpenFDO

Authors Charilaos N. Aneziris

Publication date 31 July 2001

Published in Modern Physics Letters A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/hep-th/9409055

Mathematics Subject Classification ID

Representations of groups as automorphism groups of algebraic systems (20F29) Commutation relations and statistics as related to quantum mechanics (general) (81S05) String and superstring theories; other extended objects (e.g., branes) in quantum field theory (81T30)

Abstract: We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on placing knots on a cubic lattice.

Cited in

(3)

• Spinning particles, braid groups and solitons
• Bulk-boundary correspondence between charged, anyonic strings and vortices
• EXOTIC STATISTICS FOR ORDINARY PARTICLES IN QUANTUM GRAVITY

This page was built for publication: Statistics of linked strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2727281)