scholarly journals Invariant random subgroups of groups acting on rooted trees

2021 ◽  
pp. 1
Author(s):  
Ferenc Bencs ◽  
László Márton Tóth
Keyword(s):  
Rooted Trees ◽  
Invariant Random Subgroups

Infinitely presented permutation stable groups and invariant random subgroups of metabelian groups

2021 ◽  
pp. 1-36
Author(s):  
ARIE LEVIT ◽  
ALEXANDER LUBOTZKY
Keyword(s):  
Ergodic Theorem ◽  
Abelian Groups ◽  
Wreath Products ◽  
Finitely Generated ◽  
Metabelian Groups ◽  
Amenable Groups ◽  
Pointwise Ergodic Theorem ◽  
Lamplighter Group ◽  
Invariant Random Subgroups

Abstract We prove that all invariant random subgroups of the lamplighter group L are co-sofic. It follows that L is permutation stable, providing an example of an infinitely presented such group. Our proof applies more generally to all permutational wreath products of finitely generated abelian groups. We rely on the pointwise ergodic theorem for amenable groups.

Mining closed and maximal frequent subtrees from databases of labeled rooted trees

2005 ◽  
Vol 17 (2) ◽  
pp. 190-202 ◽  
Author(s):  
Yun Chi ◽  
Yi Xia ◽  
Yirong Yang ◽  
R.R. Muntz
Keyword(s):  
Rooted Trees

scholarly journals On path entropy functions for rooted trees

1995 ◽  
Vol 138 (1-3) ◽  
pp. 319-326
Author(s):  
A. Meir ◽  
J.W. Moon
Keyword(s):  
Rooted Trees ◽  
Entropy Functions

scholarly journals Ergodic decomposition of group actions on rooted trees

2016 ◽  
Vol 292 (1) ◽  
pp. 94-111 ◽  
Author(s):  
Rostislav Grigorchuk ◽  
Dmytro Savchuk
Keyword(s):  
Group Actions ◽  
Rooted Trees ◽  
Ergodic Decomposition

scholarly journals A Data Structure for Dynamically Maintaining Rooted Trees

1997 ◽  
Vol 24 (1) ◽  
pp. 37-65 ◽  
Author(s):  
Greg N. Frederickson
Keyword(s):  
Data Structure ◽  
Rooted Trees

scholarly journals Zero-divisor graphs of lower dismantlable lattices I

2017 ◽  
Vol 67 (2) ◽  
Author(s):  
Avinash Patil ◽  
B. N. Waphare ◽  
Vinayak Joshi ◽  
Hossein Y. Pourali
Keyword(s):  
Zero Divisor ◽  
Rooted Trees

AbstractIn this paper, we study the zero-divisor graphs of a subclass of dismantlable lattices. These graphs are characterized in terms of the non-ancestor graphs of rooted trees.

Sign in / Sign up

Export Citation Format

Share Document