中文
相关论文

相关论文: A unified and improved Chebotarev density theorem

200 篇论文

With the uniform positions we prove theorems of Landau and Hardy-Littlwood type for Goldbach, Chen, Lemoine-Levy and other binary partitions of positive integers. We also pose some new conjectures.

数论 · 数学 2012-03-27 Vladimir Shevelev

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

计算机科学中的逻辑 · 计算机科学 2010-12-02 David Baelde

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

数论 · 数学 2026-05-20 Michael Harm

In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…

计算机科学中的逻辑 · 计算机科学 2025-06-18 Esaïe Bauer , Alexis Saurin

We study the asymptotic stability for large times of homogeneous stationary states for the nonlinear Hartree equation for density matrices in Rd for d\geq3. We can reach both the optimal Sobolev and Schatten exponents for the initial data,…

偏微分方程分析 · 数学 2025-04-29 Antoine Borie , Sonae Hadama , Julien Sabin

Reasons for the emergence of Chebyshev's bias were investigated. The Deep Riemann Hypothesis (DRH) enables us to reveal that the bias is a natural phenomenon for achieving a well-balanced disposition of the whole sequence of primes, in the…

数论 · 数学 2022-06-28 Miho Aoki , Shin-ya Koyama

We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs…

组合数学 · 数学 2008-04-01 Ernie Croot , Olof Sisask

We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of David et al. and Bendkowski et al. to all Turing-complete…

计算机科学中的逻辑 · 计算机科学 2016-07-19 Maciej Bendkowski , Katarzyna Grygiel , Marek Zaionc

The prime number theorem, established by Hadamard and de la Vall'ee Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1 / ln x. Whereas their proofs made serious use of the methods…

人工智能 · 计算机科学 2007-05-23 Jeremy Avigad , Kevin Donnelly , David Gray , Paul Raff

We consider random products of $SL(2, \mathbb{R})$ matrices that depend on a parameter in a non-uniformly hyperbolic regime. We show that if the dependence on the parameter is monotone then almost surely the random product has upper…

动力系统 · 数学 2020-12-03 Anton Gorodetski , Victor Kleptsyn

We prove a uniform effective density theorem as well as an effective counting result for a generic system comprising a polynomial with a mild homogeneous condition and several linear forms using Roger's second moment formula for the Siegel…

数论 · 数学 2020-07-22 Prasuna Bandi , Anish Ghosh , Jiyoung Han

We prove a threshold phenomenon for the existence/non-existence of energy minimizing solitary solutions of the diffraction management equation for strictly positive and zero average diffraction. Our methods allow for a large class of…

偏微分方程分析 · 数学 2017-11-22 Mi-Ran Choi , Dirk Hundertmark , Young-Ran Lee

This paper studies finite-time stability and instability theorems in probability sense for stochastic nonlinear systems. Firstly, a new sufficient condition is proposed to guarantee that the considered system has a global solution.…

最优化与控制 · 数学 2022-07-26 Weihai Zhang , Liqiang Yao

We establish a joint distribution result concerning the fractional part of $\alpha p^\theta$ for $\theta \in (0,1), \ \alpha>0$, where $p$ is a prime satisfying a Chebotarev condition in a fixed finite Galois extension over $\mathbb{Q}$. As…

数论 · 数学 2021-03-12 Amita Malik , Neha Prabhu

When $G$ is solvable group, we prove that the number of conjugacy classes of elements of prime power order is less than or equal to the number of irreducible characters with values in fields where $\mathbb {Q}$ is extended by prime power…

群论 · 数学 2015-06-29 Mark L. Lewis

We consider the Grenander estimator that is the maximum likelihood estimator for non-increasing densities. We prove uniform central limit theorems for certain subclasses of bounded variation functions and for H\"older balls of smoothness…

统计理论 · 数学 2015-06-29 Jakob Söhl

Let $\omega=(-1+\sqrt{-3})/2$. For any lattice $P\subseteq \mathbb{Z}^n$, $\mathcal{P}=P+\omega P$ is a subgroup of $\mathcal{O}_K^n$, where $\mathcal{O}_K=\mathbb{Z}[\omega]\subseteq \mathbb{C}$. As $\mathbb{C}$ is naturally isomorphic to…

数论 · 数学 2015-08-13 Shantian Cheng

We make explicit Bombieri's refinement of Gallagher's log-free "large sieve density estimate near $\sigma = 1$" for Dirichlet $L$-functions. We use this estimate and recent work of Green to prove that if $N\geq 2$ is an integer,…

数论 · 数学 2025-01-07 Jesse Thorner , Asif Zaman

In this work we show that if the frame property of a Gabor frame with window in Feichtinger's algebra and a fixed lattice only depends on the parity of the window, then the lattice can be replaced by any other lattice of the same density…

泛函分析 · 数学 2019-12-06 Markus Faulhuber

We prove that the density of non-tempered (at any $p$-adic place) cuspidal representations for $\mathrm{GL}_n(\mathbb{Z})$, varying over a family of representations ordered by their infinitesimal characters, is small -- confirming Sarnak's…

数论 · 数学 2025-04-17 Edgar Assing , Subhajit Jana