Searcharxiv⌕ Search

arXiv subjects

Pentti Haukkanen

Publications and source records attributed to Pentti Haukkanen.

At least 19 recordsLinked to original sources

On generalized eigenvalues of MAX matrices to MIN matrices and of LCM matrices to GCD matrices

We determine, for any n $\ge$ 1, the generalized eigenvalues of an n x n MAX matrix to the corresponding MIN matrix. We also show that a similar result holds for the generalized eigenvalues of an nxn LCM matrix to the corresponding GCD matrix when n $\le$ 4, but breaks down for n > 4. In addition, we prove Cauchy's interlacing theorem for generalized eigenvalues, and we conjecture an unexpected connection between the OEIS sequence A004754 and the appearance of -1 as a generalized eigenvalue in the LCM-GCD setting.

math.NT↗

Some further applications of a lattice theoretic method in the study of singular LCM matrices

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 then by Hong. It turned out that the conjecture holds only on GCD closed sets with at most 7 elements but not in general for larger sets. However, the given counterexamples did not give much insight on why does the conjecture fail exactly in the case when n=8. This situation was later improved in a couple of articles, where a new lattice theoretic approach was introduced (the method is based on the fact that because the set S is assumed to be GCD closed, the structure (S, |) actually forms a meet semilattice). For example, it has been shown that in the case when the set S has 8 elements and the matrix [S] is singular, there is only one option for the semilattice structure of (S, |), namely the cube structure. Since the cases up to n=8 have been thoroughly studied in various articles, the next natural step is to apply the methods to the case n=9. This was done by Altinisik and Altintaa as they consider the different lattice structures of (S, |) with nine elements that can result in a singular LCM matrix [S]. However, their investigation leaves two open questions, and the main purpose of this presentation is to provide solutions to them. We shall also give a new lattice theoretic proof for a result referred to as Sun's conjecture, which was originally proven by Hong via number theoretic approach.

math.CO↗

Menon-type identities again: A note on a paper by Li, Kim and Qiao

We give common generalizations of the Menon-type identities by Sivaramakrishnan (1969) and Li, Kim, Qiao (2019). Our general identities involve arithmetic functions of several variables, and also contain, as special cases, identities for gcd-sum type functions. We point out a new Menon-type identity concerning the lcm function. We present a simple character free approach for the proof.

math.NT↗

Positive definite functions on semilattices

We introduce a notion of positive definiteness for functions $f\!:P\to\mathbb{R}$ defined on meet semilattices $(P,\preceq,\wedge)$ and prove several properties for these functions. In addition, we utilize the $LDL^{\rm T}$ decomposition of meet matrices in order to explore the properties of multivariate positive definite arithmetic functions $f\!:\mathbb{Z}_+^d\to\mathbb{R}$. Finally, we give a series of examples and counterexamples of positive definite functions.

math.NT↗

Studying the inertias of LCM matrices and revisiting the Bourque-Ligh conjecture

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 is known about the inertia of LCM matrices in general. The ultimate goal of this article is to improve this situation. Assuming that $S$ is a meet closed set we define an entirely new lattice-theoretic concept by saying that an element $x_i\in S$ generates a double-chain set in $S$ if the set $\mathrm{meetcl}(C_S(x_i))\setminus C_S(x_i)$ can be expressed as a union of two disjoint chains (here the set $C_S(x_i)$ consists of all the elements of the set $S$ that are covered by $x_i$ and $\mathrm{meetcl}(C_S(x_i))$ is the smallest meet closed subset of $S$ that contains the set $C_S(x_i)$). We then proceed by studying the values of the Möbius function on sets in which every element generates a double-chain set and use the properties of the Möbius function to explain why the Bourque-Ligh conjecture holds in so many cases and fails in certain very specific instances. After that we turn our attention to the inertia and see that in some cases it is possible to determine the inertia of an LCM matrix simply by looking at the lattice-theoretic structure of $(S,|)$ alone. Finally, we are going to show how to construct LCM matrices in which the majority of the eigenvalues is either negative or positive.

math.NT↗

Arithmetic Subderivatives and Leibniz-Additive 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, generalizing well-known bounds for the arithmetic derivative, establish bounds for a Leibniz-additive function.

math.NT↗

The arithmetic derivative and Leibniz-additive functions

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 totally determined by the values of $f$ and $h_f$ at primes. We also consider properties of Leibniz-additive functions with respect to the usual product, composition and Dirichlet convolution of arithmetic functions.

math.NT↗

Inertia, positive definiteness and $\ell_p$ norm of GCD and LCM matrices and their unitary analogs

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.

math.NT↗

The spectral norm of a Horadam circulant matrix

Let $a$, $b$, $p$, $q$ be integers and~$(h_n)$ defined by $h_0=a$, $h_1=b$, $h_n=ph_{n-1}+qh_{n-2}$, $n=2,3,\dots$. Complementing to certain previously known results, we study the spectral norm of the circulant matrix corresponding to $h_0,\dots,h_{n-1}$.

math.NT↗

Studying the singularity of LCM-type matrices via semilattice structures and their Möbius functions

