Related papers: A note on the capacity of the binary perceptron
The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially…
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…
In the standard model of particle physics, the weak interaction is described by vector and axial-vector couplings only. Non-zero scalar or tensor interactions would imply an additional contribution to the differential decay rate of the…
In this paper we give a upper bound of 40 on Rubik's cube group. The previously known upper bound has been 42 since 1995. In order to prove our claim we use computational methods. The program used is GAP computer algebra. Further more we…
A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…
Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…
We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…
This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…
Recently announced results from the KATRIN collaboration imply an upper bound on the effective electron anti-neutrino mass $m_{\nu_{e}}$, $m_{\nu_{e}}< 0.8~{\rm eV}/c^{2}$. Here we explore the implications of combining the KATRIN upper…
Independent tests aiming to constrain the value of the cosmological constant $\Lambda$ are usually difficult because of its extreme smallness $\left(\Lambda \simeq 1\times 10^{-52}~\textrm{m}^{-2},~\textrm{or}~2.89\times…
The development of computational resources has made it possible to determine upper bounds for atomic and molecular energies with high precision. Yet, error bounds to the computed energies have been available only as estimates. In this…
A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…
We study two-to-two scattering amplitudes of a scalar particle of mass $m$. For simplicity, we assume the presence of $\mathbb{Z}_2$ symmetry and that the particle is $\mathbb{Z}_2$ odd. We consider two classes of amplitudes: the fully…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. For any $\lambda>0$ we consider the percolation…
Through a direct analysis of the scattering amplitude, we show that the preliminary measurement of the analysing power AN obtained by the E950 Collaboration at different energies are mainly sensitive to the spin-flip part of the amplitude…
Cooperative cognitive radio networks are investigated by using an information-theoretic approach. This approach consists of interpreting the decision process carried out at the fusion center as a binary (asymmetric) channel, whose input is…
It was conjectured by M\textsuperscript{c}Kernan and Shokurov that for any Fano contraction $f:X \to Z$ of relative dimension $r$ with $X$ being $\epsilon$-lc, there is a positive $\delta$ depending only on $r,\epsilon$ such that $Z$ is…
An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known. When specialized to the case of no common information, this…
We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…
The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming…