Fractons on Graphs and Complexity

被引：0
|
作者：
Gorantla, Pranay [1 ]
Lam, Ho Tat [2 ]
Shao, Shu-Heng [3 ]
机构：
[1] Physics Department, Princeton University, United States
[2] Center for Theoretical Physics, Massachusetts Institute of Technology, United States
[3] C. N. Yang Institute for Theoretical Physics, Stony Brook University, United States
来源：
arXiv | 2022年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Lattice theory - Mathematical operators - Quantum theory - Trees (mathematics)
引用
收藏
相关论文
共 50 条
  • [31] THE COMPLEXITY OF ULTRAMETRIC PARTITIONS ON GRAPHS
    KRIVANEK, M
    INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 265 - 270
  • [32] On the Complexity of Recognizing Wheeler Graphs
    Daniel Gibney
    Sharma V. Thankachan
    Algorithmica, 2022, 84 : 784 - 814
  • [33] On the Complexity of Colouring Antiprismatic Graphs
    Preissmann, Myriam
    Robin, Cleophee
    Trotignon, Nicolas
    ALGORITHMICA, 2021, 83 (02) : 589 - 612
  • [34] On Cyclomatic Complexity and Decision Graphs
    Gold, Robert
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2012), VOLS A AND B, 2012, 1479 : 2170 - 2173
  • [35] Complexity of conditional colorability of graphs
    Center for Combinatorics, LPMC-TJKLC, Nankai University, Tianjin, 300071, China
    不详
    Appl Math Lett, 2009, 3 (320-324):
  • [36] Hyperbolic Graphs of Small Complexity
    Heard, Damian
    Hodgson, Craig
    Martelli, Bruno
    Petronio, Carlo
    EXPERIMENTAL MATHEMATICS, 2010, 19 (02) : 211 - 236
  • [37] A complexity problem for Borel graphs
    Stevo Todorčević
    Zoltán Vidnyánszky
    Inventiones mathematicae, 2021, 226 : 225 - 249
  • [38] On the complexity of recognizing tenacious graphs
    Golshani, Ali
    Moazzami, Dara
    Amiri, Saeed Akhondian
    ARS COMBINATORIA, 2017, 131 : 11 - 21
  • [39] On the Complexity of the Classification of Synchronizing Graphs
    Canale, Eduardo
    Monzon, Pablo
    Robledo, Franco
    GRID AND DISTRIBUTED COMPUTING, CONTROL AND AUTOMATION, 2010, 121 : 186 - 195
  • [40] THE COMPLEXITY OF COLLAPSING REACHABILITY GRAPHS
    AGGARWAL, S
    BARBARA, D
    CUNTO, W
    GAREY, MR
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 407 : 264 - 274
12345