๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of partitions on a finite set with specified relations

โœ Scribed by I. S. Grunskii; Yu. A. Rubanovich

Publisher
Springer US
Year
1974
Tongue
English
Weight
328 KB
Volume
8
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On nearly self-conjugate partitions of a
On nearly self-conjugate partitions of a finite set
โœ Honghui Wan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 374 KB

Let n denote the set of integers {1,2 ..... n}. Let P = {P1,P2 ..... Pk} be a partition of n. Let C(i) denote the cardinality of the subset Pj to which i belongs. Suppose that P' = {P'~, P~ .... , P~,} is a second partition of n and define C'(i) similarly. The partitions P and P' are called conjugat

Constructing a Short Defining Set of Rel
Constructing a Short Defining Set of Relations for a Finite Group
โœ Volker Gebhardt ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 142 KB

An algorithm for the construction of a defining set of relations w.r.t. a given set of generators of a finite group G is presented. Compared with previously known methods it yields fewer relations and is better suited for iterated application to large groups. These improvements are achieved by consi