中文
相关论文

相关论文: Numerically explicit estimates for the distributio…

200 篇论文

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

数论 · 数学 2013-02-27 Sadegh Nazardonyavi , Semyon Yakubovich

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

数论 · 数学 2017-06-12 Dimitris Koukoulopoulos

The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutations whose number of descents lies in a fixed congruence…

概率论 · 数学 2026-05-13 Jason Fulman , Adrian Röllin

Let $P^{\left(\frac 12\right)}(n)$ denote the middle prime factor of $n$ (taking into account multiplicity). More generally, one can consider, for any $\alpha \in (0,1)$, the $\alpha$-positioned prime factor of $n$, $P^{(\alpha)}(n)$. It…

数论 · 数学 2023-05-03 Nathan McNew , Paul Pollack , Akash Singha Roy

Given an i.i.d. sample drawn from some probability distribution on a finite set, the best (in the sense of least variance) linear unbiased estimator (BLUE) of the average of any quantity with respect to that distribution is the sample…

统计理论 · 数学 2025-07-28 Bastiaan J. Braams

A well-known conjecture in analytic number theory states that for every pair of sets $X,Y\subset\mathbb{Z}/p\mathbb{Z}$, each of size at least $\log ^C p$ (for some constant $C$) we have that the number of pairs $(x,y)\in X\times Y$ such…

组合数学 · 数学 2015-12-18 Rudi Mrazović

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

数值分析 · 计算机科学 2010-06-01 Richard P. Brent

We improve the Modified Winitzki's Approximation of the error function $erf(x)\cong \sqrt{1-e^{-x^2\frac{\frac{4}{\pi}+0.147x^2}{1+0.147x^2}}}$ which has error $|\varepsilon (x)| < 1.25 \cdot 10^{-4}$ $\forall x \ge 0$ till reaching 4…

统计计算 · 统计学 2012-01-09 A. Soranzo , E. Epure

In this work, we develop a numerical method to study the error estimates of the $\alpha$-stable central limit theorem under sublinear expectation with $\alpha \in(0,2)$, whose limit distribution can be characterized by a fully nonlinear…

数值分析 · 数学 2023-10-09 Lianzi Jiang

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

数论 · 数学 2013-06-06 Shanta Laishram , Ram Murty

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

数论 · 数学 2010-11-19 Andreas Weingartner

We investigate the sharp density $\rho(t,x; y)$ of the solution $u(t,x)$ to stochastic partial differential equation $\frac{\partial }{\partial t} u(t,x)=\frac12 \Delta u(t,x)+u\diamond \dot W(t,x)$, where $\dot W$ is a general Gaussian…

概率论 · 数学 2018-01-11 Yaozhong Hu , Khoa Lê

In the present paper we study the asymptotic behavior of trigonometric products of the form $\prod_{k=1}^N 2 \sin(\pi x_k)$ for $N \to \infty$, where the numbers $\omega=(x_k)_{k=1}^N$ are evenly distributed in the unit interval $[0,1]$.…

We prove a stability result for general $3$-wise correlations over distributions satisfying mild connectivity properties. More concretely, we show that if $\Sigma,\Gamma$ and $\Phi$ are alphabets of constant size, and $\mu$ is a pairwise…

计算复杂性 · 计算机科学 2024-08-02 Amey Bhangale , Subhash Khot , Dor Minzer

For a fixed graph property $\Phi$ and integer $k \geq 1$, consider the problem of counting the induced $k$-vertex subgraphs satisfying $\Phi$ in an input graph $G$. This problem can be solved by brute-force in time $O(n^{k})$. Under ETH, we…

计算复杂性 · 计算机科学 2025-12-11 Radu Curticapean , Daniel Neuen

We consider the variable selection problem in linear regression. Suppose that we have a set of random variables $X_1,...,X_m,Y,\epsilon$ such that $Y=\sum_{k\in \pi}\alpha_kX_k+\epsilon$ with $\pi\subseteq \{1,...,m\}$ and $\alpha_k\in…

统计理论 · 数学 2010-12-21 Joe Suzuki

We discuss optimal constants in a recent result of Rudelson and Vershynin on marginal densities. We show that if $f$ is a probability density on $\R^n$ of the form $f(x)=\prod_{i=1}^n f_i(x_i)$, where each $f_i$ is a density on $\R$, say…

概率论 · 数学 2016-01-05 Galyna Livshyts , Grigoris Paouris , Peter Pivovarov

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

数论 · 数学 2016-06-16 Alexander P. Mangerel

Standard large deviation estimates or the use of the Hubbard-Stratonovich transformation reduce the analysis of the distribution of the overlap parameters essentially to that of an explicitly known random function $\Phi_{N,\b}$ on $\R^M$.…

凝聚态物理 · 物理学 2007-05-23 Anton Bovier , Véronique Gayrard

Let $\phi(\cdot)$ and $\sigma(\cdot)$ denote the Euler function and the sum of divisors function, respectively. In this paper, we give a lower bound for the number of positive integers $m\le x$ for which the equation $m=n-\phi(n)$ has no…

数论 · 数学 2007-05-23 William D. Banks , Florian Luca