Related papers: New Lower Bounds for Van der Waerden Numbers
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
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 [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound…
Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derived.…
We use the configuration space Faddeev formalism to calculate bound and continuum states of the Ne$_{3}$ van der Waals trimer. Continuum states below the breakup threshold describe the scattering of a neon atom off of a Ne$_{2}$ diatomic…
In a recent paper new upper and lower limits were given, in the context of the Schr\"{o}dinger or Klein-Gordon equations, for the number $N_{0}$ of S-wave bound states possessed by a monotonically nondecreasing central potential vanishing…
We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high…
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between…
We provide lower and upper bounds on the minimum size of a maximum stable set over graphs of flag spheres, as a function of the dimension of the sphere and the number of vertices. Further, we use stable sets to obtain an improved Lower…
In this paper, by making use of this fact that for $a_{j}, b_{j}\in \mathbb{R}$, $j=1,2,\ldots,n$, there are $\lambda_{j}\in [0,1]$ with $\sum_{j=1}^{n}\lambda_{j}=1$ such that \[ \min_{1\leq j\leq n}\{a_{j}\}-\min_{1\leq j\leq…
The problem of wireless localization asks to place and orient stations in the plane, each of which broadcasts a unique key within a fixed angular range, so that each point in the plane can determine whether it is inside or outside a given…
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…
We give a lower bound on Walsh figure of merit (WAFOM), which is a parameter to estimate the integration error for quasi-Monte Carlo (QMC) integration by a point set called a digital net. This lower bound is optimal because the existence of…
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…
A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…
In the literature, several different identification problems in graphs have been studied, the most widely studied such problems are the ones based on dominating sets as a tool of identification. Hereby, the objective is to separate any two…
We prove semiclassical resolvent estimates for the Schr{\"o}dinger operator in R d , d $\ge$ 3, with real-valued radial potentials V $\in$ L $\infty$ (R d). We show that if V (x) = O x --$\delta$ with $\delta$ > 4, then the resolvent bound…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
We introduce the van der Waerden complex ${\rm vdW}(n,k)$ defined as the simplicial complex whose facets correspond to arithmetic progressions of length $k$ in the vertex set $\{1, 2, \ldots, n\}$. We show the van der Waerden complex ${\rm…