Related papers: New Lower Bounds for Van der Waerden Numbers
Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \sum \pm v_i$. Holzman and Kleitman (1992) proved that at least 3/8 of these sums satisfy $|S| \le 1$. This 3/8 bound…
A code $C \colon \{0,1\}^k \to \{0,1\}^n$ is a $q$-locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \in \{0,1\}^k$ with good confidence by randomly querying the encoding $x := C(b)$ on at most $q$…
Given a random $n \times n$ symmetric matrix $\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\boldsymbol x^\top \boldsymbol…
In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…
We classify all the number fields with signature (4,2), (6,1), (1,4) and (3,3) having discriminant lower than a specific upper bound. This completes the search for minimum discriminants for fields of degree 8 and continues it in the degree…
In this paper, let $\mathcal{S}$ denote the possible interior singular set of suitable weak solutions of the 3D Navier-Stokes equations. We improve the known upper box-counting dimension of this set from $360/277(\approx1.300)$ in [24] to…
We prove that the upper bound for the van der Corput property of the set of shifted primes is O((log n)^{-1+o(1)}), giving an answer to a problem considered by Ruzsa and Montgomery for the set of shifted primes p-1. We construct normed…
$\Theta_6$-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We…
Sorting networks are oblivious sorting algorithms with many practical applications and rich theoretical properties. Propositional encodings of sorting networks are a key tool for proving concrete bounds on the minimum number of comparators…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
If $\alpha_1,\ldots,\alpha_r$ are algebraic numbers such that $$N=\sum_{i=1}^r\alpha_i \ne \sum_{i=1}^r\alpha_i^{-1}$$ for some integer $N$, then a theorem of Beukers and Zagier gives the best possible lower bound on $$\sum_{i=1}^r\log…
We establish several boundary $\varepsilon$-regularity criteria for suitable weak solutions for the 3D incompressible Navier-Stokes equations in a half cylinder with the Dirichlet boundary condition on the flat boundary. Our proofs are…
We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified by an independent third party. We describe a general…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
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…
Let $G$ be a simple $n$-vertex graph and $W\subseteq\V(G)$. We say that $W$ is a $\delta_k$-small set if $$ \sqrt[k]{\frac{\sum_{v\in W}d^k(v)}{\abs W}}\leq n-\abs W. $$ Let $\varphi^{(k)}(G)$ denote the smallest natural number $r$ such…
We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, $(4.8^2)$, and $(3.12^2)$ lattices. The bound is found by Kesten's method of irreducible bridges. This involves…
In this paper we describe how to use the algorithmic methods provided by Hunter and Pohst in order to give a complete classification of number fields of degree 8 and signature (2,3) with absolute discriminant less than a certain bound. The…
A code is called a $q$-query locally decodable code (LDC) if there is a randomized decoding algorithm that, given an index $i$ and a received word $w$ close to an encoding of a message $x$, outputs $x_i$ by querying only at most $q$…
For positive integers $s,t,m$ and $n$, the Zarankiewicz number $z(m,n;s,t)$ is the maximum number of edges in a subgraph of $K_{m,n}$ that has no complete bipartite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices…