Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Verri, Emanuele"'
Autor:
Diehl, Joscha, Verri, Emanuele
Corner trees, introduced in "Even-Zohar and Leng, 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms", allow for the efficient counting of certain permutation patterns. Here we identify corner trees as a subset of finite (strict)
Externí odkaz:
http://arxiv.org/abs/2408.08293
Autor:
Diehl, Joscha, Verri, Emanuele
We introduce a new Hopf algebra that operates on pairs of finite interval partitions and permutations of equal length. This algebra captures vincular patterns, which involve specifying both the permutation patterns and the consecutive occurrence of v
Externí odkaz:
http://arxiv.org/abs/2306.17800
This article approaches the counting of subgraphs, in terms of signature-type functionals defined over combinatorial Hopf algebras of graphs. Well-known algebraic identities that arise in the context of counting subgraphs are then captured by their c
Externí odkaz:
http://arxiv.org/abs/2206.08323