A set $𝒮=\{x_1,...,x_n\}$ of $n$ distinct positive integers is said to be gcd-closed if $(x_i,x_j)\in 𝒮$ for all $1\le i,j\le n$. Shaofang Hong conjectured in 2002 that for a given positive integer $t$ there is a positive integer $k\left(t\right)$ depending only on $t$, such that if $n\le k\left(t\right)$, then the power LCM matrix $\left({[x_i,x_j]}^t\right)$ defined on any gcd-closed set $𝒮=\{x_1,...,x_n\}$ is nonsingular, but for $n\ge k\left(t\right)+1$, there exists a gcd-closed set $𝒮=\{x_1,...,x_n\}$ such that the power LCM matrix $\left({[x_i,x_j]}^t\right)$ on $𝒮$ is singular. In 1996, Hong proved $k\left(1\right)=7$ and noted $k\left(t\right)\ge 7$ for all $t\ge 2$. This paper develops Hong’s method and provides a new idea...

Let $S=\{x_1,\cdots ,x_n\}$ be a finite subset of a partially ordered set $P$. Let $f$ be an incidence function of $P$. Let $\left[f(x_i\wedge x_j)\right]$ denote the $n\times n$ matrix having $f$ evaluated at the meet $x_i\wedge x_j$ of $x_i$ and $x_j$ as its $i,j$-entry and $\left[f(x_i\vee x_j)\right]$ denote the $n\times n$ matrix having $f$ evaluated at the join $x_i\vee x_j$ of $x_i$ and $x_j$ as its $i,j$-entry. The set $S$ is said to be meet-closed if $x_i\wedge x_j\in S$ for all $1\le i,j\le n$. In this paper we get explicit combinatorial formulas for the determinants of matrices $\left[f(x_i\wedge x_j)\right]$ and $\left[f(x_i\vee x_j)\right]$ on any meet-closed set $S$. We also obtain necessary and sufficient conditions for...

The radio antipodal number of a graph $G$ is the smallest integer $c$ such that there exists an assignment $fV\left(G\right)\to \{1,2,...,c\}$ satisfying $\left|f\right(u)-f(v\left)\right|\ge D-d(u,v)$ for every two distinct vertices $u$ and $v$ of $G$, where $D$ is the diameter of $G$. In this note we determine the exact value of the antipodal number of the path, thus answering the conjecture given in [G. Chartrand, D. Erwin and P. Zhang, Math. Bohem. 127 (2002), 57–69]. We also show the connections between this colouring and radio labelings.