Related papers: A note on the capacity of the binary perceptron
For the class of the memoryless binary-input channels which are not necessarily symmetric, we derive tight bounds on the capacity in terms of the Bhattacharyya parameter. As it turns out, the bounds derived under the symmetric channel…
In 1975 Pippenger and Golumbic proved that any graph on $n$ vertices admits at most $2e(n/k)^k$ induced $k$-cycles. This bound is larger by a multiplicative factor of $2e$ than the simple lower bound obtained by a blow-up construction.…
We refine the definition of universal ratio c/\tilde{c} obtained via AdS/CFT correspondence as shown in arXiv:0801.2785 [hep-th], denoted as \gamma_c, and apply it to non-CFTs whose dual gravitational theory have metric of asymptotic AdS.…
The purpose of this note is to report predictions of the binding energy of the $\Lambda$ hyperon in nuclear matter using the latest version of the Juelich nucleon-nucleon meson-exchange potential. Results from a conventional Brueckner…
Essential covers were introduced by Linial and Radhakrishnan as a model that captures two complementary properties: (1) all variables must be included and (2) no element is redundant. In their seminal paper, they proved that every essential…
Explanations of the replication crisis often emphasize misconduct, questionable research practices, or incentive misalignment, implying that behavioral reform is sufficient. This paper argues that a substantial component is architectural:…
We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing the notion of independence entropy, originally studied in the…
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. It also introduces symmetry properties…
The possible bound state of the $ _{c\bar{c}}^{9}$Be, a charmonium-nucleus system, is investigated. The analysis is carried out within a three-cluster model, where its binary subsystems are represented as $ c\bar{c}\textrm{+}\alpha $ and…
Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…
In this article we prove that if the additive energy of a strictly increasing sequence $(a_n)$ of natural numbers is less than $N^3/(\log N)^C$ for some $C\geq13.155$, then $(\{a_n\alpha\})$ has Poissonian pair correlation for almost all…
It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…
We formulate the conformal packing problem and dual packing problem in analogy to similar problems for binary codes and lattices. We obtain explicit numerical upper bounds for the minimal dual conformal weight of a unitary strongly-rational…
The celebrated conjecture by Payne, P\'{o}lya and Weinberger (1956) states that for the fixed membrane problem, the ratio of the first two eigenvalues, $\lambda_2/\lambda_1$, is maximized by a disk. A more general dimensional version of…
It is well known that a spherically symmetric compact star whose energy density decreases monotonically possesses an upper bound on its mass-to-radius ratio, $2M/R\leq 8/9$. However, field configurations typically will not be compact. Here…
We study theoretically the responsivity of optical modulators. For the case of linear response we find using perturbation theory an upper bound imposed upon the responsivity. For the case of two mode modulator we find a lower bound imposed…
In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels stating that when transmission rate $R$ is above channel capacity $C$, the error probability of decoding goes to one as the block length $n$ of code…
We study the Fr\"ohlich polaron in the regime of strong coupling and prove the asymptotically sharp lower bound on the effective mass $m_{\mathrm{eff}}(\alpha)\geq \alpha^4 m_{\mathrm{LP}}-C\alpha^{4-\epsilon}$, where $m_{\mathrm{LP}}$ is…
This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…
For any $m \geq 1$, let $H_m$ denote the quantity $H_m := \liminf_{n \to \infty} (p_{n+m}-p_n)$, where $p_n$ denotes the $n^{\operatorname{th}}$ prime; thus for instance the twin prime conjecture is equivalent to the assertion that $H_1$ is…