A hierarchical structure of transformation semigroups with applications to probability limit measures

From MaRDI portal
Publication:2902289

DOI10.1080/10236198.2011.639365zbMATH Open1261.60006arXiv1103.0235OpenAlexW3104996227MaRDI QIDQ2902289FDOQ2902289


Authors: G. Budzban, Ph. Feinsilver Edit this on Wikidata


Publication date: 17 August 2012

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Abstract: The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels. This kernel hierarchy produces a set of tools that provides direct access to computations of interest in probability limit theorems; in particular, finding certain factors of idempotent limit measures. In addition, when considering transformation semigroups that arise naturally from edge colorings of directed graphs, as in the road-coloring problem, the hierarchy produces simple techniques to determine the rank of the kernel and to decide when a given kernel is a right group. In particular, it is shown that all kernels of rank one less than the number of vertices must be right groups and their structure for the case of two generators is described.


Full work available at URL: https://arxiv.org/abs/1103.0235




Recommendations




Cites Work


Cited In (1)





This page was built for publication: A hierarchical structure of transformation semigroups with applications to probability limit measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902289)