The invertibility of LCM matrices and their Hadamard powers have been studied a lot over the years by many authors. Bourque and Ligh conjectured in 1992 that the LCM matrix $[S]=[[x_i, x_j]]$ on any GCD closed set $S=\{x_1, x_2, \ldots, x_n\}$ is invertible, but in 1997 this was proven false. However, currently there are many open conjectures concerning LCM matrices and their Hadamard powers presented by Hong. In this paper we utilize lattice-theoretic structures and the Möbius function to explain the singularity of classical LCM matrices and their Hadamard powers. At the same time we end up disproving some of Hong's conjectures. Elementary mathematical analysis is applied to prove that for most semilattice structures there exist a set $S=\{x_1, x_2, \ldots, x_n\}$ of positive integers and a real number $α>0$ such that $S$ possesses this structure and the power LCM matrix $[[x_i, x_j]^α]$ is singular.

math.CO↗

A lattice-theoretic approach to the Bourque-Ligh conjecture

The Bourque-Ligh conjecture states that if $S=\{x_1,x_2,\ldots,x_n\}$ is a gcd-closed set of positive integers with distinct elements, then the LCM matrix $[S]=[\hbox{lcm}(x_i,x_j)]$ is invertible. It is well known that this conjecture holds for $n\leq7$ but does not generally hold for $n\geq8$. In this paper we provide a lattice-theoretic explanation for this solution of the Bourque-Ligh conjecture. In fact, let $(P,\leq)=(P,\land,\lor)$ be a lattice, let $S=\{x_1,x_2,\ldots,x_n\}$ be a subset of $P$ and let $f:P\to{\mathbb C}$ be a function. We study under which conditions the join matrix $[S]_f=[f(x_i\lor x_j)]$ on $S$ with respect to $f$ is invertible on a meet closed set $S$ (i.e., $x_i,x_j\in S\Rightarrow x_i\land x_j\in S)$.

math.CO↗

On the eigenvalues of certain number-theoretic matrices

In this paper we study the structure and give bounds for the eigenvalues of the $n\times n$ matrix, which $ij$ entry is $(i,j)^α[i,j]^β$, where $α,β\in\Rset$, $(i,j)$ is the greatest common divisor of $i$ and $j$ and $[i,j]$ is the least common multiple of $i$ and $j$. Currently only $O$-estimates for the greatest eigenvalue of this matrix can be found in the literature, and the asymptotic behaviour of the greatest and smallest eigenvalue is known in case when $α=β$.

math.NT↗

Extensions of the class of multiplicative functions

We consider the classes of quasimultiplicative, semimultiplicative and Selberg multiplicative functions as extensions of the class of multiplicative functions. We apply these concepts to Ramanujan's sum and its analogue with respect to regular integers (mod r).

math.NT↗

Discrete Ramanujan-Fourier Transform of Even Functions (mod $r$)

An arithmetical function $f$ is said to be even (mod r) if f(n)=f((n,r)) for all n\in\Z^+, where (n, r) is the greatest common divisor of n and r. We adopt a linear algebraic approach to show that the Discrete Fourier Transform of an even function (mod r) can be written in terms of Ramanujan's sum and may thus be referred to as the Discrete Ramanujan-Fourier Transform.

math.NT↗

Asymptotics of the number of threshold functions on a two-dimensional rectangular grid

Let $m,n\ge 2$, $m\le n$. It is well-known that the number of (two-dimensional) threshold functions on an $m\times n$ rectangular grid is {eqnarray*} t(m,n)=\frac{6}{π^2}(mn)^2+O(m^2n\log{n})+O(mn^2\log{\log{n}})= \frac{6}{π^2}(mn)^2+O(mn^2\log{m}). {eqnarray*} We improve the error term by showing that $$ t(m,n)=\frac{6}{π^2}(mn)^2+O(mn^2). $$

math.CO↗

On the positive definiteness and eigenvalues of meet and join matrices

In this paper we study the positive definiteness of meet and join matrices using a novel approach. When the set $S_n$ is meet closed, we give a sufficient and necessary condition for the positive definiteness of the matrix $(S_n)_f$. From this condition we obtain some sufficient conditions for positive definiteness as corollaries. We also use graph theory and show that by making some graph theoretic assumptions on the set $S_n$ we are able to reduce the assumptions on the function $f$ while still preserving the positive definiteness of the matrix $(S_n)_f$. Dual theorems of these results for join matrices are also presented. As examples we consider the so-called power GCD and power LCM matrices as well as MIN and MAX matrices. Finally we give bounds for the eigenvalues of meet and join matrices in cases when the function $f$ possesses certain monotonic behaviour.

math.NT↗

Asymptotics for numbers of line segments and lines in a square grid

We present an asymptotic formula for the number of line segments connecting q+1 points of an nxn square grid, and a sharper formula, assuming the Riemann hypothesis. We also present asymptotic formulas for the number of lines through at least q points and, respectively, through exactly q points of the grid. The well-known case q=2 is so generalized.

math.NT↗

Determinant and inverse of join matrices on two sets

Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we present expressions for the determinant and the inverse of $[X,Y]_f$. Our main goal is to cover the case when $f$ is not semimultiplicative since the formulas presented earlier for $[X,Y]_f$ cannot be applied in this situation. In cases when $f$ is semimultiplicative we obtain several new and known formulas for the determinant and inverse of $(X,Y)_f$ and the usual meet and join matrices $(S)_f$ and $[S]_f$. We also apply these formulas to LCM, MAX, GCD and MIN matrices, which are special cases of join and meet matrices.

math.NT↗