Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
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 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...
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Let a be a vector of real numbers. By an integer relation for a we mean a non-zero integer vector c such that caT = 0. We discuss the algorithms for nding such integer relations f...