HIGHLIGHTS
- who: Graph associahedra et al. from the 365–, c , Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France have published the Article: Compatibility fans realizing graphical nested complexes, in the Journal: (JOURNAL)
- what: The authors provide a new unrelated family of complete simplicial fans realizing the nested complex Nest(G) for any graph G. Cluster algebras and cluster fans.
SUMMARY
For any two adjacent maximal tubings T, T0 on G, with T r {t}=T0 r {t0 }, the coefficients of d(T◦, t) and d(T◦, t0 ) (resp. of d* (t . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.