Discrete Morse functions for graph configuration spaces

DOI10.1088/1751-8113/45/50/505202MaRDI QIDQ4900368zbMATH OpenOpenAlexFDO

Authors

Publication date 24 January 2013

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.1986

Mathematics Subject Classification ID

Discrete version of topics in analysis (39A12) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)

Abstract: We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions, which have a nice physical interpretation as two-body potentials constructed from one-body potentials. We also give a brief introduction to discrete Morse theory. Our motivation comes from the problem of quantum statistics for particles on networks, for which generalized versions of anyon statistics can appear.

Recommendations

• Discrete Morse theory on graphs
• Discrete Morse theory on digraphs
• (Discrete) Morse theory on configuration spaces
• On discrete Morse functions and combinatorial decompositions
• The number of excellent discrete Morse functions on graphs
• Complexes of discrete Morse functions
• Graph isomorphisms in discrete Morse theory
• Discrete Morse theory for complexes of 2-connected graphs
• Homologically equivalent discrete Morse functions
• Discrete Morse Theory

Cited in

(10)

• Optimal discrete Morse functions for 2-manifolds
• On Painlevé analysis, symmetry group and conservation laws of Date-Jimbo-Kashiwara-Miwa equation
• Non-abelian quantum statistics on graphs
• Discrete Morse theory on digraphs
• \(n\)-particle quantum statistics on graphs
• Polyhedral representation of discrete Morse functions
• Abrams's stable equivalence for graph braid groups
• Homology groups for particles on one-connected graphs
• On merge trees and discrete Morse functions on paths and trees
• The number of excellent discrete Morse functions on graphs

This page was built for publication: Discrete Morse functions for graph configuration spaces

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