We consider the 𝒩 = (2, 2) AdS_{3}/CFT_{2}dualities proposed by Eberhardt, where the bulk geometry is AdS_{3}× (
This content will become publicly available on December 1, 2024
Using covariant expansions, recent work showed that pole skipping happens in general holographic theories with bosonic fields at frequencies i(
 Award ID(s):
 2107939
 NSFPAR ID:
 10511741
 Publisher / Repository:
 JHEP
 Date Published:
 Journal Name:
 Journal of High Energy Physics
 Volume:
 2023
 Issue:
 12
 ISSN:
 10298479
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

A<sc>bstract</sc> S ^{3}×T ^{4})/ℤ_{k}, and the CFT is a deformation of the symmetric orbifold of the supersymmetric sigma modelT ^{4}/ℤ_{k}(withk = 2, 3, 4, 6). The elliptic genera of the two sides vanish due to fermionic zero modes, so for microstate counting applications one must consider modified supersymmetric indices. In an analysis similar to that of Maldacena, Moore, and Strominger for the standard 𝒩 = (4, 4) case ofT ^{4}, we study the appropriate helicitytrace index of the boundary CFTs. We encounter a strange phenomenon where a saddlepoint analysis of our indices reproduces only a fraction (respectively ,$$ \frac{1}{2} $$ $\frac{1}{2}$ ,$$ \frac{2}{3} $$ $\frac{2}{3}$ ,$$ \frac{3}{4} $$ $\frac{3}{4}$ ) of the BekensteinHawking entropy of the associated macroscopic black branes.$$ \frac{5}{6} $$ $\frac{5}{6}$ 
Abstract Geometrically frustrated kagome lattices are raising as novel platforms to engineer correlated topological electron flat bands that are prominent to electronic instabilities. Here, we demonstrate a phonon softening at the
k _{z} =π plane in ScV_{6}Sn_{6}. The low energy longitudinal phonon collapses at ~98 K andq = due to the electronphonon interaction, without the emergence of longrange charge order which sets in at a different propagation vector$$\frac{1}{3}\frac{1}{3}\frac{1}{2}$$ $\frac{1}{3}\frac{1}{3}\frac{1}{2}$q _{CDW} = . Theoretical calculations corroborate the experimental finding to indicate that the leading instability is located at$$\frac{1}{3}\frac{1}{3}\frac{1}{3}$$ $\frac{1}{3}\frac{1}{3}\frac{1}{3}$ of a rather flat mode. We relate the phonon renormalization to the orbitalresolved susceptibility of the trigonal Sn atoms and explain the approximately flat phonon dispersion. Our data report the first example of the collapse of a kagome bosonic mode and promote the 166 compounds of kagomes as primary candidates to explore correlated flat phonontopological flat electron physics.$$\frac{1}{3}\frac{1}{3}\frac{1}{2}$$ $\frac{1}{3}\frac{1}{3}\frac{1}{2}$ 
A<sc>bstract</sc> We present a quantum M2 brane computation of the instanton prefactor in the leading nonperturbative contribution to the ABJM 3sphere free energy at large
N and fixed levelk . Using supersymmetric localization, such instanton contribution was found earlier to take the form The exponent comes from the action of an M2 brane instanton wrapped on$$ {F}^{inst}\left(N,k\right)={\left({\sin}^2\frac{2\pi }{k}\right)}^{1}\exp \left(2\pi \sqrt{\frac{2N}{k}}\right)+.\dots $$ ${F}^{\text{inst}}\left(N,k\right)={\left({sin}^{2}\frac{2\pi}{k}\right)}^{1}exp\left(2\pi \sqrt{\frac{2N}{k}}\right)+.\dots $S ^{3}/ℤ_{k}, which represents the Mtheory uplift of the ℂP^{1}instanton in type IIA string theory on AdS_{4}× ℂP^{3}. The IIA string computation of the leading largek term in the instanton prefactor was recently performed in arXiv:2304.12340. Here we find that the exact value of the prefactor is reproduced by the 1loop term in the M2 brane partition function expanded near the$$ {\left({\sin}^2\frac{2\pi }{k}\right)}^{1} $$ ${\left({sin}^{2}\frac{2\pi}{k}\right)}^{1}$S ^{3}/ℤ_{k}instanton configuration. As in the Wilson loop example in arXiv:2303.15207, the quantum M2 brane computation is well defined and produces a finite result in exact agreement with localization. 
A<sc>bstract</sc> Using the analytic Bethe ansatz, we initiate a study of the scaling limit of the quasiperiodic
spin chain. Supported by a detailed symmetry analysis, we determine the effective scaling dimensions of a large class of states in the parameter regime$$ {D}_3^{(2)} $$ ${D}_{3}^{\left(2\right)}$γ ∈ (0, ). Besides two compact degrees of freedom, we identify two independent continuous components in the finitesize spectrum. The influence of large twist angles on the latter reveals also the presence of discrete states. This allows for a conjecture on the central charge of the conformal field theory describing the scaling limit of the lattice model.$$ \frac{\pi }{4} $$ $\frac{\pi}{4}$ 
Abstract We consider the problem of covering multiple submodular constraints. Given a finite ground set
N , a weight function ,$$w: N \rightarrow \mathbb {R}_+$$ $w:N\to {R}_{+}$r monotone submodular functions over$$f_1,f_2,\ldots ,f_r$$ ${f}_{1},{f}_{2},\dots ,{f}_{r}$N and requirements the goal is to find a minimum weight subset$$k_1,k_2,\ldots ,k_r$$ ${k}_{1},{k}_{2},\dots ,{k}_{r}$ such that$$S \subseteq N$$ $S\subseteq N$ for$$f_i(S) \ge k_i$$ ${f}_{i}\left(S\right)\ge {k}_{i}$ . We refer to this problem as$$1 \le i \le r$$ $1\le i\le r$MultiSubmodCover and it was recently considered by HarPeled and Jones (Few cuts meet many point sets. CoRR.arxiv:abs1808.03260 HarPeled and Jones 2018) who were motivated by an application in geometry. Even with$$r=1$$ $r=1$MultiSubmodCover generalizes the wellknown Submodular Set Cover problem (SubmodSC ), and it can also be easily reduced toSubmodSC . A simple greedy algorithm gives an approximation where$$O(\log (kr))$$ $O(log(kr\left)\right)$ and this ratio cannot be improved in the general case. In this paper, motivated by several concrete applications, we consider two ways to improve upon the approximation given by the greedy algorithm. First, we give a bicriteria approximation algorithm for$$k = \sum _i k_i$$ $k={\sum}_{i}{k}_{i}$MultiSubmodCover that covers each constraint to within a factor of while incurring an approximation of$$(11/e\varepsilon )$$ $(11/e\epsilon )$ in the cost. Second, we consider the special case when each$$O(\frac{1}{\epsilon }\log r)$$ $O(\frac{1}{\u03f5}logr)$ is a obtained from a truncated coverage function and obtain an algorithm that generalizes previous work on partial set cover ($$f_i$$ ${f}_{i}$PartialSC ), covering integer programs (CIPs ) and multiple vertex cover constraints Bera et al. (Theoret Comput Sci 555:2–8 Bera et al. 2014). Both these algorithms are based on mathematical programming relaxations that avoid the limitations of the greedy algorithm. We demonstrate the implications of our algorithms and related ideas to several applications ranging from geometric covering problems to clustering with outliers. Our work highlights the utility of the highlevel model and the lens of submodularity in addressing this class of covering problems.