In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

OBJECTIVES To compare the following over a period of 8 weeks: (1) force decay between thermoplastic (TP) and thermoset (TS) elastomeric chains; (2) force decay between light (200-g) and heavy (350-g) initial forces; and (3) force decay between direct chains and chain loops (stretched from one pin around the second pin and back to the first pin). MATERIALS AND METHODS TP and TS chains were obt...

Subgroups of the symmetric group Sn act on powers of chains C n by permuting coordinates, and induce automorphisms of the ordered sets C. The quotients defined are candidates for symmetric chain decompositions. We establish this for some families of groups in order to enlarge the collection of subgroups G of the symmetric group Sn for which the quotient Bn/G obtained from the G-orbits on the Bo...

in recent years, there has been a great concern about strategic supply chain management. the supply chain configuration approach is related to strategic management of material and information flows. most of suggested configurations in the part of strategic direction are based on environmental factors and structure-conduct-performance approach. exploring supply chain configuration with emphasis ...

Anti-phosphorylcholine (PC) antibodies of the mouse are found in three different idiotype families: T15, M603 and M511. These subgroups exhibit different specificities for PC analogs and utilize light chains of different VL subgroups. In this study we have found that IgG1 antibodies of the T15 idiotype are much more protective against pneumococcal infection than IgG1 antibodies of the M511 or M...

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of 'basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the traditional choice for this purpose, but some combinatorial applications require different kinds of basic groups, such as quasiprimitive groups, that are defined by...

We consider competition between two decentralized supply chains network under demand uncertainty. Each chain consists of one risk-averse manufacturer and a group of risk-averse retailers. These two chains present substitutable products to the geographical dispensed markets. The markets’ demands are contingent upon prices, service levels, and advertising efforts of two supply chains. We formulat...

Using the local subgroup strategy of [3] and [4], we classify the radical subgroups and chains of the Fischer simple group Fi22 and verify the Alperin weight conjecture and the Uno reductive conjecture for this group; the latter is a refinement of the Dade reductive and Isaacs-Navarro conjectures.

In this paper, the competition between two supply chains and their elements is studied. Each chain consisted of a manufacturer and a distributor and the two chains compete in a market with single type of customer sensitive to price and delivery time. Therefore, this is a two-supply chain game and during the competition between two supply chains, elements of each supply chain (manufacturer and/o...

We present a new structural framework for computational group theory, based on chains of subgroups. This extends existing methods, such as Schreier-Sims techniques for permutation groups. This framework is now a part of the GAP 4 computational algebra system. It will be useful for implementing the matrix group recognition project.