Zobrazeno 1 - 10
of 873
pro vyhledávání: '"Cleary., Sean P."'
We describe standard forms for elements of the higher-dimensional Thompson groups $nV$ arising from gridding subdivision processes. These processes lead to standard normal form descriptions for elements in these groups, and sizes of these standard fo
Externí odkaz:
http://arxiv.org/abs/2403.02562
Autor:
Mukkala, Avinash Naraiah, Ray, Samrat, Bevacqua, Daniela, McGilvray, Ian, Sapisochin, Gonzalo, Moulton, Carol-Anne, Gallinger, Steven, Cleary, Sean P., Shwaartz, Chaya, Wei, Alice C., Reichman, Trevor W.
Publikováno v:
In Journal of Gastrointestinal Surgery September 2024 28(9):1485-1492
Autor:
Rengers, Timothy, Ubl, Daniel, Habermann, Elizabeth, Cleary, Sean P., Thiels, Cornelius A., Warner, Susanne G.
Publikováno v:
In HPB February 2024 26(2):299-309
Autor:
Zironda, Andrea, Zhang, Chi, Day, Courtney, McWilliams, Robert R., Starlinger, Patrick, Warner, Susanne G., Smoot, Rory L., Cleary, Sean P., Kendrick, Micheal L., Truty, Mark J., Thiels, Cornelius A.
Publikováno v:
In HPB January 2024 26(1):145-153
Autor:
Cleary, Sean, Tenas, Ariadna Fossas
We show that the density of elements in Thompson's groups T and V which have north-south dynamics acting on the circle is positive with respect to a stratification in terms of size. We show that the fraction of element pairs which generate a free sub
Externí odkaz:
http://arxiv.org/abs/2006.03115
Autor:
Cleary, Sean, Nadeem, Haris
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a single ro
Externí odkaz:
http://arxiv.org/abs/2005.00518
Autor:
Cleary, Sean, Maio, Roland
It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees, (S, T), ca
Externí odkaz:
http://arxiv.org/abs/2001.06422
Autor:
Cleary, Sean, Maio, Roland
Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair of rooted trees can be quickly reduced in cases where there is a commo
Externí odkaz:
http://arxiv.org/abs/2001.06407
Autor:
Lund, Sarah *, MacArthur, Taleen *, Watkins, Ryan *, Alva-Ruiz, Roberto *, Thiels, Cornelius A., Smoot, Rory L., Cleary, Sean P., Warner, Susanne G.
Publikováno v:
In Journal of Surgical Education November 2023 80(11):1582-1591
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.