相关论文: Capacity threshold for the Ising perceptron

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

Proving the ``expectation-threshold'' conjecture of Kahn and Kalai, we show that for any increasing property $\mathcal{F}$ on a finite set $X$, $$p_c(\mathcal{F})=O(q(\mathcal{F})\log \ell(\mathcal{F})),$$ where $p_c(\mathcal{F})$ and…

The threshold behaviour of negative eigenvalues for Schr\"{o}dinger operators of the type $$ H_\lambda=-\frac{d^2}{dx^2}+U(x)+\lambda\alpha_\lambda V(\alpha_\lambda x) $$ is considered. The potentials $U$ and $V$ are real-valued bounded…

We will show in this paper that if $\lambda$ is very close to 1, then $$I(M,\lambda,m)= \sup_{u\in H^{1,n}_0(M) ,\int_M|\nabla u|^ndV=1}\int_\Omega (e^{\alpha_n |u|^\frac{n}{n-1}}-\lambda\sum\limits_{k=1}^m\frac{|\alpha_nu^\frac{n}{n-1}|^k}…

We consider a standard two-source model for uniform common randomness (UCR) generation, in which Alice and Bob observe independent and identically distributed (i.i.d.) samples of a correlated finite source and where Alice is allowed to send…

We consider the Ising model on a $d$-dimensional discrete torus of volume $r^d$, in dimensions $d>4$ and for large $r$, in the vicinity of the infinite-volume critical point $\beta_c$. We prove that for $\beta=\beta_c- {\rm const}\,…

We prove an upper bound on the log canonical threshold of a hypersurface that satisfies a certain power condition and use it to prove several generalizations of Igusa's conjecture on exponential sums, with the log-canonical threshold in the…

We provide empirical evidence for the Erd\H{o}s-Straus conjecture by improving computational bounds to $10^{18}$ and by evaluating the solution-counting function $f(p)$ for this conjecture.

We study the kinetic Ising model under Glauber dynamics and establish an upper bound on the spectral gap for finite systems. This bound implies the critical exponent inequality $z \geq 2$, thereby rigorously improving the previously known…

One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equal to $\frac43$. For 40 years, the best known upper bound…

We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the…

We derive precise upper bounds for the maximum of the Riemann zeta function on a typical short interval of the critical line. We show that for fixed $\theta\in(-1,0]$, large $T$, and $y\geq 2$ satisfying $y=O(\log\log T/\log\log\log T)$,…

We investigate the relationship between the maximum of the zeta function on the 1-line and the maximal order of $S(t)$, the error term in the number of zeros up to height $t$. We show that the conjectured upper bounds on $S(t)$ along with…

The VC dimension of the Ising perceptron with binary patterns is calculated by numerical enumerations for system sizes N <= 31. It is significantly larger than N/2. The data suggest that there is probably no well defined asymptotic…

We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of the attacker coalition. Lower bounds are obtained by considering…

Let $\lambda_\mathbb{K}(m)$ denote the maximal absolute projection constant over the subspaces of dimension $m$. Apart from the trivial case for $ m=1$, the only known value of $\lambda_\mathbb{K}(m)$ is for $ m=2$ and…

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…

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

In recent work, Fyodorov and Keating conjectured the maximum size of $|\zeta(1/2+it)|$ in a typical interval of length O(1) on the critical line. They did this by modelling the zeta function by the characteristic polynomial of a random…

The capacity of a graph is defined as the rate of exponential grow of independent sets in the strong powers of the graph. In strong power, an edge connects two sequences if at each position letters are equal or adjacent. We consider a…