Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
: Working constructively, we discuss two types of maximality for ideals in a commutative ring with identity, showing also that the results are the best possible. Key Words: constru...
ABSTRACT.Renormalization group (RG) methods are described for determining the key exponents related to the decay of solutions to nonlinear parabolic differential equations. Higher ...