Related papers: An improved bound in Wirsing's problem

We prove that the flow-cut gap for $n$-node directed graphs is at most $n^{1/3 + o(1)}$. This is the first improvement since a previous upper bound of $\widetilde{O}(n^{11/23})$ by Agarwal, Alon, and Charikar (STOC '07), and it narrows the…

Regarding the limit hbar-->0 as the classical limit of quantum mechanics seems to be silly because hbar is a definite constant of physics, but it was successfully used in the derivation of the WKB approximation. A superseded version of the…

In a previous paper with the same title, we gave an upper bound for the exponent of uniform rational approximation to a quadruple of $\mathbb{Q}$-linearly independent real numbers in geometric progression. Here, we explain why this upper…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

We extend Shi's 2002 quantum lower bound for collision in $r$-to-one functions with $n$ inputs. Shi's bound of $\Omega((n/r)^{1/3})$ is tight, but his proof applies only in the case where the range has size at least $3n/2$. We give a…

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

We prove a lower bound of $\Omega (d^{3/2} \cdot (2/\sqrt{3})^d)$ on the kissing number in dimension $d$. This improves the classical lower bound of Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a similar…

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

We introduce a new quantum decoder based on a variant of the pretty good measurement, but defined via an alternative matrix quotient. We use this decoder to show new lower bounds on the error exponent both in the one-shot and asymptotic…

In this paper we present an explicit counterexample of degree $n=7$, which shows that the conjecture proposed by Li et al. \cite{Li2013} regarding the first derivative bounds for rational B\'ezier curves is generally false. We further…

Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between…

The Burning Number Conjecture claims that for every connected graph $G$ of order $n,$ its burning number satisfies $b(G) \le \lceil \sqrt{n} \rceil.$ While the conjecture remains open, we prove that it is asymptotically true when the order…

In this entry point into the subject, combining two elementary proofs, we decrease the gap between the upper and lower bounds by $0.2\%$ in a classical combinatorial number theory problem. We show that the maximum size of a Sidon set of $\{…

Algorithmic stability is a classical approach to understanding and analysis of the generalization error of learning algorithms. A notable weakness of most stability-based generalization bounds is that they hold only in expectation.…

Let $C=Z(f)$ be a reduced plane curve of degree $6k$, with only nodes and ordinary cusps as singularities. Let $I$ be the ideal of the points where $C$ has a cusp. Let $\oplus S(-b_i)\to \oplus S(-a_i) \to S\to S/I$ be a minimal resolution…

Suppose that $\xi^{(n)}_1,\xi^{(n)}_2,...,\xi^{(n)}_n$ are i.i.d with $P(\xi^{(n)}_i=1)=p_n=1-P(\xi^{(n)}_i=0)$. Let $U^{(n)}$ and $W^{(n)}$ be the longest length of arithmetic progressions and of arithmetic progressions mod $n$ relative to…

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

We study the extremal Forrelation problem, where, provided with oracle access to Boolean functions $f$ and $g$ promised to satisfy either $\textrm{forr}(f,g)=1$ or $\textrm{forr}(f,g)=-1$, one must determine (with high probability) which of…

In recent work Simkin shows that bounds on an exponent occurring in the famous $n$-queens problem can be evaluated by solving convex optimization problems, allowing him to find bounds far tighter than previously known. In this note we use…

Using a method of H. Davenport and W. M. Schmidt, we show that, for each positive integer n, the ratio 2/n is the optimal exponent of simultaneous approximation to real irrational numbers 1) by all conjugates of algebraic numbers of degree…