English
Related papers

Related papers: Precise lower bound on Monster brane boundary entr…

200 papers

We study N=1 superconformal theories in four dimensions obtained wrapping M5 branes on a Riemann surface. We propose a method to determine from the spectral curve the scaling dimension of chiral operators in the SCFT. Whenever the…

High Energy Physics - Theory · Physics 2015-06-22 Simone Giacomelli

We consider the two-point functions of conserved bulk currents and energy-momentum tensor in a boundary CFT defined on $\mathbb{R}_-^{1,2}$. Starting from the consistent forms of boundary gauge and gravitational anomalies we derive their…

High Energy Physics - Theory · Physics 2019-07-11 Vladimir Prochazka

In this paper we consider the minimization of a continuous function that is potentially not differentiable or not twice differentiable on the boundary of the feasible region. By exploiting an interior point technique, we present first- and…

Computational Complexity · Computer Science 2017-02-15 Gabriel Haeser , Hongcheng Liu , Yinyu Ye

We continue the study of model-independent constraints on the unitary Conformal Field Theories in 4-Dimensions, initiated in arXiv:0807.0004. Our main result is an improved upper bound on the dimension \Delta of the leading scalar operator…

High Energy Physics - Theory · Physics 2015-03-13 Vyacheslav S. Rychkov , Alessandro Vichi

This letter addresses the constraint compatibility problem of control barrier functions (CBFs), which occurs when a safety-critical CBF requires a system to apply more control effort than it is capable of generating. This inevitably leads…

Optimization and Control · Mathematics 2024-02-28 Logan E. Beaver

The threshold degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign: $\mathrm{sgn}\; p(x)=(-1)^{f(x)}.$ A related notion is sign-rank, defined for a Boolean…

Computational Complexity · Computer Science 2019-01-07 Alexander A. Sherstov , Pei Wu

First order methods endowed with global convergence guarantees operate using global lower bounds on the objective. The tightening of the bounds has been shown to increase both the theoretical guarantees and the practical performance. In…

Optimization and Control · Mathematics 2024-04-30 Mihai I. Florea , Yurii Nesterov

We propose two families of asymptotically local minimax lower bounds on parameter estimation performance. The first family of bounds applies to any convex, symmetric loss function that depends solely on the difference between the estimate…

Statistics Theory · Mathematics 2024-09-20 Neri Merhav

This paper introduces an upper bound on the absolute difference between: (a) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third…

Information Theory · Computer Science 2020-07-22 Dadja Anade , Jean-Marie Gorce , Philippe Mary , Samir Perlaza

We present an effective field theory (EFT) approach to extract fundamental cosmological parameters from the Lyman-alpha forest flux fluctuations as an alternative to the standard simulation-based techniques. As a first application, we…

Cosmology and Nongalactic Astrophysics · Physics 2025-02-21 Mikhail M. Ivanov , Michael W. Toomey , Naim Göksel Karaçaylı

In this paper, we propose a new gravity dual for a $2$d BCFT with two conformal boundaries by introducing a defect that connects the two End-of-the-World branes. We demonstrate that the BCFT dual to this bulk model exhibits a richer lowest…

High Energy Physics - Theory · Physics 2022-12-01 Masamichi Miyaji , Chitraang Murdia

We propose a novel procedure of assigning a pair of non-unitary topological quantum field theories (TQFTs), TFT$_\pm [\mathcal{T}_{\rm rank \;0}]$, to a (2+1)D interacting $\mathcal{N}=4$ superconformal field theory (SCFT) $\mathcal{T}_{\rm…

High Energy Physics - Theory · Physics 2023-02-22 Dongmin Gang , Sungjoon Kim , Kimyeong Lee , Myungbo Shim , Masahito Yamazaki

In this paper, we consider different aspects of the network functional compression problem where computation of a function (or, some functions) of sources located at certain nodes in a network is desired at receiver(s). The rate region of…

Information Theory · Computer Science 2010-12-01 Soheil Feizi , Muriel Medard

For an arbitrary family of predicates $\mathcal{F} \subseteq \{0,1\}^{[q]^k}$ and any $\epsilon > 0$, we prove a single-pass, linear-space streaming lower bound against the gap promise problem of distinguishing instances of…

Computational Complexity · Computer Science 2026-04-13 Noah G. Singer , Madhur Tulsiani , Santhoshini Velusamy

This is the first in a series of articles about recovering the full algebraic structure of a boundary conformal field theory (CFT) from the scaling limit of the critical Ising model in slit-strip geometry. Here, we introduce spaces of…

Mathematical Physics · Physics 2021-11-22 Taha Ameen , Kalle Kytölä , S. C. Park , David Radnell

Asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity of a class of dynamic programming algorithms including matrix chain multiplication, optimal polygon triangulation, and the construction of optimal binary…

Data Structures and Algorithms · Computer Science 2024-10-29 Lorenzo De Stefani , Vedant Gupta

In this article, we study approximation properties of the variation spaces corresponding to shallow neural networks with a variety of activation functions. We introduce two main tools for estimating the metric entropy, approximation rates,…

Machine Learning · Statistics 2024-02-26 Jonathan W. Siegel , Jinchao Xu

Boundary conditions for massive fermions are investigated in AdS_d for $d \ge 2$. For fermion masses in the range $0 \le |m| < 1/2\ell$ with $\ell$ the AdS length, the standard notion of normalizeability allows a choice of boundary…

High Energy Physics - Theory · Physics 2009-01-08 Aaron J. Amsel , Donald Marolf

We revisit the problem of computing submatrices of the Cram\'er-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter $\vth$. We explore iterative methods that avoid direct inversion of the Fisher…

Information Theory · Computer Science 2015-06-04 Paul Tune

The remaining min-entropy of a secret generated by fuzzy extraction from a Physical Unclonable Function is typically estimated under the assumption of independent and identically distributed PUF responses, but this assumption does not hold…

Signal Processing · Electrical Eng. & Systems 2020-01-23 Florian Wilde , Christoph Frisch , Michael Pehl