Related papers: Improved bounds on the peak sidelobe level of bina…

The binary sum-of-digits function $s$ counts the number of ones in the binary expansion of a nonnegative integer. For any nonnegative integer $t$, T.~W.~Cusick defined the asymptotic density $c_t$ of integers $n\geq 0$ such that…

We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

The distinct elements problem is one of the fundamental problems in streaming algorithms --- given a stream of integers in the range $\{1,\ldots,n\}$, we wish to provide a $(1+\varepsilon)$ approximation to the number of distinct elements…

We show that the smoothed complexity of the FLIP algorithm for local Max-Cut is at most $\smash{\phi n^{O(\sqrt{\log n})}}$, where $n$ is the number of nodes in the graph and $\phi$ is a parameter that measures the magnitude of…

We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap…

We consider the multiple hypothesis testing problem for symmetric quantum state discrimination between r given states \sigma_1,...,\sigma_r. By splitting up the overall test into multiple binary tests in various ways we obtain a number of…

The dimension of a partially-ordered set $P$ is the smallest integer $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$ is bounded…

In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…

We prove that a binary linear code of block length $n$ that is locally correctable with $3$ queries against a fraction $\delta > 0$ of adversarial errors must have dimension at most $O_{\delta}(\log^2 n \cdot \log \log n)$. This is almost…

We combine our version of the resonance method with certain convolution formulas for $\zeta(s)$ and $\log\, \zeta(s)$. This leads to a new $\Omega$ result for $|\zeta(1/2+it)|$: The maximum of $|\zeta(1/2+it)|$ on the interval $1 \le t \le…

Horv\'ath and Kiss [Proc. Amer. Math. Soc., 2005] proved the upper bound estimate $\frac{\lambda _{n}}{\lambda _{m}}\leq \frac{n^{2}}{m^{2}}$ $ (n>m\geq 1) $ for Dirichlet eigenvalue ratios of the Schr\"odinger problem $-y''+q(x)y=\lambda…

We provide new bounds for the rate of convergence of the multivariate Central Limit Theorem in Wasserstein distances of order $p \geq 2$. In particular, we obtain what we conjecture to be the asymptotically optimal rate whenever the density…

We show that the number of all maximal $\alpha$-gapped repeats and palindromes of a word of length $n$ is at most $3(\pi^2/6 + 5/2) \alpha n$ and $7 (\pi^2 / 6 + 1/2) \alpha n - 5 n - 1$, respectively.

The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a…

We study the maximum matching problem in the random-order semi-streaming setting. In this problem, the edges of an arbitrary $n$-vertex graph $G=(V, E)$ arrive in a stream one by one and in a random order. The goal is to have a single pass…

We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…

We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…

Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques…

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…