Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Okur, Utku"'
Autor:
Cooper, Joshua, Okur, Utku
We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction problem''
Externí odkaz:
http://arxiv.org/abs/2312.16152
Autor:
Clifton, Ann, Czabarka, Eva, Dossou-Olory, Audace, Liu, Kevin, Loeb, Sarah, Okur, Utku, Szekely, Laszlo, Wicke, Kristina
We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree $T$ refers to the set (resp. multiset) of leaf induced binary subtrees of $T$. O
Externí odkaz:
http://arxiv.org/abs/2311.02255
Autor:
Clifton, Ann, Czabarka, Eva, Liu, Kevin, Loeb, Sarah, Okur, Utku, Szekely, Laszlo, Wicke, Kristina
We provide an $\Omega(n\log n) $ lower bound and an $O(n^2)$ upper bound for the smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes), which are universal for rooted binary trees with $n$ leaves, i.e., contain all of them as induced
Externí odkaz:
http://arxiv.org/abs/2308.06580
Autor:
Cooper, Joshua, Okur, Utku
Publikováno v:
In Linear Algebra and Its Applications 1 July 2024 692:37-61
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.