We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
We consider a queueing system with c servers and a threshold type vacation policy. In this system, when a certain number d<c of servers become idle at a service completion inst...
Abstract. A topos version of Cantor's back and forth theorem is established and used to prove that the ordered structure of the rational numbers Q, < is homogeneous in any ...