中文
相关论文

相关论文: An upper bound for the logarithmic capacity of two…

200 篇论文

We give an $O(\log^2 n)$-query algorithm for finding a Tarski fixed point over the $4$-dimensional lattice $[n]^4$, matching the $\Omega(\log^2 n)$ lower bound of [EPRY20]. Additionally, our algorithm yields an ${O(\log^{\lceil…

计算复杂性 · 计算机科学 2026-04-02 Xi Chen , Yuhao Li , Mihalis Yannakakis

The notion of the capacity of a polynomial was introduced by Gurvits around 2005, originally to give drastically simplified proofs of the Van der Waerden lower bound for permanents of doubly stochastic matrices and Schrijver's inequality…

组合数学 · 数学 2020-10-20 Leonid Gurvits , Jonathan Leake

This paper shows that the logarithm of the epsilon-error capacity (average error probability) for n uses of a discrete memoryless channel is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2 log n +…

信息论 · 计算机科学 2013-10-25 Marco Tomamichel , Vincent Y. F. Tan

This paper provides a detailed expository and computational account of the elementary methods developed by P. L. Chebyshev and J. J. Sylvester to establish explicit bounds on the prime counting function. The core of the method involves…

数论 · 数学 2025-12-03 Tsogtgerel Gantumur

The calculation of volumes of polyhedra in the three-dimensional Euclidean, spherical and hyperbolic spaces is very old and difficult problem. In particular, an elementary formula for volume of non-euclidean simplex is still unknown. One of…

度量几何 · 数学 2007-05-23 Dmitriy Derevnin , Alexander Mednykh

We consider logarithmic averages, over friable integers, of non-negative multiplicative functions. Under logarithmic, one-sided or two-sided hypotheses, we obtain sharp estimates that improve upon known results in the literature regarding…

数论 · 数学 2024-09-24 Gérald Tenenbaum , Jie Wu

Making use of two different analytical-numerical methods for capacity computation, we obtain matching to a very high precision numerical values for capacities of a wide family of planar condensers. These two methods are based respectively…

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ is defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

复变函数 · 数学 2017-05-16 Md Firoz Ali , A. Vasudevarao

In his influential work Choquet systematically studied capacities on Boolean algebras in a topological space, and gave a probabilistic interpretation for completely monotone (and completely alternating) capacities. Beyond complete…

概率论 · 数学 2011-05-10 Motoya Machida

We obtain sharp bounds for the modulus of continuity of the uncentered maximal function in terms of the modulus of continuity of the given function, via integral formulas. Some of the results deduced from these formulas are the following:…

经典分析与常微分方程 · 数学 2010-09-08 J. M. Aldaz , L. Colzani , J. Pérez Lázaro

In this paper, we investigate the maximum number of limit cycles of the reduced Abel equation $\dot{x}=A(t)x^{3}+B(t)x^{2}$ on an interval $[0,T]$. The Smale-Pugh problem asks whether this maximum number is bounded in terms of a given class…

经典分析与常微分方程 · 数学 2026-01-06 Jianfeng Huang , Renhao Tian , Yulin Zhao

We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…

计算复杂性 · 计算机科学 2017-11-03 Noga Alon , Mrinal Kumar , Ben Lee Volk

In this paper, we establish a new estimate (including lower and upper bounds) for an important quantity involved in the convergence analysis of smoothed aggregation algebraic multigrid methods. The new upper bound improves the existing…

数值分析 · 数学 2019-03-19 Xuefeng Xu , Chen-Song Zhang

Rabinovitch showed in 1978 that the interval orders having a representation consisting of only closed unit intervals have order dimension at most 3. This article shows that the same dimension bound applies to two other classes of posets:…

组合数学 · 数学 2022-01-05 Mitchel T. Keller , Ann N. Trenk , Stephen J. Young

We establish $L^{p_1}(\mathbb R^d) \times \cdots \times L^{p_n}(\mathbb R^d) \rightarrow L^r(\mathbb R^d)$ bounds for spherical averaging operators $\mathcal A^n$ in dimensions $d \geq 2$ for indices $1\le p_1,\dots , p_n\le \infty$ and…

经典分析与常微分方程 · 数学 2026-02-25 Xinyu Gao

Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…

机器学习 · 统计学 2017-11-27 Guillaume P. Dehaene

In the paper, the authors discover the best constants $\alpha_{1}$, $\alpha_{2}$, $\beta_{1}$, and $\beta_{2}$ for the double inequalities $$ \alpha_{1}\bar{C}(a,b)+(1-\alpha_{1}) A(a,b)< T(a,b) <\beta_{1} \bar{C}(a,b)+(1-\beta_{1})A(a,b)…

经典分析与常微分方程 · 数学 2014-09-15 Yun Hua , Feng Qi

We obtain a derivative formula for various notions of capacity. Namely we identify the second order term in the asymptotic expansion of the capacity of a union of two sets, as their distance goes to infinity. Our result applies to the usual…

概率论 · 数学 2025-11-04 Amine Asselah , Bruno Schapira , Perla Sousi

For $0\le k\le n$, write $\binom nk=uv$ where the primes dividing $u$ are at most $k$ and the primes dividing $v$ exceed $k$, and let $f(n)$ be the least $k$ with $u>n^2$; Erd\H{o}s problem 684 asks for bounds on $f(n)$. We resolve the…

数论 · 数学 2026-04-29 Ji Ho Bae

We derive estimates of the Babu\u{s}ka-Brezzi inf-sup constant $\beta$ for two-dimensional incompressible flow in a periodic channel with one flat boundary and the other given by a periodic, Lipschitz continuous function $h$. If $h$ is a…

偏微分方程分析 · 数学 2007-06-28 Jon Wilkening