Strong representations of the polycyclic inverse monoids: cycles and atoms. (Q2428648): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: David G. Jones / rank
Normal rank
 
Property / author
 
Property / author: David G. Jones / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10998-012-9053-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062731388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple \(C^*\)-algebras generated by isometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Subspaces and Hyper-Reflexivity for Free Semigroup Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial endomorphisms of the Cuntz algebras arising from permutations. I: General theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching laws for polynomial endomorphisms of Cuntz algebras arising from permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Completions of the Polycyclic Monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polycyclic Monoids<i>P</i><sub><i>n</i></sub>and the Thompson Groups<i>V</i><sub><i>n</i>,1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correspondence between a class of monoids and self-similar group actions. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive partial permutation representations of the polycyclic monoids and branching function systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NONCOMMUTATIVE GENERALIZATION OF STONE DUALITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5464461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groupoids, inverse semigroups, and their operator algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A groupoid approach to C*-algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Groups that are Isomorphic with Every Subgroup of Finite Index and their Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813882 / rank
 
Normal rank

Latest revision as of 02:33, 5 July 2024

scientific article
Language Label Description Also known as
English
Strong representations of the polycyclic inverse monoids: cycles and atoms.
scientific article

    Statements

    Strong representations of the polycyclic inverse monoids: cycles and atoms. (English)
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    For each \(n\geq 2\) the polycyclic monoid \(P_n\) is defined as a monoid with zero by the presentation \(P_n=\langle a_1,\dots,a_n,a^{-1}_1,\dots, a^{-1}_n:a^{-1}_ia_i=1\text{ and }a^{-1}_ia_j=0,\;j\neq i\rangle\) [see \textit{M. Nivat} and \textit{J.-F. Perrot}, C. R. Acad. Sci., Paris, Sér. A 271, 824-827 (1970; Zbl 0206.30304)]. The polycyclic monoid \(P_n\) is finitely generated, combinatorial, \(E^*\)-unitary, \(0\)-bisimple and congruence-free. The strong representations of the \(P_n\) are in principle easy to construct. Let \(X\) be an infinite set. Let \(X_i\), where \(1\leq i\leq n\), be pairwise disjoint subsets of \(X\) whose union is \(X\). Each subset \(X_i\) is assumed to have the same cardinality as \(X\). For each \(i\) choose a bijection \(\alpha_i\colon X\to X_i\). With these data, one can define a representation of \(S\) in \(I(X)\) by mapping \(a_i\) to \(\alpha_i\) and \(a^{-1}_i\) to \(\alpha^{-1}_i\) and then extending to the whole of \(P_n\). The authors study a particular class of strong representations, which they call affine. A string is called primitive if it is not the power of another string. The strings \(x\) and \(y\) are said to be conjugate if we can write \(x=uv\) and \(y=vu\) for some strings \(u\) and \(v\). This defines an equivalence relation on the set of \(A^*\) of all finite strings. A string is said to be a Lyndon word if it is primitive and minimal in its conjugacy class where the order is the lexicographic order. The main theorem: The primitive strings that characterize the action of \(P_2\) on \(X_p=\mathbb Z\setminus p\mathbb Z\) are precisely the reverses of the non-conjugate cycle patterns that occur in the binary representations of the fractions \(\frac{1}{p},\frac{2}{p},\dots,\frac{p-1}{p}\). In particular, the number of cycles of the action is equal to the number of non-conjugate cycle patterns. As a corollary we have that the action of \(P_2\) on \(X_p\) is transitive if and only if \(p\) is a prime and \(2\) is a primitive root modulo \(p\). If \(p=2^q-1\) for some integer \(q\geq 2\), that is, \(p\) is a Mersenne number, then the action of \(P_2\) on \(X_p\) has every possible cycle whose atomic weight is greater than unity and divides \(q\). The number of cycles with atomic weight \(k\) is equal to the number of binary Lyndon words of length \(k\). Some examples are given.
    0 references
    polycyclic inverse monoids
    0 references
    Cuntz inverse semigroups
    0 references
    strong representations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references