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

Circular nonsingular threshold transformations

โœ Scribed by Takao Ueda


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
628 KB
Volume
105
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


Ueda, T., Circular nonsingular threshold transformations, Discrete Mathematics 105 (1992) 249-258. Circular n-dimensional Boolean transformations are those which commute with an n-cyclic permutation of variables. A minimal Boolean transformation is the one which has the minimum number of coordinates changed by it among its equivalent transformations with respect to permutations and complementations of their variables. After general results on these concepts and nonsingular threshold transformations, seven n-dimensional (and three special 6-dimensional) nonsingular threshold transformations which are circular and minimal are listed with a proof of nonsingularity.

Finally, it is proved that they are all equivalent to threshold transformations with graphs composed of 2-cycles and fixed points.


๐Ÿ“œ SIMILAR VOLUMES


Graphs of nonsingular threshold transfor
โœ Takao Ueda ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 695 KB

After the graph structures of self-dual nonsingular (i.e. one-to-one) transformations of (0, 1)" are described, a construction method of generating minimal nonsingular threshold transformations from lower-dimensional ones is presented. Theorems which concern nonsingular threshold transformations and