in this note we are going to survey several invariants of finite groups related either to their orders or to generating sets or to lattices of subgroups. some relations among these invariants will be exhibited. special attention will be paid to monotonicity of them.

New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutation representation, which in turn simplifies the computation of a strong generating set. In addit...

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...

SGS is a compact sentence generation system. Inputs are the frames and specifications of a sentence. Programs attached to context free rules carry out the generation task. Output is a surface sentence with an associated derivation tree. suitable laws for a computer from lingistic phenomena. Therefore, this paper first describes the overall organization of SGS, secondly explains the linguistic s...

Poor households worldwide rely on savings groups (SGs) to satisfy their financial needs, yet very little is known about these groups’ ability to meet them. In this paper we develop a theoretical model illustrating the basic trade-offs in the functioning of SGs, and present stylized facts derived from the financial accounts of a sample of Ugandan SGs. The main conclusion from the theoretical mod...

Journal of Turbulence Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713665472 Lagrangian dynamic SGS model for stochastic coherent adaptive large eddy simulation Oleg V. Vasilyev a; Giuliano De Stefano b; Daniel E. Goldstein c; Nicholas K. -R. Kevlahan d a Department of Mechanical Engineering, University of ...

The pair (GH , ·) is called a special loop if (G, ·) is a loop with an arbitrary subloop (H, ·) called its special subloop. A special loop (GH , ·) is called a second Smarandache Bol loop (S2ndBL) if and only if it obeys the second Smarandache Bol identity (xs · z)s = x(sz · s) for all x, z in G and s in H. The popularly known and well studied class of loops called Bol loops fall into this clas...

The group membership problem for permutation groups is perhaps the most important problem of computational group theory. Solution of this problem seems to depend intrinsically on constructing a strong generating set. Until now, recognizing if a set of generators is strong has been thought to be as hard as constructing a strong generating set from an arbitrary generating set. This paper shows ho...

Introduction to Gaussian Random Function Simulation The so-called Gaussian Random Function simulation (GRFS) differs substantially from the Sequential Gaussian simulation (SGS) from GSLIB. GRFS more accurately reproduces distributions. It is typically faster than SGS, with additional efficiencies due to its parallel architecture. GRFS also has an option to run a fast collocated cosimulation – f...