Antal Bege
Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider the generalization of this matrix where the elements are in the form $f\big(i,(i,j)\big)$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we consider the divisibility problem of LCM matrices by GCD matrices in the ring $M_n(\mathbb{Z})$ proposed by Hong in 2002 and in particular a conjecture concerning the divisibility problem raised by Zhao in 2014. We present some certain gcd-closed sets on which the LCM matrix is not divisible by the GCD matrix in the ring $M_n(\mathbb{Z})$. This could be the first theoretical evidence that Zhao's conjecture might be true. Furthermore, we give the necessary and sufficient conditions on the gcd-closed set $S$ with $|S|\leq 8$ such that the GCD matrix divides the LCM matrix in th…
In this paper, we study the eigenvalues of the GCD matrix $(S_n)$ and the LCM matrix $[S_n]$ defined on $S_n=\{1,2,\ldots,n\}$. We present upper and lower bounds for the smallest and the largest eigenvalues of $(S_n)$ and $[S_n]$ in terms of particular arithmetical functions.
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.
For integers $x$ and $y$, $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of $x$ and $y$ respectively. Denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive integers and let $S=\{x_1, \cdots, x_n\}$ be a set of $n$ distinct positive integers. We denote by $(S^a)$ (resp. $[S^a]$) the $n\times n$ matrix having the $a$th power of $(x_i,x_j)$ (resp. $[x_i,x_j]$) as its $(i,j)$-entry. For any $x\in S$, define $G_{S}(x):=\{d\in S: d<x, d|x \ {\rm and} \ (d|y|x, y\in S) \Rightarrow y\in \{d,x\}\}$. In this paper, we show th…
Gcd-closed sets and divisibility among power GCD matrices and power LCM matrices
本文证明了Hong猜想，即在满足特定条件的gcd闭集上，幂GCD矩阵和幂LCM矩阵在a|b时能被幂GCD矩阵整除。
On generalized eigenvalues of MAX matrices to MIN matrices and of LCM matrices to GCD matrices
本文研究了MAX矩阵到MIN矩阵以及LCM矩阵到GCD矩阵的广义特征值问题，证明了相关定理并提出新的猜想。
We study the distribution of the generalized gcd and lcm functions on average. The generalized gcd function, denoted by $(m,n)_b$, is the largest $b$-th power divisor common to $m$ and $n$. Likewise, the generalized lcm function, denoted by $[m,n]_b$, is the smallest $b$-th power multiple common to $m$ and $n$. We derive asymptotic formulas for the average order of the arithmetic, geometric, and harmonic means of $(m,n)_b$. Additionally, we also deduce asymptotic formulas with error terms for the means of $(n_1,n_2,\cdots, n_k)_b$, and $[n_1,n_2,\cdots, n_k]_b$ over a set of lattice points, th…
Let $X = (x_1,\dots,x_n)$ be a vector of distinct positive integers. The $n \times n$ matrix $S = S(X) := (\gcd(x_i,x_j))_{i,j=1}^n$, where $\gcd(x_i,x_j)$ denotes the greatest common divisor of $x_i$ and $x_j$, is called the greatest common divisor (GCD) matrix on $X$. By a surprising result of Beslin and Ligh [Linear Algebra and Appl. 118], all GCD matrices are positive definite. In this paper, we completely characterize the GCD matrices satisfying the stronger property of being totally nonnegative (TN) or totally positive (TP). As we show, a GCD matrix is never TP when $n \geq 3$, and is TN…
We establish a connection between the $L^2$ norm of sums of dilated functions whose $j$th Fourier coefficients are $\mathcal{O}(j^{-α})$ for some $α\in (1/2,1)$, and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in $L^2$ and for the almost everywhere convergence of series of dilated functions.
Divisibility among power GCD and power LCM matrices on certain gcd-closed sets
本文研究gcd闭集上幂GCD与幂LCM矩阵的整除性，证明满足特定条件时三类整除关系成立，还找到不满足该条件仍成立的集合，推广了已有定理并部分证实相关猜想。
In 2021, Guyer and Mbirika gave two equivalent formulas that computed the greatest common divisor (GCD) of all sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In this current paper, we extend their results to the GCD of all sums of $k$ consecutive squares of these numbers. Denoting these GCD values by the symbol $\mathcal{G}_{G_0, G_1}^2\!(k)$, we prove $\mathcal{G}_{G_0, G_1}^2\!(k) = \gcd\left(G_k G_{k+1} - G_0 G_1,\; G_{k+1}…
We explore the sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In particular, we give precise values for the greatest common divisor (GCD) of all sums of $k$ consecutive terms of $\left(G_n\right)_{n \geq 0}$. When $G_0 = 0$ and $G_1 = 1$, we yield the GCD of all sums of $k$ consecutive Fibonacci numbers, and when $G_0 = 2$ and $G_1 = 1$, we yield the GCD of all sums of $k$ consecutive Lucas numbers. Denoting the GCD of all sum…
Gcd-closed sets and divisibility among power LCM matrices
研究gcd-封闭集S上幂LCM矩阵之间的整除性，证明当S满足条件G时，若a|b则[S^a]整除[S^b]，证实了Hong的猜想。
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…
Assume Vojta's Conjecture. Suppose $a, b, α,β\in \mathbb{Z}$, and $f(x),g(x) \in \mathbb{Z}[x]$ are polynomials of degree $d \ge 2$. Assume that the sequence $(f^{\circ n}(a), g^{\circ n}(b))_n$ is generic and $α,β$ are not exceptional for $f,g$ respectively, we prove that for each given $\varepsilon > 0$, there exists constant $C = C(\varepsilon,a,b,α,β,f,g)>0$, such that for all $n \ge 1$, we have $$\gcd(f^{\circ n}(a)-α, g^{\circ n}(b) -β) \le C\cdot\exp({\varepsilon\cdot d^n}). $$ We prove an estimate for rational functions and for a more general gcd and then obtain the above inequality as…
In this paper we consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c$ in nonnegative integers $x, y$ and integers $u, v \in \{0,1\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$. We show that $N \le 2$ when $\gcd(ra, sb) =1$ and $\min(x,y)>0$, except for a finite number of cases that can be found in a finite number of steps. For arbitrary $\gcd(ra, sb)$ and $\min(x,y) \ge 0$, we show that when $(u,v) = (0,1)$ we have $N \le 3$, with an infinite number of cases for which N=3.
In this article we give bounds for the eigenvalues of a matrix, which can be seen as a common generalization of meet and join matrices and therefore also as a generalization of both GCD and LCM matrices. Although there are some results concerning the factorizations, the determinant and the inverse of this so-called combined meet and join matrix, the eigenvalues of this matrix have not been studied earlier. Finally we also give a nontrivial lower bound for a certain constant $c_n$, which is needed in calculating the above-mentioned eigenvalue bounds in practice. So far there are no such lower b…
In 1876 H. J. S. Smith defined an LCM matrix as follows: let S = {x_1, x_2, ..., x_n} be a set of positive integers. The LCM matrix [S] is the n $\times$ n matrix with lcm(x_i , x_j) as its ij entry. During the last 30 years singularity of LCM matrices has interested many authors. In 1992 Bourque and Ligh ended up conjecturing that if the GCD closedness of the set S (which means that gcd(x_i, x_j) $\in$ S for all i, j $\in$ {1, 2, . . . , n}), suffices to guarantee the invertibility of the matrix [S]. However, a few years later this conjecture was proven false first by Haukkanen et al. and the…
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 …
Upper bounds for GCD sums of the form [\sum_{k,{\ell}=1}^N\frac{(\gcd(n_k,n_{\ell}))^{2α}}{(n_k n_{\ell})^α}] are proved, where $(n_k)_{1 \leq k \leq N}$ is any sequence of distinct positive integers and $0<α\le 1$; the estimate for $α=1/2$ solves in particular a problem of Dyer and Harman from 1986, and the estimates are optimal except possibly for $α=1/2$. The method of proof is based on identifying the sum as a certain Poisson integral on a polydisc; as a byproduct, estimates for the largest eigenvalues of the associated GCD matrices are also found. The bounds for such GCD sums are used to …
The $k$-dimensional generalized Euler function $φ_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$ and the sum $a_1+a_2+\cdots+a_k$ are co-prime to $n$. Tóth proved that the identity \begin{equation*} \sum_{\substack{a_1,a_2,\ldots, a_k=1 \\ \gcd(a_1a_2\cdots a_k,n)=1\\ \gcd(a_1+a_2+\cdots+a_k,n)=1}}^n \gcd(a_1+a_2+\cdots+a_k-1,n) =φ_k(n)σ_0(n), \;\; \text{ where } σ_s(n) = \sum_{d\mid n}d^s \;\; \text{ holds. } \end{equation*} This identity can also be viewed a…
We study generalized eigenvalue problems for meet and join matrices with respect to incidence functions on semilattices. We provide new bounds for generalized eigenvalues of meet matrices with respect to join matrices under very general assumptions. The applied methodology is flexible, and it is shown in the case of GCD and LCM matrices that even sharper bounds can be obtained by applying the known properties of the divisor lattice. These results can also be easily modified for the dual problem of eigenvalues of join matrices with respect to meet matrices, which we briefly consider as well. We…
Set of generalized Pascal matrices whose elements are generalized binomial coefficients is considered as an integral object. The special system of generalized Pascal matrices, based on which we are building fractal generalized Pascal matrices, is introduced. Pascal matrix (Pascal triangle) is the Hadamard product of the fractal generalized Pascal matrices. The concept of zero generalized Pascal matrices, an example of which is the Pascal triangle modulo 2, arise in connection with the system of matrices introduced.
Generalized Sierpiński and Riesel numbers of the form $tb^t+α$
本文证明对任意非零整数α，形如tb^t+α的数中存在无穷多个b-Sierpiński数和b-Riesel数，并在b+1非2的幂时存在无穷多个b-Brier数。
In this paper, firstly, we define the Generalized Tribonacci-Lucas numbers. In addition, by also defining circulant matrices C_{n}(G) and C_{n}(S) whose entries are Generalized Tribonacci and Generalized Tribonacci-Lucas numbers, we compute spectral norms and determinants of these matrices.
The generalized Riordan group consists of infinite lower triangular matrices that correspond to certain operators in the space of formal power series. Each such group contains the matrix (generalized Pascal matrix), elements of which are generalized binomial coefficients. Generalized Pascal matrices with non-negative elements form an infinite-dimensional vector space. The paper gives an idea of groups similar to the generalized Riordan groups, but associated with matrices, which in the space of generalized Pascal matrices correspond to the points at infinity; examples of such matrices are the …
Let $S=\{x_1,x_2,\ldots,x_n\}$ be a finite set of distinct positive integers. Throughout this article we assume that the set $S$ is GCD closed. The LCM matrix $[S]$ of the set $S$ is defined to be the $n\times n$ matrix with $\mathrm{lcm}(x_i,x_j)$ as its $ij$ element. The famous Bourque-Ligh conjecture used to state that the LCM matrix of a GCD closed set $S$ is always invertible, but currently it is a well-known fact that any nontrivial LCM matrix is indefinite and under the right circumstances it can be even singular (even if the set $S$ is assumed to be GCD closed). However, not much more …
The Normal Form of Smith's Matrices
本文研究Smith矩阵（GCD矩阵）的对角化，提出定理4.1和4.2，将整除性结果推广到满足条件$\mathcal{G}$的gcd封闭集。
For a fixed $b\in \mathbb{N}=\{1,2,3,\dots\}$, Goins et al. \cite{Harris} defined the concept of $b$-visibility for a lattice point $(r,s)$ in $L=\mathbb{N}\times \mathbb{N}$ which states that $(r,s)$ is $b$-visible from the origin if it lies on the graph of $f(x)=ax^b$, for some positive $a\in \mathbb{Q}$, and no other lattice point in $L$ lies on this graph between $(0,0)$ and $(r,s)$. Furthermore, to study the density of $b$-visible points in $L$ Goins et al. defined a generalization of greatest common divisor, denoted by $\gcd_b$, and proved that the proportion of $b$-visible lattice point…
Dynamical GCD Problems and a Variant of the Dynamical Mordell-Lang Conjecture
本文研究了动力学GCD问题，提出了自同构情况下的新方法，并证明了与高维动力学Mordell-兰猜想相关的结果。
We give a simple proof of a well-known theorem of Gál and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in Gál's theorem, which is new. Our approach also gives a transparent explanation of the relationship between the maximal size of the Riemann zeta function on vertical lines and bounds on GCD sums; a point which was previously unclear. Furthermore we obtain sharp bounds on the spectral norm of GCD matrices which settles a question raised in [2]. We use bounds for the spectral nor…
In this paper, we give two new coding algorithms by means of right circulant matrices with elements generalized Fibonacci and Lucas polynomials. For this purpose, we study basic properties of right circulant matrices using generalized Fibonacci polynomials $F_{p,q,n}\left( x\right) $, generalized Lucas polynomials $L_{p,q,n}\left( x\right) $ and geometric sequences.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。