AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest common divisor (gcd) matrices. Some new bounds for the determinant of meet matrices and a formula for the inverse of meet matrices are given
AbstractLet S = {x1, x2, …, xn} be an ordered set of distinct positive integers and [S] the GCD matr...
AbstractLet S={x1, x2,…, xn} be a set of distinct positive integers. Then n × n matrix [S]=(Sij), wh...
AbstractAn ‘incidence matrix’ is one consisting of 0s and 1s only. If 12 < α ⩽ 1, an n × n incidence...
AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest com...
summary:Let $S=\lbrace x_1,\dots ,x_n\rbrace $ be a finite subset of a partially ordered set $P$. L...
AbstractWe study recently meet matrices on meet-semilattices as an abstract generalization of greate...
AbstractWe consider meet matrices on posets as an abstract generalization of greatest common divisor...
AbstractLet (P,⪯,∧) be a locally finite meet semilattice. LetS={x1,x2,…,xn},xi⪯xj⇒i⩽j,be a finite su...
We define meet and join matrices on two subsets X and Y of a lattice (P,≼ ) with respect to a comple...
New version of "A remark about factorizing GCD-type Hyperdeterminants". Title changed. Results, exam...
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
AbstractWe evaluate the higher-dimensional determinants of the greatest-common-divisor matrix define...
AbstractLet be an arithmetical function and S = x1, xn a set of distinct positive integers. Let ((xi...
In this paper we give lower bounds for the smallest eigenvalues of certain positive definite meet ma...
AbstractWe give a brief review of papers relating to Smith's determinant and point out a common stru...
AbstractLet S = {x1, x2, …, xn} be an ordered set of distinct positive integers and [S] the GCD matr...
AbstractLet S={x1, x2,…, xn} be a set of distinct positive integers. Then n × n matrix [S]=(Sij), wh...
AbstractAn ‘incidence matrix’ is one consisting of 0s and 1s only. If 12 < α ⩽ 1, an n × n incidence...
AbstractWe consider meet matrices on meet-semilattices as an abstract generalization of greatest com...
summary:Let $S=\lbrace x_1,\dots ,x_n\rbrace $ be a finite subset of a partially ordered set $P$. L...
AbstractWe study recently meet matrices on meet-semilattices as an abstract generalization of greate...
AbstractWe consider meet matrices on posets as an abstract generalization of greatest common divisor...
AbstractLet (P,⪯,∧) be a locally finite meet semilattice. LetS={x1,x2,…,xn},xi⪯xj⇒i⩽j,be a finite su...
We define meet and join matrices on two subsets X and Y of a lattice (P,≼ ) with respect to a comple...
New version of "A remark about factorizing GCD-type Hyperdeterminants". Title changed. Results, exam...
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
AbstractWe evaluate the higher-dimensional determinants of the greatest-common-divisor matrix define...
AbstractLet be an arithmetical function and S = x1, xn a set of distinct positive integers. Let ((xi...
In this paper we give lower bounds for the smallest eigenvalues of certain positive definite meet ma...
AbstractWe give a brief review of papers relating to Smith's determinant and point out a common stru...
AbstractLet S = {x1, x2, …, xn} be an ordered set of distinct positive integers and [S] the GCD matr...
AbstractLet S={x1, x2,…, xn} be a set of distinct positive integers. Then n × n matrix [S]=(Sij), wh...
AbstractAn ‘incidence matrix’ is one consisting of 0s and 1s only. If 12 < α ⩽ 1, an n × n incidence...
DOI
Add to ORKG