scholarly journals Split Grothendieck rings of rooted trees and skew shapes via monoid representations

2019 ◽  
Vol 12 (8) ◽  
pp. 1379-1397
Author(s):  
David Beers ◽  
Matt Szczesny
Keyword(s):  
Rooted Trees ◽  
Grothendieck Rings

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 The center of the extended Haagerup subfactor has 22 simple objects

2017 ◽  
Vol 28 (01) ◽  
pp. 1750009 ◽  
Author(s):  
Scott Morrison ◽  
Kevin Walker
Keyword(s):  
Fusion Category ◽  
Dimension Function ◽  
Fusion Ring ◽  
Fusion Categories ◽  
Modular Data ◽  
Grothendieck Rings ◽  
Combinatorial Data

We explain a technique for discovering the number of simple objects in [Formula: see text], the center of a fusion category [Formula: see text], as well as the combinatorial data of the induction and restriction functors at the level of Grothendieck rings. The only input is the fusion ring [Formula: see text] and the dimension function [Formula: see text]. In particular, we apply this to deduce that the center of the extended Haagerup subfactor has 22 simple objects, along with their decompositions as objects in either of the fusion categories associated to the subfactor. This information has been used subsequently in [T. Gannon and S. Morrison, Modular data for the extended Haagerup subfactor (2016), arXiv:1606.07165 .] to compute the full modular data. This is the published version of arXiv:1404.3955 .

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