Related papers: Improved Bounds for $(b,k)$-hashing

When $s\ge k\ge 3$ and $n_1,\ldots ,n_k$ are large natural numbers, denote by $A_{s,k}(\mathbf n)$ the number of solutions in non-negative integers $\mathbf x$ to the system \[ x_1^j+\ldots +x_s^j=n_j\quad (1\le j\le k). \] Under…

In quantum purity amplification, one is given $n$ copies of a noisy quantum state $\rho \in \mathbb{C}^{d \times d}$ and asked to prepare $k$ copies of its principal eigenstate $|v_d\rangle$. Several prior works have derived…

We provide (for both the real and complex settings) a family of constants, $% (C_{m})_{m\in \mathbb{N}}$, enjoying the Bohnenblust--Hille inequality and such that $\displaystyle\lim_{m\rightarrow \infty}\frac{C_{m}}{C_{m-1}}=1$, i.e., their…

The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)$, the minimum order of such a graph, and to identify…

Many clustering algorithms are guided by certain cost functions such as the widely-used $k$-means cost. These algorithms divide data points into clusters with often complicated boundaries, creating difficulties in explaining the clustering…

In a recent breakthrough Campos, Griffiths, Morris and Sahasrabudhe obtained the first exponential improvement of the upper bound on the diagonal Ramsey numbers since 1935. We shorten their proof, replacing the underlying book algorithm…

The cage problem asks for the smallest number $c(k,g)$ of vertices in a $k$-regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to exist for all integers $k \ge 2$ and $g \ge 3$, the exact…

We propose a new asymptotic expansion for the fractional $p$-Laplacian with precise computations of the errors. Our approximation is shown to hold in the whole range $p\in(1,\infty)$ and $s\in(0,1)$, with errors that do not degenerate as…

We study boundary non-crossing probabilities $$ P_{f,u} := \mathrm P\big(\forall t\in \mathbb T\ X_t + f(t)\le u(t)\big) $$ for continuous centered Gaussian process $X$ indexed by some arbitrary compact separable metric space $\mathbb T$.…

We study asymptotic behaviors of positive solutions to the Yamabe equation and the $\sigma$k-Yamabe equation near isolated singular points and establish expansions up to arbitrary orders. Such results generalize an earlier pioneering work…

We propose a theoretical framework to capture incremental solutions to cardinality constrained maximization problems. The defining characteristic of our framework is that the cardinality/support of the solution is bounded by a value…

We prove two results on the growth of dimensions of fixed vectors of representations $\pi$ of $p$-adic ${\rm GL}_N$ under principal congruence subgroups: First, a uniform bound on the growth of fixed vectors in terms of the GK-dimension…

We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of…

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…

We revisit the problem of maximising the expected length of increasing subsequence that can be selected from a marked Poisson process by an online strategy. Resorting to a natural size variable, the problem is represented in terms of a…

We present a flexible random construction which, for certain graphs $H$, is able to produce $H$-free graphs with edge density strictly larger than that of the $H$-free process, while simultaneously preserving pseudorandom properties and…

We consider a family of mixed processes given as the sum of a fractional Brownian motion with Hurst parameter $H\in(3/4,1)$ and a multiple of an independent standard Brownian motion, the family being indexed by the scaling factor in front…

Let $K$ be a fixed number field, and assume that $K$ is Galois over $\qq$. Previously, the author showed that when estimating the number of prime ideals with norm congruent to $a$ modulo $q$ via the Chebotar\"ev Density Theorem, the mean…

Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…

For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of…