Let X be a set. Then an unordered relation on X is a family R of subsets of X. For such a family let G(R) be the group of all permutations g of X for which x^{g} belongs to R whenever x belongs to R. We are interested in permutation groups which can be represented in the shape G=G(R) for an unordered relation R on X
Dalla Volta, F., Siemons, J. (2009). Permutation groups defined by unordered relations. In Ischia Group theory 2008 (pp.56-67). World Scentific.
Permutation groups defined by unordered relations
Dalla Volta, F;
2009
Abstract
Let X be a set. Then an unordered relation on X is a family R of subsets of X. For such a family let G(R) be the group of all permutations g of X for which x^{g} belongs to R whenever x belongs to R. We are interested in permutation groups which can be represented in the shape G=G(R) for an unordered relation R on X
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
