Cargando…
Context-free pairs of groups I: Context-free pairs and graphs
Let [Formula: see text] be a finitely generated group, [Formula: see text] a finite set of generators and [Formula: see text] a subgroup of [Formula: see text]. We define what it means for [Formula: see text] to be a context-free pair; when [Formula: see text] is trivial, this specializes to the sta...
Autores principales: | Ceccherini-Silberstein, Tullio, Woess, Wolfgang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4819043/ https://www.ncbi.nlm.nih.gov/pubmed/27087724 http://dx.doi.org/10.1016/j.ejc.2012.03.011 |
Ejemplares similares
-
Context-free pairs of groups II — Cuts, tree sets, and random walks
por: Woess, Wolfgang
Publicado: (2012) -
Harmonic analysis on finite groups: representation theory, Gelfand pairs and Markov chains
por: Ceccherini-Silberstein, Tullio, et al.
Publicado: (2008) -
Groups, graphs and random walks
por: Ceccherini-Silberstein, Tullio, et al.
Publicado: (2017) -
Gelfand triples and their hecke algebras: harmonic analysis for multiplicity-free induced representations of finite groups
por: Ceccherini-Silberstein, Tullio, et al.
Publicado: (2020) -
Tracklet Pair Proposal and Context Reasoning for Video Scene Graph Generation
por: Jung, Gayoung, et al.
Publicado: (2021)