中文
相关论文

相关论文: The average order of the M\"{o}bius function for B…

200 篇论文

Given an ergodic dynamical system $(X, \mathcal{B}, \mu, T)$, we prove that for each function $f$ belonging to the Orlicz space $L(\log L)^2(\log \log L)(X, \mu)$, the ergodic averages \[ \frac{1}{\pi(N)} \sum_{p \in \mathbb{P}_N} f\big(T^p…

动力系统 · 数学 2019-07-11 Bartosz Trojan

We improve on all the results of [13] by incorporating the finite range computations performed since then by several authors. Thus we have \begin{align*} \Bigg|\sum_{n\le X}\mu(n)\Bigg| &\le \frac{0.006688\,X}{\log X},&&\text{for } X\ge…

数论 · 数学 2025-12-15 Olivier Ramaré , Sebastian Zuniga Alterman

We show the zero-density estimate \[ N(\zeta_{\mathcal{P}}; \alpha, T) \ll T^{\frac{4(1-\alpha)}{3-2\alpha-\theta}}(\log T)^{9} \] for Beurling zeta functions $\zeta_{\mathcal{P}}$ attached to Beurling generalized number systems with…

数论 · 数学 2024-09-17 Frederik Broucke

The $M$-triangle of a ranked locally finite poset $P$ is the generating function $\sum_{u,w\in P} ^{}\mu(u,w) x^{\rk u}y^{\rk w}$, where $\mu(.,.)$ is the M\"obius function of $P$. We compute the $M$-triangle of Armstrong's poset of…

组合数学 · 数学 2007-05-23 Christian Krattenthaler

We consider Gibbs distributions, which are families of probability distributions over a discrete space $\Omega$ with probability mass function of the form $\mu^\Omega_\beta(\omega) \propto e^{\beta H(\omega)}$ for $\beta$ in an interval…

数据结构与算法 · 计算机科学 2025-04-04 David G. Harris , Vladimir Kolmogorov

The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…

组合数学 · 数学 2014-04-03 Jason P Smith

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

数论 · 数学 2016-12-06 William D. Banks , Victor Z. Guo

We use discrete Morse theory to determine the M\"obius function of generalized factor order. Ordinary factor order on the Kleene closure A* of a set A is the partial order defined by letting u\leq w if w contains u as a subsequence of…

组合数学 · 数学 2011-08-22 Robert Willenbring

Let $(\mathbb{X} , d, \mu )$ be a proper metric measure space and let $\Omega \subset \mathbb{X}$ be a bounded domain. For each $x\in \Omega$, we choose a radius $0< \varrho (x) \leq \mathrm{dist}(x, \partial \Omega ) $ and let $B_x$ be the…

偏微分方程分析 · 数学 2017-02-24 Ángel Arroyo , José G. Llorente

A central problem in computational statistics is to convert a procedure for sampling combinatorial from an objects into a procedure for counting those objects, and vice versa. Weconsider sampling problems coming from *Gibbs distributions*,…

概率论 · 数学 2023-08-21 David G. Harris , Vladimir Kolmogorov

The paper studies entire functions of finite order of growth for which a representation of the form $\psi(z) = 1+ O(|z|^{-\mu}), \mu >0,$ as $z\to \infty$, is valid on a fixed ray of the complex plane. The main result is the following.…

复变函数 · 数学 2016-01-20 V. L. Geynts , A. A. Shkalikov

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

数论 · 数学 2021-02-10 Sungjin Kim

Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u \leq w if and only if there is a subword u' of w having the same length as u such that each…

组合数学 · 数学 2012-02-14 Peter R. W. McNamara , Bruce E. Sagan

We present a two term formula for the M\"obius function of intervals in the poset of all permutations, ordered by pattern containment. The first term in this formula is the number of so called normal occurrences of one permutation in…

组合数学 · 数学 2017-05-23 Jason P. Smith

Let $M(x)$ denote the largest cardinality of a subset of $\{n \in \mathbf{N}: n \leq x\}$ on which the Euler totient function $\varphi(n)$ is non-decreasing. We show that $M(x) = (1+O(\frac{(\log\log x)^5}{\log x})) \pi(x)$ for all $x \geq…

数论 · 数学 2024-04-09 Terence Tao

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…

综合数学 · 数学 2019-11-28 N. A. Carella

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

数论 · 数学 2007-05-23 Florian Luca , Pantelimon Stanica

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

数论 · 数学 2013-03-19 Michel Planat , Patrick Solé

Let the summatory function of the M\"{o}bius function be denoted $M(x)$. We deduce in this article conditional results concerning $M(x)$ assuming the Riemann Hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the…

数论 · 数学 2007-05-23 Nathan Ng

Let $\left[x\right]$ be the largest integer not exceeding $x$. For $0<\theta \leq 1$, let $\pi_{\theta}(x)$ denote the number of integers $n$ with $1 \leq n \leq x^{\theta}$ such that $\left[\frac{x}{n}\right]$ is prime and…

数论 · 数学 2023-09-01 Runbo Li