Equivalence classes of functions between finite groups

Two types of equivalence relation are used to classify functions between finite groups into classes which preserve combinatorial and algebraic properties important for a wide range of applications. However, it is very difficult to tell when functions equivalent under the coarser (“graph”) equivalenc...

Full description

Saved in:
Bibliographic Details
Published in:Journal of algebraic combinatorics 2012-05, Vol.35 (3), p.477-496
Main Author: Horadam, K. J.
Format: Article
Language:English
Subjects:
Combinatorics
Computer Science
Convex and Discrete Geometry
Group Theory and Generalizations
Lattices
Mathematics
Mathematics and Statistics
Order
Ordered Algebraic Structures
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two types of equivalence relation are used to classify functions between finite groups into classes which preserve combinatorial and algebraic properties important for a wide range of applications. However, it is very difficult to tell when functions equivalent under the coarser (“graph”) equivalence are inequivalent under the finer (“bundle”) equivalence. Here we relate graphs to transversals and splitting relative difference sets (RDSs) and introduce an intermediate relation, canonical equivalence, to aid in distinguishing the classes. We identify very precisely the conditions under which a graph equivalence determines a bundle equivalence, using transversals and extensions. We derive a new and easily computed algebraic measure of nonlinearity for a function f , calculated from the image of its coboundary ∂f . This measure is preserved by bundle equivalence but not by the coarser equivalences. It takes its minimum value if f is a homomorphism, and takes its maximum value if the graph of f contains a splitting RDS.
ISSN:0925-9899
1572-9192
DOI:10.1007/s10801-011-0310-8