Discrete Spectrum of Interior Length and Timeshift in Two-sided Black Hole

被引：0
|
作者：
Miyaji, Masamichi [1 ]
机构：
[1] Yukawa Institute for Theoretical Physics, Kyoto University, Kyoto,606-8267, Japan
来源：
arXiv |
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
    Murota, Kazuo
    Yokoi, Yu
    MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (02) : 460 - 473
  • [22] Variable-Length Coding of Two-sided Asymptotically Mean Stationary Measures
    Łukasz Dębowski
    Journal of Theoretical Probability, 2010, 23 : 237 - 256
  • [23] EXACT EXPRESSION OF AVERAGE RUN LENGTH FOR TWO-SIDED EXPONENTIAL CUSUM PROCEDURE
    Sukparungsee, Saowanit
    Somran, Sophana
    Areepong, Yupaporn
    ADVANCES AND APPLICATIONS IN STATISTICS, 2016, 48 (06) : 429 - 444
  • [24] Variable-Length Coding of Two-sided Asymptotically Mean Stationary Measures
    Debowski, Lukasz
    JOURNAL OF THEORETICAL PROBABILITY, 2010, 23 (01) : 237 - 256
  • [25] Interior design of a two-dimensional semiclassical black hole
    Levanony, Dana
    Ori, Amos
    PHYSICAL REVIEW D, 2009, 80 (08):
  • [26] Notes on the factorisation of the Hilbert space for two-sided black holes in higher dimensions
    Li, Pan
    JOURNAL OF HIGH ENERGY PHYSICS, 2025, (02):
  • [27] Generalized volume-complexity for two-sided hyperscaling violating black branes
    Farzad Omidi
    Journal of High Energy Physics, 2023
  • [28] Generalized volume-complexity for two-sided hyperscaling violating black branes
    Omidi, Farzad
    JOURNAL OF HIGH ENERGY PHYSICS, 2023, 2023 (01)
  • [29] Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem
    Li, Zixiang
    Dey, Nilanjan
    Ashour, Amira S.
    Tang, Qiuhua
    NEURAL COMPUTING & APPLICATIONS, 2018, 30 (09): : 2685 - 2696
  • [30] Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem
    Zixiang Li
    Nilanjan Dey
    Amira S. Ashour
    Qiuhua Tang
    Neural Computing and Applications, 2018, 30 : 2685 - 2696
12345