Related papers: The discrepancy of greater-than

We propose an approach for calculating $K\to\pi\pi$ decays to the next-to-leading order in chiral expansion. A detailed numerical study of this approach is being performed.

It is shown how to define difference equations on particular lattices $\{x_n\}$, $n\in\mathbb{Z}$, made of values of an elliptic function at a sequence of arguments in arithmetic progression (elliptic lattice). Solutions to special…

The aim of this note is to prove a new discrepancy principle. The advantage of the new discrepancy principle compared with the known one consists of solving a minimization problem approximately, rather than exactly, and in the proof of a…

We derive a new result for exponential approximation using Stein's method of exchangeable pairs. As an application, an exponential limit theorem with error term is derived for |Tr(U)|^2, where Tr(U) denotes the trace of a matrix chosen from…

The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou, FOCS 2023], the new method introduces several new…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, our primary goal is to study the asymptotic behavior of the finite differences of the logarithm of the overpartition function, i.e., $(-1)^{r-1}\Delta^r \log \p(n)$, by…

It follows from Grothendieck's little inequality that to any complex (m x n) matrix X of column norm at most 1, and an 0 <e <1, there exist a natural number q, an (m x q) matrix C with $(1-e)^2 \leq CC^* \leq (4/\pi) (1 + e)^2$ and an (q x…

Let $d_N=ND_N(\omega)$ be the discrepancy of the Van der Corput sequence in base $2$. We improve on the known bounds for the number of indices $N$ such that $d_N\leq \log N/100$. Moreover, we show that the summatory function of $d_N$…

The famous Gelfand formula $\rho(A)= \limsup_{n\to\infty}\|A^{n}\|^{1/n}$ for the spectral radius of a matrix is of great importance in various mathematical constructions. Unfortunately, the range of applicability of this formula is…

The numerical radius of the general $2\times2$ complex matrix is calculated.

We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any…

It is known that inequality $|z^n-1|\geq|z-1|$ holds on the circle $|z-1/2|= 1/2$, where $n$ is a positive integer. We prove that in fact $n$ can be real number not less then 1. We also prove following inequality as a lemma: $cos^nx\lt…

For a partition $\lambda \vdash n$, we let $\operatorname{pd}(\lambda)$, the parity difference of $\lambda$, be the number of odd parts of $\lambda$ minus the number of even parts of $\lambda$. We prove for $c_0\in\mathbb{R}$ an asymptotic…

Let $(H(n))_{n \geq 0} $ be a $2-$dimensional Halton's sequence. Let $D_{2} ( (H(n))_{n=0}^{N-1}) $ be the $L_2$-discrepancy of $ (H_n)_{n=0}^{N-1} $. It is known that $\limsup_{N \to \infty } (\log N)^{-1} D_{2} ( H(n) )_{n=0}^{N-1} >0$.…

For variable-length coding with an almost-sure distortion constraint, Zhang et al. show that for discrete sources the redundancy is upper bounded by $\log n/n$ and lower bounded (in most cases) by $\log n/(2n)$, ignoring lower order terms.…

Every sufficiently big matrix with small spectral norm has a nearby low-rank matrix if the distance is measured in the maximum norm (Udell & Townsend, SIAM J Math Data Sci, 2019). We use the Hanson--Wright inequality to improve the estimate…

We extend the difference analogue of Cartan's second main theorem for the case of slowly moving periodic hyperplanes, and introduce two different natural ways to find a difference analogue of the truncated second main theorem. As…

We determine the complete list of the gaps between successive elements of the multiplication table of the first N integers.

We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…