English
Related papers

Related papers: A note on the capacity of the binary perceptron

200 papers

Possible $\Lambda_c\Lambda_c$ hadronic molecule is investigated in the one-pion-exchange potential model. In the study with this model, the heavier meson exchange effects are encoded into a phenomenological cutoff parameter and couplings to…

High Energy Physics - Phenomenology · Physics 2012-01-17 Wakafumi Meguro , Yan-Rui Liu , Makoto Oka

The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity}, per information bit, of encoding and decoding. It also…

Information Theory · Computer Science 2009-09-29 Henry D. Pfister , Igal Sason

This article summarises a talk given at the 2014 Palermo workshop on Astrophysics. It covers a short review on the neutrino physics status and the potential physics opportunities of future experiments. During the last year our knowledge on…

High Energy Physics - Experiment · Physics 2015-03-20 Thomas Strauss

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

Information Theory · Computer Science 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…

Information Theory · Computer Science 2015-04-06 Tobias Sutter , David Sutter , Peyman Mohajerin Esfahani , John Lygeros

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to…

Information Theory · Computer Science 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…

Data Structures and Algorithms · Computer Science 2016-08-22 Alexandr Andoni , Thijs Laarhoven , Ilya Razenshteyn , Erik Waingarten

We give predictions for the neutrinoless double beta decay rate in a simple variant of the A_4 family symmetry model. We show that there is a lower bound for the neutrinoless double beta decay amplitude even in the case of normal…

High Energy Physics - Phenomenology · Physics 2014-11-18 M. Hirsch , Ernest Ma , J. W. F. Valle , A. Villanova del Moral

We study the decision version of tensor spectral norm from the viewpoint of real algebraic complexity. For a rationally specified tensor, the tensor spectral threshold problem asks whether its spectral norm exceeds a prescribed rational…

Computational Complexity · Computer Science 2026-05-05 Angshul Majumdar

We define the entropic bounds, i.e minimal uncertainty for pairs of unitary testers in distinguishing between unitary transformations not unlike the well known entropic bounds for observables. We show that in the case of specific sets of…

Quantum Physics · Physics 2021-03-16 Jesni Shamsul Shaari , Stefano Mancini

Let $p$ be a prime. For $d\in \mathbb{N}$, let $\mathbb{Q}_p^d$ be the standard $d$-dimensional p-adic Hilbert space. Let $m \in \mathbb{N}$ and $\text{Sym}^m(\mathbb{Q}_p^d)$ be the p-adic Hilbert space of symmetric m-tensors. We prove the…

Number Theory · Mathematics 2024-08-07 K. Mahesh Krishna

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev

For every irrational real $\alpha$, let $M(\alpha) = \sup_{n\geq 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or $\infty$, if unbounded). The $2$-adic Littlewood conjecture (2LC) can be stated as…

Number Theory · Mathematics 2025-08-13 Dinis Vitorino , Ingrid Vukusic

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…

Information Theory · Computer Science 2021-03-29 Anelia Somekh-Baruch

It was shown in a previous work that, for systems in which the entropy is an extensive function of the energy and volume, the Bekenstein and the holographic entropy bounds predict new results. In this paper, we go further and derive…

General Relativity and Quantum Cosmology · Physics 2009-11-10 Gilad Gour

Determinations of alpha_s are reviewed. Current results are limited to a precision of around 3-20%, largely by theoretical uncertainties. All measurements are consistent with a `world average' value of 0.118 +- 0.005 and there is no…

High Energy Physics - Experiment · Physics 2011-07-19 P. N. Burrows

We summarize several decades of work in finding values for the percolation threshold p_c for site percolation on the square lattice, the universal correction-to-scaling exponent Omega, and the susceptibility amplitude ratio C^+/C^-, in two…

Disordered Systems and Neural Networks · Physics 2015-03-19 Robert M. Ziff

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Probability · Mathematics 2010-04-13 Vladimir Nikulin

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

Combinatorics · Mathematics 2015-05-29 Georgios Vlachos

For positive integers $n$, $m$, and $h$, we let $\rho \hat{\;}(\mathbb{Z}_n, m, h)$ denote the minimum size of the $h$-fold restricted sumset among all $m$-subsets of the cyclic group of order $n$. The value of $\rho \hat{\;}(\mathbb{Z}_n,…

Number Theory · Mathematics 2013-05-15 Béla Bajnok