中文
相关论文

相关论文: On the $p^{\lambda}$ problem

200 篇论文

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for $\alpha\in\mathbb{R}\backslash\mathbb{Q},\,\beta\in\mathbb{R}$ and $0<\theta<10/1561$, there…

数论 · 数学 2021-03-23 Fei Xue , Jinjiang Li , Min Zhang

We begin the study of list-decodable linear regression using batches. In this setting only an $\alpha \in (0,1]$ fraction of the batches are genuine. Each genuine batch contains $\ge n$ i.i.d. samples from a common unknown distribution and…

机器学习 · 计算机科学 2022-11-24 Abhimanyu Das , Ayush Jain , Weihao Kong , Rajat Sen

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

数论 · 数学 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

概率论 · 数学 2017-07-06 Yueyun Hu

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

组合数学 · 数学 2018-10-16 Colin McDiarmid , David Penman , Vasileios Iliopoulos

Consider two problems about an unknown probability distribution $p$: 1. How many samples from $p$ are required to test if $p$ is supported on $n$ elements or not? Specifically, given samples from $p$, determine whether it is supported on at…

数据结构与算法 · 计算机科学 2026-05-27 Renato Ferreira Pinto , Nathaniel Harms

We study the eigenvalue problem for a system of fractional $p-$Laplacians, that is, $$ \begin{cases} (-\Delta_p)^r u = \lambda\dfrac{\alpha}p|u|^{\alpha-2}u|v|^{\beta} &\text{in } \Omega,\vspace{.1cm} (-\Delta_p)^s u =…

偏微分方程分析 · 数学 2019-02-04 Leandro M. Del Pezzo , Julio D. Rossi

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

数论 · 数学 2021-04-14 Harald Andrés Helfgott , Maksym Radziwiłł

We establish an unconditional asymptotic formula describing the horizontal distribution of the zeros of the derivative of the Riemann zeta-function. For $\Re(s)=\sigma$ satisfying $(\log T)^{-1/3+\epsilon} \leq (2\sigma-1) \leq (\log \log…

数论 · 数学 2019-02-20 S. J. Lester

In this paper the existence of solutions, $(\lambda,u)$, of the problem $$-\Delta u=\lambda u -a(x)|u|^{p-1}u \quad \hbox{in }\Omega, \qquad u=0 \quad \hbox{on}\;\;\partial\Omega,$$ is explored for $0 < p < 1$. When $p>1$, it is known that…

偏微分方程分析 · 数学 2024-03-08 Julián López-Gómez , Paul H. Rabinowitz , Fabio Zanolin

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

数论 · 数学 2011-05-31 Giovanni Coppola

Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the…

数论 · 数学 2022-09-16 Szilárd Gy. Révész

We consider Bernoulli nonadaptive group testing with $k = \Theta(n^\theta)$ defectives, for $\theta \in (0,1)$. The practical definite defectives (DD) detection algorithm is known to be optimal for $\theta \geq 1/2$. We give a new upper…

信息论 · 计算机科学 2017-11-27 Matthew Aldridge

We present three equivalent definitions of the fractional $p$-Laplacian $(-\Delta_{\mathbb{H}^{n}})^{s}_{p}$, $0<s<1$, $p>1$, with normalizing constants, on hyperbolic spaces. The explicit values of the constants enable us to study the…

偏微分方程分析 · 数学 2026-02-03 Jongmyeong Kim , Minhyun Kim , Ki-Ahm Lee

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

数论 · 数学 2023-04-18 Moubariz Z. Garaev , Igor E. Shparlinski

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

计算机科学中的逻辑 · 计算机科学 2018-05-07 Alexis Bès , Christian Choffrut

We study $L^p$ bounds on spectral projections for the Laplace operator on compact Riemannian manifolds, restricted to small frequency dependent neighborhoods of submanifolds. In particular, if $\lambda$ is a frequency and the size of the…

偏微分方程分析 · 数学 2016-05-17 Katya Krupchyk

We obtain a global fractional Calder\'on-Zygmund regularity theory for the fractional Poisson problem. More precisely, for $\Omega \subset \mathbb{R}^N$, $N \geq 2$, a bounded domain with boundary $\partial \Omega$ of class $C^2$, $s \in…

偏微分方程分析 · 数学 2023-04-19 Boumediene Abdellaoui , Antonio J. Fernández , Tommaso Leonori , Abdelbadie Younes

We consider the problem of partitioning a line segment into two subsets, so that $n$ finite measures all have the same ratio of values for the subsets. Letting $\alpha\in[0,1]$ denote the desired ratio, this generalises the PPA-complete…

计算复杂性 · 计算机科学 2022-11-30 Paul W. Goldberg , Jiawei Li

In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…

数论 · 数学 2013-10-01 Fausto Martelli