Specular sets (Q2358694): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q194702
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Valérie Berthé / 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.1016/j.tcs.2017.03.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206956776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor versus palindromic complexity of uniformly recurrent infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of Groups and Wreath Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bifix codes and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic, connected and tree sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite index basis property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal bifix decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Return words of linear involutions and fundamental groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3559177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics and geometry of the Rauzy–Veech induction for quadratic differentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and special factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: ℝ-trees and laminations for free groups I: algebraic laminations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measured foliations on nonorientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration Formulæ in Neutral Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neutral and tree sets of arbitrary characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words and some constructions of de Luca and Rauzy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of substitutive sequences using return words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic richness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval exchange transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lamination languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial group theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups, the theory of ends, and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all interval exchange transformations with flips are nonergodic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbit structure of interval exchange transformations with flip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic richness for languages invariant under more symmetries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783714 / rank
 
Normal rank

Latest revision as of 23:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Specular sets
scientific article

    Statements

    Specular sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 June 2017
    0 references
    Let \(A\) be a finite alphabet with an involution \(\theta: A\to A\) that has \(i\) orbits with 2 points and \(j\) fixed points. The group \(G_\theta\) generated by \(A\) subject to the relations \(a\theta(a)=\epsilon\) for every \(a\in A\) is called the specular group of type \((i,j)\). It is the free product of the free group of rank \(i\) with \(j\) copies of the 2-element group. The authors study certain subsets of \(G_\theta\) defined in terms of restriction graphs of their elements. Namely, a set \(S\) of reduced words over \(A\) is factorial if \(S\) contains \(A\) and all the factors of its elements, symmetric if \(S\) is closed under taking inverses, and bi-extendable if, for every \(w\in S\), there exist \(a,b\in A\) such that \(awb\in S\). If \(S\) is a bi-extendable set and \(w\in S\), consider the bipartite graph whose vertex set consists of two disjoint copies of \(A\) and whose edge set is \(\{(a,b)\in A\times A\mid awb\in S\}\). Removing isolated vertices from this graph, one obtains the extension graph \(E_S(w)\). A specular set is a symmetric bi-extendable factorial set \(S\) such that \(E_S(w)\) is a tree for every non-empty \(w\in S\) and \(E_S(\epsilon)\) is a union of two disjoint trees. The authors prove several results about specular sets; many of these results extend results about so-called tree subsets in free groups from [\textit{V. Berthé} et al., J. Pure Appl. Algebra 219, No. 7, 2521--2537 (2015; Zbl 1357.68115)].
    0 references
    specular group
    0 references
    tree set
    0 references
    bifix code
    0 references
    specular set
    0 references
    laminary set
    0 references
    factorial set
    0 references
    recurrent set
    0 references
    return word
    0 references
    free group
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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