We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn limits of certain symmetric positive $3\times 3$ matrices are computed, and related problems in diophantine approximation are considered.
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…
We present an evolutionary self-governing model based on the numerical atomic rule $Z(a,b)=ab/\gcd(a,b)^2$, for $a,b$ positive integers. Starting with a sequence of numbers, the initial generation $Gin$, a new sequence is obtained by applying the $Z$-rule to any neighbor terms. Likewise, applying repeatedly the same procedure to the newest generation, an entire matrix $T_{Gin}$ is generated. Most often, this matrix, which is the recorder of the whole process, shows a fractal aspect and has intriguing properties. If $Gin$ is the sequence of positive integers, in the associated matrix remarkable…
We consider relations between the pairs of sequences, $(f, g_f)$, generated by the Lambert series expansions, $L_f(q) = \sum_{n \geq 1} f(n) q^n / (1-q^n)$, in $q$. In particular, we prove new forms of recurrence relations and matrix equations defining these sequences for all $n \in \mathbb{Z}^{+}$. The key ingredient to the proof of these results is given by the statement of Euler's pentagonal number theorem expanding the series for the infinite $q$-Pochhammer product, $(q; q)_{\infty}$, and for the first $n$ terms of the partial products, $(q; q)_n$, forming the denominators of the rational …
We summarize the known useful and interesting results and formulas we have discovered so far in this collaborative article summarizing results from two related articles by Merca and Schmidt arriving at related so-termed Lambert series factorization theorems. We unify the matrix representations that underlie two of our separate papers, and which commonly arise in identities involving partition functions and other functions generated by Lambert series. We provide a number of properties and conjectures related to the inverse matrix entries defined in Schmidt's article and the Euler partition func…
We study the variance of sums of the indicator function of square-full polynomials in both arithmetic progressions and short intervals. Our work is in the context of the ring $F_{q}[T]$ of polynomials over a finite field $F_{q}$ of $q$ elements, in the limit $q\rightarrow\infty$. We use a recent equidistribution result due to N. Katz to express these variances in terms of triple matrix integrals over the unitary group, and evaluate them.
Arithmetic functions in Number Theory meet the Sprague-Grundy function from Combinatorial Game Theory. We study a variety of 2-player games induced by standard arithmetic functions, such as Euclidian division, divisors, remainders and relatively prime numbers, and their negations.
We compute the variances of sums in arithmetic progressions of arithmetic functions associated with certain $L$-functions of degree two and higher in $\mathbb{F}_q[t]$, in the limit as $q\to\infty$. This is achieved by establishing appropriate equidistribution results for the associated Frobenius conjugacy classes. The variances are thus related to matrix integrals, which may be evaluated. Our results differ significantly from those that hold in the case of degree-one $L$-functions (i.e. situations considered previously using this approach). They correspond to expressions found recently in the…
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion of numbers fields, we obtain explicit formulas for these matrices and discuss their generalization. These results are useful in proving statements about the particular number fields they work in. We give a meaningful diagonalization that is helpful in this regard and can be used to define such matrices in general. The matrix identities provided suggest that c…
Let $S=\{x_1,x_2,\dots,x_n\}$ be a set of distinct positive integers, and let $f$ be an arithmetical function. The GCD matrix $(S)_f$ on $S$ associated with $f$ is defined as the $n\times n$ matrix having $f$ evaluated at the greatest common divisor of $x_i$ and $x_j$ as its $ij$ entry. The LCM matrix $[S]_f$ is defined similarly. We consider inertia, positive definiteness and $\ell_p$ norm of GCD and LCM matrices and their unitary analogs. Proofs are based on matrix factorizations and convolutions of arithmetical functions.
The summation arithmetic functions with asymptotically independent summands are studied in the paper. We prove statements about the condition under which the summation arithmetic functions have asymptotically independent summands. It is also prove that the limiting distribution of the summation arithmetic function with asymptotically independent summands is normal under certain conditions for summands of the summation arithmetic function.
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…
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.
We obtain asymptotic results for well known summatory arithmetic functions, such as $ψ(x),$ and establish connections to new summatory functions. A new Volterra integral equation is offered, which is solved by summatory arithmetic functions. We conclude with some further integral formulas and provide number theoretic formulas as applications.
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 study Ramanujan-Fourier series of certain arithmetic functions of two variables. We generalize Delange's theorem to the case of arithmetic functions of two variables and give sufficient conditions for pointwise convergence of Ramanujan-Fourier series of arithmetic functions of two variables. We also give several examples which are not obtained by trivial generalizations of results on Ramanujan-Fourier series of functions of one variable.
We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.
We generalize certain recent results of Ushiroya concerning Ramanujan expansions of arithmetic functions of two variables. We also show that some properties on expansions of arithmetic functions of one and several variables using classical and unitary Ramanujan sums, respectively, run parallel.
The paper compares probabilistic and exact methods for estimating the asymptotic behavior of summation arithmetic functions, and estimates of the results are obtained by precise methods. Conditions for stationarity in the broad sense are investigated for summation arithmetic functions. A lemma and theorems about the estimation of the standard deviation for the summation arithmetic Mertens and Lowville functions completely satisfying the stationarity conditions in the broad sense are proved.
In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed number of zeros and poles.
We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.
Using estimates on Hooley's $Δ$-function and a short interval version of the celebrated Dirichlet hyperbola principle, we derive an asymptotic formula for a class of arithmetic functions over short segments. Numerous examples are also given.
Let $K$ be a number field. This paper considers arithmetic functions over $K$, that are, complex valued functions on the set of nonzero integral ideals in $K$. Firstly we generalize some basic results on arithmetic functions. Next we define the generalized Ramanujan sums over $K$ and show some properties.
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.
This paper provides a mean value theorem for arithmetic functions $f$ defined by $$f(n)=\prod_{d|n}g(d),$$ where $g$ is an arithmetic function taking values in $(0, 1]$ and satisfying some generic conditions. As an application of our main result, we prove that the density $μ_q(n)$ (resp. $ρ_q(n)$) of normal (resp. primitive) elements in the finite field extension $\mathbb{F}_{q^n}$ of $\mathbb{F}_q$ are arithmetic functions of (non zero) mean values.
We consider double Dirichlet series associated with arithmetic functions such as the von Mangoldt function, the Möbius function, and so on. We show analytic continuations of them by use of the Mellin-Barnes integral. Furthermore we observe their reverse values at non-positive integer points.
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 obtain an asymptotic formula for the second discrete moment of the Riemann zeta function over the arithmetic progression $\frac{1}{2} + in$. It shows that the first main term is equal to that of the continuous mean value.
In this paper, we shall establish a rather general asymptotic formula in short intervals for a classe of arithmetic functions and announce two applications about the distribution of divisors of square-full numbers and integers representable as sums of two squares.
The paper deals with lower bounds for the remainder term in asymptotics for a certain class of arithmetic functions. Typically, these are generated by a Dirichlet series which involves a product of Riemann zeta-functions of a special form.
The aim of the paper is to study the limit distributions and the asymptotic behavior of summation arithmetic functions. A probabilistic approach based on the use of the axioms of probability theory is used for these purposes. Sufficient conditions are proved under which these functions have a limiting normal distribution. Arithmetic functions having a limiting normal distribution are found in the paper. The author investigates summation functions of a general form and finds sufficient conditions under which they have a limiting normal distribution. Examples of arithmetic functions that satisfy…
A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as large as possible. We study this problem in the function field setting, and prove for a wide class of arithmetic functions (namely factorization functions), that such an asymptotic result holds, allowing the size of the short interval to be as small as a square-root of the size of the full interval, and analogously for arithmetic progressions. For instance, …
We show that smooth-supported multiplicative functions $f$ are well-distributed in arithmetic progressions $a_1a_2^{-1} \pmod q$ on average over moduli $q\leq x^{3/5-\varepsilon}$ with $(q,a_1a_2)=1$.
By using the $q$-analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus $q$. We show that the expected asymptotic formula holds for a larger range of $q$ than was previously known, provided that $q$ has a certain factorisation.
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.
Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of integers that appear as an arithmetic subsequence of $s_2$ has full complexity.