Istvan Berkes, Michel Weber
Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables, then $$ \lim_{N\to \infty} {\sum_{n=1}^N f(n) X_n \over\sum_{n=1}^N f(n)} \buildrel{a.s.}\over{=} \E X . $$
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A characterization of multiplicative (and additive) arithmetical functions is given. Using this characterization, we show that the group of multiplicative arithmetical functions is isomorphic to the group of additive arithmetical functions.
We study the questions of determining the asymptotics of the probabilistic characteristics of additive arithmetic functions in the paper, regardless of whether they have a limit distribution or not. Several assertions are proved about the estimation of the asymptotics of the probabilistic characteristics of strongly additive arithmetic functions, as well as additive functions of the class that have the same asymptotic behavior of the probabilistic characteristics, as for strongly additive arithmetic functions.
We first introduce the arithmetic subderivative of a positive integer with respect to a non-empty set of primes. This notion generalizes the concepts of the arithmetic derivative and arithmetic partial derivative. More generally, we then define that an arithmetic function $f$ is Leibniz-additive if there is a nonzero-valued and completely multiplicative function $h_f$ satisfying $f(mn)=f(m)h_f(n)+f(n)h_f(m)$ for all positive integers $m$ and $n$. We study some basic properties of such functions. For example, we present conditions when an arithmetic function is Leibniz-additive and, generalizin…
Additive arithmetic functions with limit normal distribution
本文研究了加性算术函数收敛于正态分布的充分条件，证明了Erdos-Kac定理的推广以确定收敛速度，并提供了应用实例。
An approach to determining the existence of a limit distribution of additive arithmetic functions
本文提出一种基于Dirichlet卷积与Möbius反演性质的方法，用于判定加性算术函数极限分布的存在性，并给出求其均值与方差的公式及实例。
An arithmetic function $f$ is Leibniz-additive if there is a completely multiplicative function $h_f$, i.e., $h_f(1)=1$ and $h_f(mn)=h_f(m)h_f(n)$ for all positive integers $m$ and $n$, satisfying $$ f(mn)=f(m)h_f(n)+f(n)h_f(m) $$ for all positive integers $m$ and $n$. A motivation for the present study is the fact that Leibniz-additive functions are generalizations of the arithmetic derivative $D$; namely, $D$ is Leibniz-additive with $h_D(n)=n$. In this paper, we study the basic properties of Leibniz-additive functions and, among other things, show that a Leibniz-additive function $f$ is tot…
We unify in a large class of additive functions the results obtained in the first part of this work. The proof rests on series involving the Riemann zeta function and certain sums of primes which may have their own interest.
We study the asymptotics of the moments of arithmetic functions that have a limit distribution, not necessarily normal, defined on a subset of the natural series that satisfies certain requirements. Several assertions are proved on estimating the asymptotics of the moments of strongly additive arithmetic functions and also with additive functions of the class H that have a limit distribution and are defined on a subset of the natural series. The first version of the article is devoted to the study of the asymptotics of the moments of arithmetic functions that have a limit distribution on the n…
We give a language for geometry which makes curves and number fields look alike.
Arithmetic harmonic analysis for smooth quartic Weyl sums: three additive equations
本文在秩条件下，利用光滑四次Weyl和的算术调和分析及第十矩新估计，证明了32个以上变量中三个对角四次方程组的非奇异Hasse原理。
For a finite set $A$ of size $n$, an ordering is an injection from $\{1,2,\ldots,n\}$ to $A$. We present results concerning the asymptotic properties of the length $L_n$ of the longest arithmetic subsequence in a random ordering of an additive set $A$. In the torsion-free case where $A = [1,n]^d\subseteq {\bf Z}^d$, we prove that $L_n\sim 2d\log n/\log\log n$. We show that the case $A = {\bf Z}/n{\bf Z}$ behaves asymptotically like the torsion-free case with $d=1$, and then use this fact to compute the expected length of the longest arithmetic subsequence in a random ordering of an arbitrary f…
A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$ and for families of structured sets called chains. In this paper we extend the formula to sets of every dimension and prove it for sets composed of three segments, giving structural results for the extremal case. A weaker extension to sets composed of a bounded number of segments is also discussed.
We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain classes of additive arithmetic functions. In particular, we consider the generalized omega function $Ω_{\ell}(n)= \sum_{p^ν\mid\mid n} ν^{\ell}$ investigated by Duncan (1962) and Hassani (2018), and the functions $A(n)=\sum_{p^ν\mid\mid n} νp$, $A^*(n)= \sum_{p \mid n} p$, $B(n)=A(n)-A^*(n)$ studied by Alladi and Erdős (1977). As a key auxiliary result we use an …
We consider very general "random integers" and (attempt to) prove that many multiplicative and additive functions of such integers have limiting distributions. These integers include, for instance, the curvatures of Apollonian circle packings, trace of Frobenius elements for elliptic curves, the Ramanujan tau-function, Mersenne numbers, and many others.
On additive convolution sum of arithmetic functions and related questions
本文扩展Ingham的结果，推导出加法卷积和的渐近公式，并研究了具有绝对收敛拉马努金展开的算术函数的卷积和。
On Some Additive Properties of Multiplicative Subsemigroups of Semirings and Arithmetic Applications I
本文研究半环中乘法子半群及其生成子集的保和问题，开发保和收缩的初等坍缩过程，并将其应用于非负整数半环上的加性数论经典问题，以更简明的方式给出新证明。
Dynamics on the number of prime divisors for additive arithmetic semigroups
本文在有限域算术半群中推广了Bergelson和Richter的定理，并探讨了整数最大素因子分布的动态性质。
We define the arithmetic self-similarity (AS) of a one-sided infinite sequence sigma to be the set of arithmetic progressions through sigma which are a vertical shift of sigma. We study the AS of several famlies of sequences, viz. completely additive sequences, Toeplitz words and Keane's generalized Morse sequences. We give a complete characterization of the AS of completely additive sequences, and classify the set of single-gap Toeplitz patterns that yield completely additive Toeplitz words. We show that every arithmetic subsequence of a Toeplitz word generated by a one-gap pattern is again a…
Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.
On additive complement with special structures
本文研究自然数集加法补集的各种特殊结构，包括不相交、无限等差数列并集及给定密度情形，并应用于等差与等比数列之和集，同时构造满足密度条件的补集。
Summation arithmetic functions with asymptotically independent terms are studied in the paper, the limit of which is the law of normal distribution. Assertions about the asymptotic behavior of the indicated functions are proved.
We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.
The paper considers the properties of pseudo stationarity in a broad sense and pseudo strong mixing for sequences of random variables corresponding to arithmetic functions. Assertions on this topic have been proven. The implementation of these properties for known arithmetic functions has been verified. The article proves a statement about sufficient conditions under which a summation arithmetic function with bounded terms has a limit normal distribution law. The fulfillment of the specified sufficient conditions for known arithmetic functions is considered.
Additive functionals of Harmonic samples: the conditioned Dickman regime
研究调和分布下可加算术函数的分布行为，发现其经适当标准化后收敛到条件Dick曼型泊松积分，与均匀采样下的高斯极限形成对比。
In this paper, for coprime numbers p and q we consider the well known Dedekind sums S(p,q) First, we give an improvement of the proof given by H. Rademacher and A. Whiteman, and we construct a new arithmetical proof for the reciprocity law
In this work we present some arithmetic properties of families of abelian $p$--extensions of global function fields, among which are their generators and their type of ramification and decomposition.
When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of perfect squares and associated sumsets. We reveal how arithmetic progressions efficiently reduce the cardinality of sumsets and provide estimates for the minimum size, taking advantage of the additive structure that arithmetic progressions provide. We then generalise the problem to arbitrary rings and achieve satisfactory estimates for the case of squares in…
Multiplicative Subgroups of $\mathbb{Z}_p^*$ that are Generalized Arithmetic Progressions
本文证明了$\mathbb{Z}_p^*$中乘法子群为广义算术进展的充要条件，并推广了Hanson和Petridis的结果。
Finite field models in arithmetic combinatorics -- twenty years on
本文是为2024年英国组合数学会议报告撰写的综述，梳理了Green首篇有限域加法组合学综述发表二十年来、尤其Wolf后续综述发布后十年间该领域在有限域与整数场景下的核心进展，并指明未来方向。
Friable averages of complex arithmetic functions
本文研究其狄利克雷级数接近ζ函数复数幂的算术函数的脆性均值，获得类似Selberg-Delange方法的渐近展开，并应用于素因子计数函数的脆性分布。
We extend two well-known results in additive number theory, Sárközy's theorem on square differences in dense sets and a theorem of Green on long arithmetic progressions in sumsets, to subsets of random sets of asymptotic density 0. Our proofs rely on a restriction-type Fourier analytic argument of Green and Green-Tao.
We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical correlations; a theorem of Erd{\H o}s-Wintner type with support equal to the level set of an additive function at shifted argument; and a law of iterated logarithm for the distribution of prime factors of integers weighted by $τ(n-1)$ where $τ$ denotes the divisor function.
We present a new perspective of assessing the rates of convergence to the Gaussian and Poisson distributions in the Erdös-Kac theorem for additive arithmetic functions $ψ$ of a random integer $J_n$ uniformly distributed over $\{1,...,n\}$. Our approach is probabilistic, working directly on spaces of random variables without any use of Fourier analytic methods, and our $ψ$ is more general than those considered in the literature. Our main results are (i) bounds on the Kolmogorov distance and Wasserstein distance between the distribution of the normalized $ψ(J_n)$ and the standard Gaussian distri…
We prove that the central values of additive twists of a cuspidal $L$-function define a quantum modular form in the sense of Zagier, generalizing recent results of Bettin and Drappeau. From this we deduce a reciprocity law for the twisted first moment of multiplicative twists of cuspidal $L$-functions, similar to reciprocity laws discovered by Conrey for the twisted second moment of Dirichlet $L$-functions. Furthermore we give an interpretation of quantum modularity at infinity for additive twists of $L$-functions of weight 2 cusp forms in terms of the corresponding functional equations.
For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier research dealing with the case of infinite $k$.
We investigate the properties of arithmetic differentiation, an attempt to adapt the notion of differentiation to the integers by preserving the Leibniz rule, (ab)' = a'b + ab'. This has proved to be a very rich topic with many different aspects and implications to other fields of mathematics and specifically to various unproven conjectures in additive prime number theory. Our paper consists of a self-contaited introduction to the topic, along with a couple of new theorems, several of them related to arithmetic differentiation of rational numbers, a topic almost unexplored until now.
We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are fixed. Our results relate the parameter $A$ to the lengths of arithmetic progressions in which $d_k(n)$ is uniformly distributed. As applications to additive divisor sums, we establish new lower bounds and a new equivalent condition for the conjectured asymptotic. We also prove a Tauberian theorem for general additive divisor sums.
Diversity, equity, and inclusion for problems in additive number theory
本文探讨加法数论中较少关注的问题，强调其在加法经典成果中的重要性，尤其关注有限整数集的和集大小及和集交集的算术结构问题。
On sums of Fourier coefficients of cusp forms twisted with additive characters
本文针对全纯尖形式傅里叶系数与加性特征相扭的指数和，证明了多种 Omega 结果，并将其应用于 Ramanujan τ 函数及算术级数上的系数求和问题。
We define certain arithmetic derivatives on $\mathbb{Z}$ that respect the Leibniz rule, are additive for a chosen equation $a+b=c$, and satisfy a suitable non-degeneracy condition. Using Geometry of Numbers, we unconditionally show their existence with controlled size. We prove that any power-saving improvement on our size bounds would give a version of the $abc$ Conjecture. In fact, we show that the existence of sufficiently small arithmetic derivatives in our sense is equivalent to the $abc$ Conjecture. Our results give an explicit manifestation of an analogy suggested by Vojta in the eighti…
It is well-known that sequences such as the Fibonacci numbers and the factorials satisfy Benford's Law, that is, leading digits in these sequences occur with frequencies given by $P(d)=\log_{10}(1+1/d)$, $d=1,2,\dots,9$. In this paper, we investigate leading digit distributions of arithmetic sequences from a local point of view. We call a sequence locally Benford distributed of order $k$ if, roughly speaking, $k$-tuples of consecutive leading digits behave like $k$ independent Benford-distributed digits. This notion refines that of a Benford distributed sequence, and it provides a way to quant…
In an earlier paper, we studied solutions g to convolution equations of the form a_d*g^{*d}+a_{d-1}*g^{*(d-1)}+...+a_1*g+a_0=0, where a_0, ..., a_d are given arithmetic functions associated with Dirichlet series which converge on some right half plane, and also g is required to be such a function. In this article, we extend our previous results to multidimensional general Dirichlet series of the form \sum_{x\in X} f(x) e^{-sx} (s in C^k), where X is an additive subsemigroup of [0,\infty)^k. If X is discrete and a certain solvability criterion is satisfied, we determine solutions by an elementa…
Additive twists are important invariants associated to holomorphic cusp forms; they encode the Eichler--Shimura isomorphism and contain information about automorphic $L$-functions. In this paper we prove that central values of additive twists of the $L$-function associated to a holomorphic cusp form $f$ of even weight $k$ are asymptotically normally distributed. This generalizes (to $k\geq 4$) a recent breakthrough of Petridis and Risager concerning the arithmetic distribution of modular symbols. Furthermore we give as an application an asymptotic formula for the averages of certain 'wide' fam…
In this article we study the notion of essential subset of an additive basis, that is to say the minimal finite subsets $P$ of a basis $A$ such that $A \setminus P$ doesn't remains a basis. The existence of an essential subset for a basis is equivalent for this basis to be included, for almost all elements, in an arithmetic non-trivial progression. We show that for every basis $A$ there exists an arithmetic progression with a biggest common difference containing $A$. Having this common difference $a$ we are able to give an upper bound to the number of essential subsets of $A$: this is the radi…
We establish the reciprocity law along a vertical curve for residues of differential forms on arithmetic surfaces, and describe Grothendieck's trace map of the surface as a sum of residues. Points at infinity are then incorporated into the theory and the reciprocity law is extended to all curves on the surface. Applications to adelic duality for the arithmetic surface are discussed.
We define $\overlineψ$ to be the multiplicative arithemtic function that satisfies \[\overlineψ(p^α)=\begin{cases} p^{α-1}(p+1), & \mbox{if } p\neq 2; \\ p^{α-1}, & \mbox{if } p=2 \end{cases}\] for all primes $p$ and positive integers $α$. Let $λ(n)$ be the number of iterations of the function $\overlineψ$ needed for $n$ to reach $2$. It follows from a theorem due to White that $λ$ is additive. Following Shapiro's work on the iterated $φ$ function, we determine bounds for $λ$. We also use the function $λ$ to partition the set of positive integers into three sets $S_1,S_2,S_3$ and determine som…
Khinchin proved that the arithmetic mean of continued fraction digits of Lebesgue almost every irrational number in $(0,1)$ diverges to infinity. Hence, none of the classical limit theorems such as the weak and strong laws of large numbers or central limit theorems hold. Nevertheless, we prove the existence of a large deviations rate function which estimates exponential probabilities with which the arithmetic mean of digits stays away from infinity.
Counting the number of inequivalent arithmetic expressions on $n$ variables
本文提出了一种时间复杂度为Θ(n²)的算法，用于计算n个不同变量上不等价的算术表达式的数量。
On the Weakly Prime-Additive Numbers with Length 4
本文在广义黎曼假设下证明了对任意正整数m，存在无穷多个能被m整除的长度为4的弱素数可加数，并给出了一个与长度为3情形类似的相关结果。
Arithmetic of cubic number fields: Jacobi-Perron, Pythagoras, and indecomposables
本文建立 Jacobi–Perron 等多维连分数与全实三次数域加法不可分解整数的联系，刻画 Ennola 族不可分解元与 Pythagoras 数，并计算比较 Shanks 族中的周期 JPA 展开。
Orders and partitions of integers induced by arithmetic functions
本文研究整数按除数性质排序或划分的方法，基于整数上的伪度量探讨诱导的预序关系、等价关系及商集，分析算术函数生成的伪度量及其在整数除数性质中的应用。
The celebrated Erdős--Kac theorem says, roughly speaking, that the values of additive functions satisfying certain mild hypotheses are normally distributed. In the intervening years, similar normal distribution laws have been shown to hold for certain non-additive functions and for amenable arithmetic functions over certain subsets of the natural numbers. Continuing in this vein, we show that if $g_1(n), \ldots, g_k(n)$ is a collection of functions satisfying certain mild hypotheses for which an Erdős--Kac-type normal distribution law holds, and if $Q(x_1, \ldots, x_k)$ is a polynomial with no…
We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-Sárközy theorem on squares in sets of integers with positive density, and the study of triangles (also called $2$-simplices) in finite fields. Among other results we show that if $\mathbb{F}_q$ is the finite field of odd order $q$, then every matrix in $Mat_d(\mathbb{F}_q), d \geq 2$ is the sum of a certain (finite) number of orthogonal matrices, this number depending only on $d$, the size of the matrix…
This paper is a continuation of our previous work on double Dirichlet series associated with arithmetic functions such as the von Mangoldt function, the Möbius function, and so on. We consider the analytic behaviour around the non-positive integer points on singularity sets which are points of indeterminacy. In particular, we show a certain reciprocity law of their residues. Also on this occasion we correct some inaccuracies in our previous paper.
In this paper, we confirm a smoothed version of a recent conjecture on the variance of the k-fold divisor function in arithmetic progressions to individual composite moduli, in a restricted range. In contrast to a previous result of Rodgers and Soundararajan, we do not require averaging over the moduli. Our proof adapts a technique of S. Lester who treated in the same range the variance of the k-fold divisor function in the short intervals setting, and is based on a smoothed Voronoi summation formula but twisted by multiplicative characters. The use of Dirichlet characters allows us to extend …
A binary mean operation m(x,y) is said to be compatible with a semigroup law *, if * satisfies the Gauss' functional equation m(x,y) * m(x,y) = x * y for all x, y. Thus the arithmetic mean is compatible with the group addition in the set of real numbers, while the geometric mean is compatible with the group multiplication in the set of all positive real numbers. Using one of Jacobi's theta functions, Tanimoto has constructed a novel binary operation * corresponding to the arithmetic-geometric mean agm(x,y) of Gauss. Tanimoto shows that it is only a loop operation, but not associative. A natura…
A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise naturally in the study of matrices with symmetry properties and consecutive integer entries. Sum systems are an analogous concept where only sums of elements are considered. We establish a bijection between sum systems and sum-and-distance systems of corresponding size, and show that sum systems are equivalent to principal reversible cuboids, which are tensors…
Arithmetic Branching Law and generic $L$-packets
本文将局部下降谱分解研究从非阿基米德特殊正交群推广到任意局部域上的经典群，引入谱与算术首次出现指标并证明其相等，进而利用增强 $L$-参数连续下降理论确定首次下降谱由离散序列表示构成，从而明确解决分支分解问题。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。