Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Aval, Jean Christophe"'
Autor:
Aval, Jean-Christophe
Publikováno v:
Discrete Mathematics and Theoretical Computer Science, 2024, 26 (3), pp.18
Complete non-ambiguous trees (CNATs) are combinatorial objects which appear in various contexts.Recently, Chen and Ohlig studied the notion of permutations associated to these objects, and proposed a series of nice conjectures.Most of them were prove
Externí odkaz:
http://arxiv.org/abs/2312.11951
Publikováno v:
Algebraic Combinatorics, Volume 6 (2023) no. 3, pp. 595-614
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes directed trees
Externí odkaz:
http://arxiv.org/abs/2201.11763
Autor:
Aval, Jean-Christophe, Boussicault, Adrien, Bouvel, Mathilde, Guibert, Olivier, Silimbani, Matteo
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like tableaux e
Externí odkaz:
http://arxiv.org/abs/2108.06212
Autor:
Delcroix-Oger, Bérénice, Hivert, Florent, Laborde-Zubieta, Patxi, Aval, Jean-Christophe, Boussicault, Adrien
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain q-versions of ou
Externí odkaz:
http://arxiv.org/abs/2103.07294
Autor:
Aval, Jean-Christophe1
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2024, Vol. 26 Issue 3, p1-9. 9p.
Publikováno v:
Formal Power Series and Algebraic Combinatorics, S\'eminaire Lotharingien de Combinatoire, 84B.66, 2020
Using the combinatorial species setting, we propose two new operad structures on multigraphs and on pointed oriented multigraphs. The former can be considered as a canonical operad on multigraphs, directly generalizing the Kontsevich-Willwacher opera
Externí odkaz:
http://arxiv.org/abs/2002.10926
The overall aim of this paper is to define a structure of graph operads, thus generalizing the celebrated pre-Lie operad on rooted trees. More precisely, we define two operads on multigraphs, and exhibit a non trivial link between them and the pre-Li
Externí odkaz:
http://arxiv.org/abs/1912.06563
Publikováno v:
Adv. Appl. Math. 121 (2020), 102080
We study the symmetric function and polynomial combinatorial invariants of Hopf algebras of permutations, posets and graphs. We investigate their properties and the relations among them. In particular, we show that the chromatic symmetric function an
Externí odkaz:
http://arxiv.org/abs/1908.04841
Publikováno v:
Formal Power Series and Algebraic Combinatorics, S\'eminaire Lotharingien de Combinatoire, 82B.32, 2019
In arXiv:1709.07504 Aguiar and Ardila give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on hypergraphs. We g
Externí odkaz:
http://arxiv.org/abs/1904.09878
Publikováno v:
The Electronic Journal of Combinatorics, Volume 27, Issue 1 (2020) P1.34
In arXiv:1709.07504 Ardila and Aguiar give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on hypergraphs. We g
Externí odkaz:
http://arxiv.org/abs/1806.08546