Related papers: Estimates for the asymptotic convergence factor of…

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes in $\mathbb{R}^k$. Cubicity is a variant of boxicity, where the axis parallel boxes in the intersection…

In this paper, we discuss asymptotic relations for the approximation of $\left\vert x\right\vert ^{\alpha},\alpha>0$ in $L_{\infty}\left[ -1,1\right] $ by Lagrange interpolation polynomials based on the zeros of the Chebyshev polynomials of…

For two matrices $A$ and $B$, and large $n$, we show that most products of $n$ factors of $e^{A/n}$ and $n$ factors of $e^{B/n}$ are close to $e^{A + B}$. This extends the Lie-Trotter formula. The elementary proof is based on the relation…

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…

We obtain asymptotics for sums of the form $$ \sum_{n=1}^P e(\alpha_kn^k + \alpha_1n), $$ involving lower order main terms. As an application, we show that for almost all $\alpha_2 \in [0,1)$ one has $$ \sup_{\alpha_1 \in [0,1)} \Big|…

In this paper we prove asymptotic formulas for the $L^p$ norms of $P_n(\theta)=\prod_{k=1}^n (1-e^{ik\theta})$ and $Q_n(\theta)=\prod_{k=1}^n (1+e^{ik\theta})$. These products can be expressed using $\prod_{k=1}^n…

The electrostatic interpretation of zeros of Jacobi polynomials, due to Stieltjes and Schur, enables us to obtain the complete asymptotic expansion as $n \to \infty$ of the minimal logarithmic potential energy of $n$ point charges…

We prove sharp lower bound estimates for the first nonzero eigenvalue of the non-linear elliptic diffusion operator $L_p$ on a smooth metric measure space, without boundary or with a convex boundary and Neumann boundary condition,…

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…

When a parameter of interest is defined to be a nondifferentiable transform of a regular parameter, the parameter does not have an influence function, rendering the existing theory of semiparametric efficient estimation inapplicable.…

Let $\kappa_e(\overline{M}_{g,n})$ denote the kappa ring of $\overline{M}_{g,n}$ in codimension $e$. For $g,e\geq 0$ fixed, as the number $n$ of the markings grows large we show that the rank of $\kappa_e(\overline{M}_{g,n})$ is asymptotic…

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…

Let $E$ be a Jordan rectifiable curve in the complex plane and let $G$ be the bounded component of $\mathbb{C}\backslash E$. Now let $n\in \mathbb{N}$, and let $m_{n,E}$ denote the extremal constants defined by \begin{equation*}m_{n,E}=\inf…

Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…

It has been conjectured that the statistical properties of zeros of the Riemann zeta function near $z = 1/2 + \ui E$ tend, as $E \to \infty$, to the distribution of eigenvalues of large random matrices from the Unitary Ensemble. At finite…

We derive two-sided bounds for a class of Stirling-type asymptotic formulas for piecewise logarithmic interpolations of the pi function, and hence also for the factorials and the gamma functions. The bounds are derived by first proving some…

Given two elementary embeddings from the collection of sets of rank less than $\lambda$ to itself, one can combine them to obtain another such embedding in two ways: by composition, and by applying one to (initial segments of) the other.…

In this paper, we establish several asymptotical bounds for the complete elliptic integrals of the second kind $\mathcal{E}(r)$, and improve the well-known conjecture $\mathcal{E}(r)>\pi[(1+(1-r^2)^{3/4})/2]^{2/3}/2$ for all $r\in(0,1)$…

We study the computational complexity of two hard problems on determinantal point processes (DPPs). One is maximum a posteriori (MAP) inference, i.e., to find a principal submatrix having the maximum determinant. The other is probabilistic…