arXiv 0907.09182009-07math.NT

On the random variable $\N \ni l \mapsto \gcd(l,n_1) \gcd(l, n_2) ... \gcd(l, n_k) \in \N$

Norihiko Minami

备注：: 11 pages; new sections added

英文摘要：

We compute the "moments" and its continuous analogue of the random variable $\N \ni l \mapsto \gcd(l,n_1) \gcd(l, n_2) ... \gcd(l, n_k) \in \N$ by a purely elementary method. This generalizes a result of Deitmar-Koyama-Kurokawa, which computed its "average" using some analysis involving L-function. We show this average is nothing but the invariant $μ(A) := \sum_{a\in A} \frac{1}{| a |}$ for a finite abelian group $A = \prod_{j=1)^k Z/n_j$. In ArXiv-0910.3879v1, this invariant plays an important role in the Soulé type zeta functions for Noetherian $F_1$-schemes in the sense of Connes-Consani.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On the random variable $\N^r \ni (k_1, k_2, ..., k_r) \mapsto \gcd(n,k_1k_2... k_r) \in \N$

We compute the "moments" and its continuous anaougue of the random variable $\N^r \ni (k_1, k_2, ..., k_r) \mapsto \gcd(n,k_1k_2... k_r) \in \N$ by a purely elementary method. This generalizes a result of Kurokawa-Ochiai, which computed its "average" using some analysis involving L-function.

2009-07-06math.NT

Coprime values of polynomials in several variables

Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points $\underline n$ being coprime? We show that the set of all $\gcd (P(\underline n), Q(\underline n))$ is stable under gcd and under lcm. A notable consequence is a result of Schinzel: if in addition $P$ and $Q$ have no fixed prime divisor (i.e., no prime dividing all values $P(\underline n)$, $Q(\underline n)$), then $P$ and $Q$ assume coprime values at "many" inte…

2022-09-29math.NT

整数系数多项式最大公因式的一种新稀疏算法

A New Sparse Algorithm for Polynomial GCD over Integers

Shandong University（山东大学）；Simon Fraser University（西蒙菲莎大学）

本文提出一种新的稀疏算法，通过新变量替换将多元整数多项式GCD归约为单个单变量GCD，位复杂度为多项式级，在Maple中实现，对高次多变量但GCD项数少的多项式高效。

2026-09-11math.ACmath.NT

计数使得若干$k$元多项式的值互素的正整数$k$元组

Counting $k$-tuples of positive integers such that the values of several polynomials of $k$ variables are relatively prime

本文针对满足一般性质的多项式系统，建立了关于其最大公因数函数的有界强乘性函数和的渐近公式，并由此推导出$k$元组互素密度的Ekedahl-Poonen公式的误差项版本。

2026-09-24math.NT

关于满足 $\gcd(ab,a+b)=\gcd(a,b)$ 的正整数有序对 $(a,b)$ 的渐近密度

On the asymptotic density of the ordered pairs $(a,b)$ of positive integers such that $\gcd(ab,a+b)=\gcd(a,b)$

研究二元算术函数 $f(a,b)=\gcd(ab,a+b)/\gcd(a,b)$，推导了形如 $\sum_{a,b\le x} h(f(a,b))$ 的和的渐近公式，特别得到了满足 $f(a,b)=m$ 的有序对数量的渐近公式，其中 $m=1$ 时密度为二次类数常数 $C$。

2026-08-26math.NT

On some generalizations of mean value theorems for arithmetic functions of two variables

Let $f: \mathbb{N}^2 \mapsto \mathbb{C}$ be an arithmetic function of two variables. We study the existence of the limit: \[\displaystyle \lim_{x \to \infty} \frac{1}{x^2 (\log x)^{k-1}} \sum_{n_1 , n_2 \le x} f (n_1, n_2) \] where $k$ is a fixed positive integer. Moreover, we express this limit as an infinite product over all prime numbers in the case that $f$ is a multiplicative function of two variables. This study is a generalization of Cohen-van der Corput's results to the case of two variables.

2016-04-19math.NT

更多相关论文收起更多论文

Hypertranscendence and linear difference equations

After Hölder proved his classical theorem about the Gamma function, there has been a whole bunch of results showing that solutions to linear difference equations tend to be hypertranscendental i.e. they cannot be solution to an algebraic differential equation). In this paper, we obtain the first complete results for solutions to general linear difference equations associated with the shift operator $x\mapsto x+h$ ($h\in\mathbb{C}^*$), the $q$-difference operator $x\mapsto qx$ ($q\in\mathbb{C}^*$ not a root of unity), and the Mahler operator $x\mapsto x^p$ ($p\geq 2$ integer). The only restrict…

2020-03-09math.ACmath.NT

关于三变量 Frobenius 硬币问题

On the Frobenius Coin Problem in Three Variables

University of Tehran（德黑兰大学）；Sharif University of Technology（谢里夫理工大学）

本文提出基于同步欧几里得除法序列的算法求解三变量Frobenius硬币问题，复杂度为Θ(log a1)，并给出常数开销归约及Frobenius数上界。

2026-09-09math.COmath.NT

三项变量的快速计数算法

A Fast Algorithm for Denumerants with Three Variables

School of Mathematical Sciences,Capital Normal University（首都师范大学数学科学学院）

本文提出一种计算三项变量方程非负整数解数量的高效算法，时间复杂度为O(log b)。

2024-06-27math.COmath.NT

Weighted Sylvester sums on the Frobenius set in more variables

Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Let ${\rm NR}={\rm NR}(a_1,a_2,\dots,a_k)$ denote the set of positive integers nonrepresentable in terms of $a_1,a_2,\dots,a_k$. The largest nonrepresentable integer $\max{\rm NR}$, the number of nonrepresentable positive integers $\sum_{n\in{\rm NR}}1$ and the sum of nonrepresentable positive integers $\sum_{n\in{\rm NR}}n$ have been widely studied for a long time as related to the famous Frobenius problem. In this paper by using Eulerian numbers, we give formulas for the weighted sum $\sum_{n\in{\rm NR}}λ^{n}n^μ$,…

2021-09-29math.COmath.NT

Multiplicative Arithmetic Functions of Several Variables: A Survey

We survey general properties of multiplicative arithmetic functions of several variables and related convolutions, including the Dirichlet convolution and the unitary convolution. We introduce and investigate a new convolution, called gcd convolution. We define and study the convolutes of arithmetic functions of several variables, according to the different types of convolutions. We discuss the multiple Dirichlet series and Bell series and present certain arithmetic and asymptotic results of some special multiplicative functions arising from problems in number theory, group theory and combinat…

2014-11-19math.COmath.GRmath.NT

On the value distribution of the Epstein zeta function in the critical strip

We study the value distribution of the Epstein zeta function $E_n(L,s)$ for $0<s<\frac{n}{2}$ and a random lattice $L$ of large dimension $n$. For any fixed $c\in(1/4,1/2)$ and $n\to\infty$, we prove that the random variable $V_n^{-2c}E_n(\cdot,cn)$ has a limit distribution, which we give explicitly (here $V_n$ is the volume of the $n$-dimensional unit ball). More generally, for any fixed $\ve>0$ we determine the limit distribution of the random function $c\mapsto V_n^{-2c}E_n(\cdot,cn)$, $c\in[1/4 +\ve, 1/2-\ve]$. After compensating for the pole at $c=\frac12$ we even obtain a limit result on…

2011-05-13math.NT