English
Related papers

Related papers: Accurate lower bounds on two-dimensional constrain…

200 papers

Tensor hypercontraction is a method that allows the representation of a high-rank tensor as a product of lower-rank tensors. In this paper, we show how tensor hypercontraction can be applied to both the electron repulsion integral (ERI)…

The relativistic two-body potentials of constraint theory for systems composed of two spin-0 or two spin-1/2 particles are calculated, in perturbation theory, by means of the Lippmann-Schwinger type equation that relates them to the…

High Energy Physics - Phenomenology · Physics 2009-10-28 H. Jallouli , H. Sazdjian

Modeling charge transfer well can require treating post-excitation orbital relaxations and handling medium to large molecules in realistic environments. By combining a state-specific correlation treatment with such orbital relaxations,…

Chemical Physics · Physics 2025-07-28 Harrison Tuckman , Eric Neuscamman

The extended Davis-Kahan theorem makes use of polynomial matrix transformations to produce bounds at least as tight as the standard Davis-Kahan theorem. The optimization problem of finding transformation parameters resulting in optimal…

Statistics Theory · Mathematics 2019-08-12 J. F. Lutzeyer , A. T. Walden

We consider the double-scaling limit in matrix models for two-dimensional quantum gravity, and establish the nonperturbative functional Renormalization Group as a novel technique to compute the corresponding interacting fixed point of the…

General Relativity and Quantum Cosmology · Physics 2013-10-30 Astrid Eichhorn , Tim Koslowski

Models based on approximation capabilities have recently been studied in the context of Optimal Recovery. These models, however, are not compatible with overparametrization, since model- and data-consistent functions could then be…

Optimization and Control · Mathematics 2020-04-02 Simon Foucart

The performance of integer-forcing equalization for communication over the compound multiple-input multipleoutput channel is investigated. An upper bound on the resulting outage probability as a function of the gap to capacity has been…

Information Theory · Computer Science 2017-12-05 Elad Domanovitz , Uri Erez

Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated…

Optimization and Control · Mathematics 2024-03-26 Maksim Velikanov , Dmitry Yarotsky

In this letter, we provide a simple algorithm, anyPUB, to systematically derive the $2 \rightarrow 2$ scattering matrix in the high-energy limit for any kind of models, irrespective of their gauge group or their field representation. After…

High Energy Physics - Phenomenology · Physics 2026-03-12 Nico Benincasa

We obtain analytical lower bounds on the concurrence of bipartite quantum systems in arbitrary dimensions related to the violation of separability conditions based on local uncertainty relations and on the Bloch representation of density…

Quantum Physics · Physics 2009-11-13 Julio I. de Vicente

We consider constraints on the S-matrix of any gapped, Lorentz invariant quantum field theory in 1 + 1 dimensions due to crossing symmetry and unitarity. In this way we establish rigorous bounds on the cubic couplings of a given theory with…

High Energy Physics - Theory · Physics 2018-01-17 Miguel F. Paulos , Joao Penedones , Jonathan Toledo , Balt C. van Rees , Pedro Vieira

We use recently developed strong-coupling expansion methods to study the two-particle spectra for the frustrated alternating Heisenberg model, consisting of an alternating nearest neighbor antiferromagnetic exchange and a uniform second…

Strongly Correlated Electrons · Physics 2008-03-26 Weihong Zheng , C. J. Hamer , R. R. P. Singh , Simon Trebst , Hartmut Monien

Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we…

Information Theory · Computer Science 2010-05-10 Won-Yong Shin , Daniel E. Lucani , Muriel Medard , Milica Stojanovic , Vahid Tarokh

We establish quantum dynamical lower bounds for a number of discrete one-dimensional Schr\"odinger operators. These dynamical bounds are derived from power-law upper bounds on the norms of transfer matrices. We develop further the approach…

Mathematical Physics · Physics 2014-12-31 David Damanik , Andras Suto , Serguei Tcheremchantsev

A fundamental aspect of limitations in learning any computation in neural architectures is characterizing their optimal capacities. An important, widely-used neural architecture is known as autoencoders where the network reconstructs the…

Neurons and Cognition · Quantitative Biology 2017-05-23 Alireza Alemi , Alia Abbara

We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…

Computational Complexity · Computer Science 2016-11-02 Arkadev Chattopadhyay , Michael Langberg , Shi Li , Atri Rudra

We consider the problem of deep neural net compression by quantization: given a large, reference net, we want to quantize its real-valued weights using a codebook with $K$ entries so that the training loss of the quantized net is minimal.…

Machine Learning · Computer Science 2017-07-17 Miguel Á. Carreira-Perpiñán , Yerlan Idelbayev

We obtain long series expansions for the bulk, surface and corner free energies for several two-dimensional statistical models, by combining Enting's finite lattice method (FLM) with exact transfer matrix enumerations. The models encompass…

Mathematical Physics · Physics 2014-04-23 Eric Vernier , Jesper Lykke Jacobsen

The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

We consider the communication capacity of wireline networks for a two-unicast traffic pattern. The network has two sources and two destinations with each source communicating a message to its own destination, subject to the capacity…

Information Theory · Computer Science 2015-06-04 Sudeep Kamath , Venkat Anantharam , David Tse , Chih-Chun Wang
‹ Prev 1 3 4 5 6 7 10 Next ›