AbstractLet (P,⪯,∧) be a locally finite meet semilattice. LetS={x1,x2,…,xn},xi⪯xj⇒i⩽j,be a finite subset of P and let f be a complex-valued function on P. Then the n×n matrix (S)f, where((S)f)ij=f(xi∧xj),is called the meet matrix on S with respect to f. The join matrix on S with respect to f is defined dually on a locally finite join semilattice.In this paper, we give lower bounds for the smallest eigenvalues of certain positive definite meet matrices with respect to f on any set S. We also estimate eigenvalues of meet matrices respect to any f on meet closed set S and with respect to semimultiplicative f on join closed set S. The same is carried out dually for join matrices
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number o...
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
We define meet and join matrices on two subsets X and Y of a lattice (P, ) with re-spect to a compl...
AbstractLet (P,⪯,∧) be a locally finite meet semilattice. LetS={x1,x2,…,xn},xi⪯xj⇒i⩽j,be a finite su...
In this paper we give lower bounds for the smallest eigenvalues of certain positive definite meet ma...
AbstractWe study recently meet matrices on meet-semilattices as an abstract generalization of greate...
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...
AbstractLet (P,⩽)=(P,∧,∨) be a lattice, let S={x1,x2,…,xn} be a meet-closed subset of P and let f:P→...
AbstractWe consider meet matrices on posets as an abstract generalization of greatest common divisor...
Let Kn be the set of all n×n lower triangular (0,1)-matrices with each diagonal element equal to 1, ...
We define meet and join matrices on two subsets X and Y of a lattice (P,≼ ) with respect to a comple...
This paper provides a listing of techniques used to determine the eigenvalue bounds of a matrix defi...
Let T = {z1, z2, . . . , zn} be a finite multiset of real numbers, where z1 ≤ z2 ≤ · · · ≤ zn. The p...
We derive some basic results on the geometry of semidefinite programming (SDP) and eigenvalue-optim...
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number o...
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
We define meet and join matrices on two subsets X and Y of a lattice (P, ) with re-spect to a compl...
AbstractLet (P,⪯,∧) be a locally finite meet semilattice. LetS={x1,x2,…,xn},xi⪯xj⇒i⩽j,be a finite su...
In this paper we give lower bounds for the smallest eigenvalues of certain positive definite meet ma...
AbstractWe study recently meet matrices on meet-semilattices as an abstract generalization of greate...
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...
AbstractLet (P,⩽)=(P,∧,∨) be a lattice, let S={x1,x2,…,xn} be a meet-closed subset of P and let f:P→...
AbstractWe consider meet matrices on posets as an abstract generalization of greatest common divisor...
Let Kn be the set of all n×n lower triangular (0,1)-matrices with each diagonal element equal to 1, ...
We define meet and join matrices on two subsets X and Y of a lattice (P,≼ ) with respect to a comple...
This paper provides a listing of techniques used to determine the eigenvalue bounds of a matrix defi...
Let T = {z1, z2, . . . , zn} be a finite multiset of real numbers, where z1 ≤ z2 ≤ · · · ≤ zn. The p...
We derive some basic results on the geometry of semidefinite programming (SDP) and eigenvalue-optim...
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number o...
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
We define meet and join matrices on two subsets X and Y of a lattice (P, ) with re-spect to a compl...