172 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Laboratoire d'Informatique Gaspard-MongeFR50 papers
- Centre National de la Recherche ScientifiqueFR42 papers
- Université Gustave EiffelFR32 papers
- UniLaSalle Amiens (ESIEE-Amiens)FR16 papers
- Pôle de recherche et d'enseignement supérieur Université Paris-EstFR13 papers
- École nationale des ponts et chausséesFR12 papers
- Université Paris-Est Marne-la-ValléeFR9 papers
- Paris-Est SupFR8 papers
- Laboratoire Interdisciplinaire des Énergies de DemainFR6 papers
- Université Paris CitéFR5 papers
- CentraleSupélecFR4 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR4 papers
13 papers · 1 filter
Three Fuss-Catalan posets in interaction and their associative algebras
Camille Combe, Samuele Giraudo
We introduce -cliffs, a generalization of permutations and increasing trees depending on a range map . We define a first lattice structure on these objects and we establish g…
A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case
Yichao Chen, Wenjie Fang
Given an Eulerian digraph, we consider the genus distribution of its face-oriented embeddings. We prove that such distribution is log-concave for two families of Eulerian digraphs,…
Duality of graded graphs through operads
Samuele Giraudo
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypi…
Bijective link between Chapoton's new intervals and bipartite planar maps
Wenjie Fang
In 2006, Chapoton defined a class of Tamari intervals called "new intervals" in his enumeration of Tamari intervals, and he found that these new intervals are equi-enumerated with…
Compacted binary trees admit a stretched exponential
Andrew Elvey Price, Wenjie Fang, Michael Wallner
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that…
The Steep-Bounce Zeta Map in Parabolic Cataland
Cesar Ceballos, Wenjie Fang, Henri Mühle
As a classical object, the Tamari lattice has many generalizations, including -Tamari lattices and parabolic Tamari lattices. In this article, we unify these generalizations in…
Tree series and pattern avoidance in syntax trees
Samuele Giraudo
A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. W…
Quotients of the magmatic operad: lattice structures and convergent rewrite systems
Cyrille Chenavier, Christophe Cordero, Samuele Giraudo
We study quotients of the magmatic operad, that is the free nonsymmetric operad over one binary generator. In the linear setting, we show that the set of these quotients admits a l…
Induced Saturation of Graphs
Maria Axenovich, Mónika Csikós
A graph is -saturated for a graph , if does not contain a copy of but adding any new edge to results in such a copy. An -saturated graph on a given number…
A partial order on Motzkin paths
Wenjie Fang
The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other famili…
Bounding the size of an almost-equidistant set in Euclidean space
Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $…
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
P. Gambette, K. T. Huber, S. Kelk
Phylogenetic networks have gained prominence over the years due to their ability to represent complex non-treelike evolutionary events such as recombination or hybridization. Popul…
Return words of linear involutions and fundamental groups
Valérie Berthé, Vincent Delecroix, Francesco Dolce +3
We investigate the natural codings of linear involutions. We deduce from the geometric representation of linear involutions as Poincaré maps of measured foliations a suitable defin…