AbstractWe give a brief review of papers relating to Smith's determinant and point out a common structure that can be found in many extensions and analogues of Smith's determinant. We present the common structure in the language of posets. We also make an investigation on a conjecture of Beslin and Ligh on greatest common divisor (GCD) matrices in the sense of meet matrices and give characterizations of the posets satisfying the conjecture. Further, we give a counterexample for the conjecture of Bourque and Ligh that the least common multiple matrix on any GCD-closed set is invertible
AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest com...
AbstractWe study recently meet matrices on meet-semilattices as an abstract generalization of greate...
AbstractLet S={x1,…,xn} be a set of n distinct positive integers. The matrix having the greatest com...
AbstractWe give a brief review of papers relating to Smith's determinant and point out a common stru...
AbstractLet S={x1, x2,…, xn} be a set of distinct positive integers. Then n × n matrix [S]=(Sij), wh...
AbstractWe consider meet matrices on posets as an abstract generalization of greatest common divisor...
AbstractLet S = {x1, x2, …, xn} be an ordered set of distinct positive integers and [S] the GCD matr...
AbstractWe evaluate the higher-dimensional determinants of the greatest-common-divisor matrix define...
AbstractLet S={x1,…,xn} be a set of n distinct positive integers. The matrix [S]n having the least c...
summary:Let $S=\lbrace x_1,\dots ,x_n\rbrace $ be a finite subset of a partially ordered set $P$. L...
Copyright © 2013 HAN Haiqing and ZHU Siru. This is an open access article distributed under the Crea...
Abstract. We show that with any finite partially ordered set P (which need not be a lattice) one can...
A matrix is Bohemian if its elements are taken from a finite set of integers. We enumerate all poss...
Abstract. Considering a question of E. R. Berlekamp, Carlitz, Roselle, and Scoville gave a combinato...
summary:A set $\mathcal{S}=\lbrace x_1,\ldots ,x_n\rbrace $ of $n$ distinct positive integers is sai...
AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest com...
AbstractWe study recently meet matrices on meet-semilattices as an abstract generalization of greate...
AbstractLet S={x1,…,xn} be a set of n distinct positive integers. The matrix having the greatest com...
AbstractWe give a brief review of papers relating to Smith's determinant and point out a common stru...
AbstractLet S={x1, x2,…, xn} be a set of distinct positive integers. Then n × n matrix [S]=(Sij), wh...
AbstractWe consider meet matrices on posets as an abstract generalization of greatest common divisor...
AbstractLet S = {x1, x2, …, xn} be an ordered set of distinct positive integers and [S] the GCD matr...
AbstractWe evaluate the higher-dimensional determinants of the greatest-common-divisor matrix define...
AbstractLet S={x1,…,xn} be a set of n distinct positive integers. The matrix [S]n having the least c...
summary:Let $S=\lbrace x_1,\dots ,x_n\rbrace $ be a finite subset of a partially ordered set $P$. L...
Copyright © 2013 HAN Haiqing and ZHU Siru. This is an open access article distributed under the Crea...
Abstract. We show that with any finite partially ordered set P (which need not be a lattice) one can...
A matrix is Bohemian if its elements are taken from a finite set of integers. We enumerate all poss...
Abstract. Considering a question of E. R. Berlekamp, Carlitz, Roselle, and Scoville gave a combinato...
summary:A set $\mathcal{S}=\lbrace x_1,\ldots ,x_n\rbrace $ of $n$ distinct positive integers is sai...
AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest com...
AbstractWe study recently meet matrices on meet-semilattices as an abstract generalization of greate...
AbstractLet S={x1,…,xn} be a set of n distinct positive integers. The matrix having the greatest com...