中文
相关论文

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

200 篇论文

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

数论 · 数学 2019-05-01 Gérald Tenenbaum

We prove uniform estimates for the expected value of averages of order statistics of bivariate functions in terms of their largest values by a direct analysis. As an application, uniform estimates for the expected value of averages of order…

概率论 · 数学 2018-10-03 Richard Lechner , Markus Passenbrunner , Joscha Prochno

We confirm a conjecture posed by Bergelson, Moreira, and Richter (arXiv:1711.05729), and in particular show that for every probability measure preserving system $(X,\mathscr{B},\mu,T)$, every $k\in \mathbb{N}$, every set $A\in \mathscr{B}$…

动力系统 · 数学 2026-02-25 Michael Reilly

Let $\mathsf{TH}_k$ denote the $k$-out-of-$n$ threshold function: given $n$ input Boolean variables, the output is $1$ if and only if at least $k$ of the inputs are $1$. We consider the problem of computing the $\mathsf{TH}_k$ function…

数据结构与算法 · 计算机科学 2024-12-24 Ziao Wang , Nadim Ghaddar , Banghua Zhu , Lele Wang

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

数论 · 数学 2017-01-11 Zhi-Wei Sun

This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…

Define a random variable $\xi_n$ by choosing a conjugacy class $C$ of the Sylow $p$-subgroup of $S_{p^n}$ by random, and let $\xi_n$ be the logarithm of the order of an element in $C$. We show that $\xi_n$ has bounded variance and mean…

群论 · 数学 2011-05-10 Jan-Christoph Schlage-Puchta

Let $\mathcal{P}_{\lambda}:=\mathcal{P}_{\lambda\kappa}$ denote a Poisson point process of intensity $\lambda\kappa$ on $[0,1]^d,d\geq2$, with $\kappa$ a bounded density on $[0,1]^d$ and $\lambda\in(0,\infty)$. Given a closed subset…

概率论 · 数学 2015-02-02 J. E. Yukich

We consider document listing on string collections, that is, finding in which strings a given pattern appears. In particular, we focus on repetitive collections: a collection of size $N$ over alphabet $[1,\sigma]$ is composed of $D$ copies…

数据结构与算法 · 计算机科学 2018-11-15 Gonzalo Navarro

The main objective of this paper is to look from the unique point of view at some phenomena arising in different areas of probability theory and mathematical statistics. We will try to understand what is common between classical…

概率论 · 数学 2012-03-01 Oleg Lepski

Let $B$ be a finite Boolean algebra. Let $\mathcal A$ be the partial order of all implication sublattices of $B$. We will compute the M\"obius function on $\mathcal A$ in two different ways.

组合数学 · 数学 2009-02-05 Colin Bailey , Joseph Oliveira

We revisit the problem of simultaneously testing the means of $n$ independent normal observations under sparsity. We take a Bayesian approach to this problem by introducing a scale-mixture prior known as the normal-beta prime (NBP) prior.…

统计方法学 · 统计学 2020-07-29 Ray Bai , Malay Ghosh

Many large arithmetic computations rely on tables of all primes less than $n$. For example, the fastest algorithms for computing $n!$ takes time $O(M(n\log n) + P(n))$, where $M(n)$ is the time to multiply two $n$-bit numbers, and $P(n)$ is…

计算复杂性 · 计算机科学 2015-04-22 Martin Farach-Colton , Meng-Tsung Tsai

We give an estimate for sums appearing in the Nyman-Beurling criterion for the Riemann Hypothesis containing the M\"obius function. The estimate is remarkably sharp in comparison to estimates of other sums containing the M\"obius function.…

经典分析与常微分方程 · 数学 2017-05-30 Helmut Maier , Michael Th. Rassias

The $A$-partition function $p_A(n)$ enumerates those partitions of $n$ whose parts belong to a fixed (finite or infinite) set $A$ of positive integers. On the other hand, the extended $A$-partition function…

组合数学 · 数学 2024-01-30 Krystian Gajdzica

We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap…

数论 · 数学 2019-01-01 Daniele Mastrostefano

We provide a formula for the logarithmic density of the set of positive real numbers on which two prime counting functions $\psi(x;q,a)$ and $\psi(x;q,b)$ are simultaneously larger than their asymptotic main terms, as well as a method for…

数论 · 数学 2025-10-08 Kübra Benli , Greg Martin , Paul Péringuey

For a fixed $a \in \{1, 2, 3, \ldots\},$ the radius of starlikeness of positive order is obtained for each of the normalized analytic functions \begin{align*} \mathtt{f}_{a, \nu}(z)&:= \bigg(2^{a \nu-a+1} a^{-\frac{a(a\nu-a+1)}{2}} \Gamma(a…

复变函数 · 数学 2017-07-04 Rosihan M. Ali , See Keong Lee , Saiful R. Mondal

The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…

数论 · 数学 2018-05-15 Shōta Inoue

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

数据结构与算法 · 计算机科学 2008-08-26 Gregory Karagiorgos , Dimitrios Poulakis