We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...
Brian A. Davey, Pawel M. Idziak, William A. Lampe,...
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...
We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1 k-1 ) is at least k provided that k 6 n=2
Christian Bey, Konrad Engel, Gyula O. H. Katona, U...
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...