2022
DOI: 10.1007/jhep05(2022)096
|View full text |Cite
|
Sign up to set email alerts
|

Confinement/deconfinement transition in the D0-brane matrix model — A signature of M-theory?

Abstract: We study the confinement/deconfinement transition in the D0-brane matrix model (often called the BFSS matrix model) and its one-parameter deformation (the BMN matrix model) numerically by lattice Monte Carlo simulations. Our results confirm general expectations from the dual string/M-theory picture for strong coupling. In particular, we observe the confined phase in the BFSS matrix model, which is a nontrivial consequence of the M-theory picture. We suggest that these models provide us with an ideal framework … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
41
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 13 publications
(42 citation statements)
references
References 74 publications
1
41
0
Order By: Relevance
“…where M is the truncation parameter. To reduce the computational cost of exact diagonalization, we further use the discrete parity symmetry of the Hamiltonians ( 4) and ( 6) to represent the matrices (10) and (12) in block diagonal form. We then perform numerical diagonalization of the matrices (10) and (12).…”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…where M is the truncation parameter. To reduce the computational cost of exact diagonalization, we further use the discrete parity symmetry of the Hamiltonians ( 4) and ( 6) to represent the matrices (10) and (12) in block diagonal form. We then perform numerical diagonalization of the matrices (10) and (12).…”
Section: Methodsmentioning
confidence: 99%
“…To reduce the computational cost of exact diagonalization, we further use the discrete parity symmetry of the Hamiltonians ( 4) and ( 6) to represent the matrices (10) and (12) in block diagonal form. We then perform numerical diagonalization of the matrices (10) and (12). For not very large M 100 we use the QR algorithm as implemented in the LAPACK routine dsyev, finding all eigenvectors and eigenvalues of the matrices (10) and (12).…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations