Service systems for children and families have been shaped by standard approaches to knowledge-building, which reflect a reductionist approach assume linearity and/or that individuals experiences are normally distributed. Yet, these may be inadequate clients most at-risk, especially those who would analytic ‘outliers’. A complexity lens focuses on the whole system seeks identify patterns, inclu...

This paper deals with the problem of finding a base and strong generating set for the group generated by a given set of permutations. The concepts of base and strong generating set were introduced by Sims [5], [6] and provide the most effective tool for computing with permutation groups of high degree. One algorithm, originally proposed by Sims [7], is described in detail; its behavior on a num...

abstract background: admission to an intensive care unit (icu) is recognized as a situation with emotional strain, uncertainty, and fear of losing the patient. in such stressful situations, it is hope that can promote psychological stability in the patient’s family members. related literature revealed that sources of hope in this situation have still not been discussed well in studies. the purp...

We study languages of geodesics in lamplighter groups and Thompson’s group F . We show that the lamplighter groups Ln have infinitely many cone types, have no regular geodesic languages, and have 1-counter, context-free and counter geodesic languages with respect to certain generating sets. We show that the full language of geodesics with respect to one generating set for the lamplighter group ...

We study languages of geodesics in lamplighter groups and Thompson’s group F . We show that the lamplighter groups Ln have infinitely many cone types, have no regular geodesic languages, and have 1-counter, context-free and counter geodesic languages with respect to certain generating sets. We show that the full language of geodesics with respect to one generating set for the lamplighter group ...

The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. In their original paper they developed formulas, generating functions, and recurrence relations for composition counting functions for several families of graphs. Here we show that some of the results involving composit...

We give characterizations of orthogonal families, tight frames and orthonormal bases of Gabor systems. The conditions we propose are stated in terms of equations for the Fourier transforms of the Gabor system’s generating functions.

In this paper, the matrix extension of the multivariable Humbert polynomials is introduced. Various families of linear, multilinear and multilateral generating matrix functions of these matrix polynomials are presented. Miscellaneous applications are also discussed. 2000 Mathematics Subject Classification: 33C25; 15A60

We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a connection between the reciprocity results known to combinatorialists and the inversion relations used by physicists to solve models in statistical mechanics. Fo...

In recent years, several interesting families of generating functions for various classes of hypergeometric and generalized hypergeometric functions in one, two and more variables were investigated systematically. Here, in this sequel, we aim at establishing several (presumably) new generating relations for the generalized Gauss type hypergeometric functions which are introduced by means of som...