Home

Attila Egri-Nagy

  1. On Straight Words and Minimal Permutators in Finite Transformation Semigroups.

    Tue, 02/16/2010 - 16:01 — SomNambul
    Authors: Attila Egri-Nagy, Chrystopher L. Nehaniv
    Subjects: Group Theory
    Abstract

    Motivated by issues arising in computer science, we investigate the loop-free
    paths from the identity transformation and corresponding straight words in the
    Cayley graph of a finite transformation semigroup with a fixed generator set.
    Of special interest are words that permute a given subset of the state set.
    Certain such words, called minimal permutators, are shown to comprise a code,
    and the straight ones comprise a finite code.

  2. Subgroup Chains and Lagrange Coordinatizations of Finite Permutation Groups.

    Tue, 12/01/2009 - 16:01 — SomNambul
    Authors: Attila Egri-Nagy, Chrystopher L. Nehaniv
    Subjects: Group Theory
    Abstract

    We give a general constructive proof for hierarchical coordinatizations
    (Lagrange Decompositions) of permutation groups. The generalization originates
    from the investigation of how the subgroup chains of finite permutation groups
    yield different coordinate systems. The study is motivated by the practical
    needs and the verification of an existing computational implementation. Large
    scale machine calculated examples are also presented.

Math-arch

Syndicate content