中文
相关论文

相关论文: An Explicit Tauberian Theorem taking Averaged Inpu…

200 篇论文

In this paper, we investigate the size of moments of quadratic character sums averaged over the family of fundamental discriminants. We obtain an asymptotic formula for all integer moments in a restricted range of parameters using a…

数论 · 数学 2025-10-09 Marc Munsch , Yuichiro Toma

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

数论 · 数学 2023-05-04 Dor Elboim , Ofir Gorodetsky

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

综合数学 · 数学 2016-09-02 Elias Rios

To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…

概率论 · 数学 2016-06-22 Bénédicte Haas

We address the classical problem of constructing confidence intervals (CIs) for the mean of a distribution, given \(N\) i.i.d. samples, such that the CI contains the true mean with probability at least \(1 - \delta\), where \(\delta \in…

统计理论 · 数学 2026-04-02 Vikas Deep , Achal Bassamboo , Sandeep Juneja

Let $d(n)$ be the number of divisors of $n$, let $\gamma$ denote Euler's constant and $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote…

数论 · 数学 2015-12-07 Aleksandar Ivić , Wenguang Zhai

Laguerre and Laguerre-type polynomials are orthogonal polynomials on the interval $[0,\infty)$ with respect to a weight function of the form $w(x) = x^{\alpha} e^{-Q(x)}, Q(x) = \sum_{k=0}^m q_k x^k, \alpha > -1, q_m > 0$. The classical…

数值分析 · 计算机科学 2018-01-16 Daan Huybrechs , Peter Opsomer

In this paper, we derive higher-order expansions of $L$-statistics of independent risks $X_1, \ldots, X_n$ under conditions on the underlying distribution function $F$. The new results are applied to derive the asymptotic expansions of…

概率论 · 数学 2014-10-08 E. Hashorva , C. Ling , Z. Peng

We derive new and improved non-asymptotic deviation inequalities for the sample average approximation (SAA) of an optimization problem. Our results give strong error probability bounds that are "sub-Gaussian"~even when the randomness of the…

最优化与控制 · 数学 2022-03-28 Roberto I. Oliveira , Philip Thompson

We prove three theorems about the asymptotic behavior of solutions $u$ to the homogeneous Dirichlet problem for the Laplace equation at boundary points with tangent cones. First, under very mild hypotheses, we show that the doubling index…

偏微分方程分析 · 数学 2023-07-21 Dennis Kriventsov , Zongyuan Li

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

数论 · 数学 2021-01-01 Adam J. Harper

In this paper, we mainly discuss asymptotic profiles of solutions to a class of abstract second-order evolution equations of the form $u''+Au+u'=0$ in real Hilbert spaces, where $A$ is a nonnegative selfadjoint operator. The main result is…

偏微分方程分析 · 数学 2024-10-28 Motohiro Sobajima

Given a number field $k$ and a quadratic extension $K_2$, we give an explicit asymptotic formula for the number of isomorphism classes of cubic extensions of $k$ whose Galois closure contains $K_2$ as quadratic subextension, ordered by the…

数论 · 数学 2011-03-16 Henri Cohen , Anna Morra

We study the distribution of the length of longest monotone subsequences in random (fixed-point free) involutions of $n$ integers as $n$ grows large, establishing asymptotic expansions in powers of $n^{-1/6}$ in the general case and in…

概率论 · 数学 2025-11-21 Folkmar Bornemann

Expectation Propagation is a very popular algorithm for variational inference, but comes with few theoretical guarantees. In this article, we prove that the approximation errors made by EP can be bounded. Our bounds have an asymptotic…

统计计算 · 统计学 2016-01-12 Guillaume P Dehaene , Simon Barthelmé

Asymptotic approximations ($n \to \infty$) to the truncation errors $r_n = - \sum_{\nu=0}^{\infty} a_{\nu}$ of infinite series $\sum_{\nu=0}^{\infty} a_{\nu}$ for special functions are constructed by solving a system of linear equations.…

经典分析与常微分方程 · 数学 2007-05-23 Ernst Joachim Weniger

Asymptotic expansions of series $\sum_{k=0}^\infty \epsilon^k(k+a)^\gamma e^{-(k+a)^\alpha x}$ and $\sum_{k=0}^\infty \epsilon^k(k+a)^\gamma / (x(k+a)^\alpha+1)^\mu}$ in powers of $x$ as $x\to+0$ are found, where $\epsilon=1$ or…

经典分析与常微分方程 · 数学 2010-02-02 Viktor P. Zastavnyi

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem. Our main results are the asymptotic formulas $$ \int_1^X \Delta^3(x){\rm d}x = BX^{7/4} + O_\epsilon(X^{\beta+\epsilon}) \qquad(B > 0) $$ and $$ \int_1^X…

数论 · 数学 2007-09-24 Aleksandar Ivić , Patrick Sargos

Let $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…

数论 · 数学 2025-02-19 Dimitrios Charamaras , Florian K. Richter

Let $S$ be a finite set, and $X_1,\ldots,X_n$ an i.i.d. uniform sample from $S$. To estimate the size $|S|$, without further structure, one can wait for repeats and use the birthday problem. This requires a sample size of the order…

统计理论 · 数学 2026-04-28 Sourav Chatterjee , Persi Diaconis , Susan Holmes