相关论文: The discrepancy of greater-than

The aim of this note is to provide an upper bound of the number of positive integers $\le x$ which can be written as $\varphi(n)$ for some positive integer $n$, where $\varphi$ stands for the Euler's function. The order of magnitude of this…

We introduce and study the \emph{Lattice Distortion Problem} (LDP). LDP asks how "similar" two lattices are. I.e., what is the minimal distortion of a linear bijection between the two lattices? LDP generalizes the Lattice Isomorphism…

The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…

In this paper, we present some extensions of interpolation between the arithmetic-geometric means inequality. Among other inequalities, it is shown that if $A, B, X$ are $n\times n$ matrices, then \begin{align*}…

A short proof of the elliptical range theorem concerning the numerical range of $2\times2$ complex matrices is given.

In the present paper, we study the geometric discrepancy with respect to families of rotated rectangles. The well-known extremal cases are the axis-parallel rectangles (logarithmic discrepancy) and rectangles rotated in all possible…

Laplace approximations are commonly used to approximate high-dimensional integrals in statistical applications, but the quality of such approximations as the dimension of the integral grows is not well understood. In this paper, we prove a…

In this article, we show multiple inequalities for the singular values of the difference of matrix means. The obtained results refine and complement some well established results in the literature. Although we target singular values…

The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…

It is a well-known conjecture in the theory of irregularities of distribution that the L1 norm of the discrepancy function of an N-point set satisfies the same asymptotic lower bounds as its L^2 norm. In dimension d=2 this fact has been…

In the 1990's exponential-type error bounds appeared in the theory of radial basis functions. This kind of error bounds is very powerful. However it only measures the difference between the approximant and approximand. Mathematicians and…

In this paper, considering the concept of Universal Multiplication Table, we show that for every $n\geq 2$, the inequality: $$ M(n)=#\{ij|1\leq i,j\leq n\}\geq\frac{n^2}{\mathfrak{N}(n^2)}, $$ holds true with: $$…

For number $n>1$, let $\mathcal{A}(n) = \{1\leq a<n: n|a^2-1, a|n^2-1 \}$. We show that the size of $\mathcal{A}(n)$ is connected to a property concerning integer evaluations of Fibonacci-like polynomials. In the process, we prove that…

A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity…

We show that the distance in total variation between $(\mathrm{Tr}\ U, \frac{1}{\sqrt{2}}\mathrm{Tr}\ U^2, \cdots, \frac{1}{\sqrt{m}}\mathrm{Tr}\ U^m)$ and a real Gaussian vector, where $U$ is a Haar distributed orthogonal or symplectic…

Consider the plane as a union of congruent unit squares in a checkerboard pattern, each square colored black or white in an arbitrary manner. The discrepancy of a curve with respect to a given coloring is the difference of its white length…

The divergence of the harmonic series is proved by direct comparison with a series whose nth partial sum telescopes to the natural logarithm of n. The key idea is to apply the classical inequality x>=log(1+x) (valid for x>-1) with x=1/k and…

Consider the plane as a checkerboard, with each unit square colored black or white in an arbitrary manner. In a previous paper we showed that for any such coloring there are straight line segments, of arbitrarily large length, such that the…

We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…