Algorithms for near-rings of non-linear transformations

Franz Binder, Erhard Aichinger, Jurgen Ecker, Christof Nobauer, Peter Mayr

Publikation: KonferenzbeitragPapierBegutachtung

3 Zitate (Scopus)

Abstract

In this note we present some algorithms to deal with near-rings, the appropriate algebraic structure to study non-linear functions. This is similar the role of rings in the theory of linear functions or that of groups for permutations. In particular, we give efficient algorithms that deal with big near-rings that are given by a small set of generators. In this context, generating involves composition as well as point-wise addition. In the extreme case, one transformation of a group of order n can generate a set of up to nn transformations.

OriginalspracheEnglisch
Seiten23-29
Seitenumfang7
DOIs
PublikationsstatusVeröffentlicht - 2000
Extern publiziertJa
VeranstaltungProceedings of the 2000 International Symposium on Symbolic and Algebraic Computation (ISSAC 2000) - St Andrews, UK
Dauer: 7 Aug. 20009 Aug. 2000

Konferenz

KonferenzProceedings of the 2000 International Symposium on Symbolic and Algebraic Computation (ISSAC 2000)
OrtSt Andrews, UK
Zeitraum07.08.200009.08.2000

Fingerprint

Untersuchen Sie die Forschungsthemen von „Algorithms for near-rings of non-linear transformations“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren