Jean-Christophe Novelli

According to our database1, Jean-Christophe Novelli authored at least 26 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Noncommutative unicellular LLT polynomials.
J. Comb. Theory, Ser. A, 2021

2020
Hopf algebras of <i>m</i>-permutations, (<i>m</i> + 1)-ary trees, and <i>m</i>-parking functions.
Adv. Appl. Math., 2020

2017
On composition polynomials.
J. Comb. Theory, Ser. A, 2017

Free cumulants, Schröder trees, and operads.
Adv. Appl. Math., 2017

2013
On some Noncommutative Symmetric Functions analogous to Hall-Littlewood and Macdonald polynomials.
Int. J. Algebra Comput., 2013

Mould calculus, polyhedral cones, and characters of combinatorial Hopf algebras.
Adv. Appl. Math., 2013

2012
The algebraic combinatorics of snakes.
J. Comb. Theory, Ser. A, 2012

Noncommutative symmetric functions and an amazing matrix.
Adv. Appl. Math., 2012

2011
Hopf Algebras of Diagrams.
Int. J. Algebra Comput., 2011

Generalized descent patterns in permutations and associated Hopf algebras.
Eur. J. Comb., 2011

2010
Inversion of some series of free quasi-symmetric functions.
Eur. J. Comb., 2010

Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions.
Discret. Math., 2010

2009
A one-parameter family of dendriform identities.
J. Comb. Theory, Ser. A, 2009

Superization and (q, t)-Specialization in Combinatorial Hopf Algebras.
Electron. J. Comb., 2009

2008
Trees, functional equations, and combinatorial Hopf algebras.
Eur. J. Comb., 2008

Noncommutative symmetric functions and Lagrange inversion.
Adv. Appl. Math., 2008

2005
The algebra of binary search trees.
Theor. Comput. Sci., 2005

2002
Approximating minimum cocolorings.
Inf. Process. Lett., 2002

2001
Approximation of a Direction of Nd in Bounded Coordinates.
Mob. Networks Appl., 2001

The Chinese Monoid.
Int. J. Algebra Comput., 2001

Approximating Minimum Cocolourings.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

On the Toppling of a Sand Pile.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

Pseudo-Permutations II: Geometry and Representation Theory.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
On the hypoplactic monoid.
Discret. Math., 2000

1999
On Extremal Permutations Avoiding omega<sub>N</sub> = NN- 1 . . . 1.
Eur. J. Comb., 1999

1997
A direct bijective proof of the hook-length formula.
Discret. Math. Theor. Comput. Sci., 1997


  Loading...