Concept

Symmetric inverse semigroup

NOTOC In abstract algebra, the set of all partial bijections on a set X ( one-to-one partial transformations) forms an inverse semigroup, called the symmetric inverse semigroup (actually a monoid) on X. The conventional notation for the symmetric inverse semigroup on a set X is or . In general is not commutative. Details about the origin of the symmetric inverse semigroup are available in the discussion on the origins of the inverse semigroup. When X is a finite set {1, ..., n}, the inverse semigroup of one-to-one partial transformations is denoted by Cn and its elements are called charts or partial symmetries. The notion of chart generalizes the notion of permutation. A (famous) example of (sets of) charts are the hypomorphic mapping sets from the reconstruction conjecture in graph theory. The cycle notation of classical, group-based permutations generalizes to symmetric inverse semigroups by the addition of a notion called a path, which (unlike a cycle) ends when it reaches the ; the notation thus extended is called path notation.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.