default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Christophe Novelli
Person information
- affiliation: University Paris-Est Marne-la-Vallée, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Wenjie Fang, Henri Mühle, Jean-Christophe Novelli:
Parabolic Tamari Lattices in Linear Type B. Electron. J. Comb. 31(1) (2024)- [j26]Justine Falque, Jean-Christophe Novelli, Jean-Yves Thibon:
Pinnacle sets revisited. Discret. Math. 347(4): 113834 (2024) - [c4]Antoine Abram, Florent Hivert, James D. Mitchell, Jean-Christophe Novelli, Maria Tsalakou:
Power Quotients of Plactic-like Monoids. GASCom 2024: 12-17 - 2022
- [j25]Jean-Christophe Novelli, Jean-Yves Thibon:
Noncommutative symmetric functions and Lagrange inversion II: Noncrossing partitions and the Farahat-Higman algebra. Adv. Appl. Math. 140: 102396 (2022) - 2021
- [j24]Wenjie Fang
, Henri Mühle, Jean-Christophe Novelli:
A Consecutive Lehmer Code for Parabolic Quotients of the Symmetric Group. Electron. J. Comb. 28(3) (2021) - [j23]Jean-Christophe Novelli, Jean-Yves Thibon:
Noncommutative unicellular LLT polynomials. J. Comb. Theory A 177: 105305 (2021) - 2020
- [j22]Jean-Christophe Novelli, Jean-Yves Thibon:
Hopf algebras of m-permutations, (m + 1)-ary trees, and m-parking functions. Adv. Appl. Math. 117: 102019 (2020)
2010 – 2019
- 2017
- [j21]Matthieu Josuat-Vergès, Frédéric Menous, Jean-Christophe Novelli, Jean-Yves Thibon:
Free cumulants, Schröder trees, and operads. Adv. Appl. Math. 88: 92-119 (2017) - [j20]Jean-Christophe Novelli, Jean-Yves Thibon:
On composition polynomials. J. Comb. Theory A 152: 1-9 (2017) - 2013
- [j19]Frédéric Menous, Jean-Christophe Novelli, Jean-Yves Thibon:
Mould calculus, polyhedral cones, and characters of combinatorial Hopf algebras. Adv. Appl. Math. 51(2): 177-227 (2013) - [j18]Jean-Christophe Novelli, Lenny Tevlin, Jean-Yves Thibon:
On some Noncommutative Symmetric Functions analogous to Hall-Littlewood and Macdonald polynomials. Int. J. Algebra Comput. 23(4): 779-802 (2013) - 2012
- [j17]Jean-Christophe Novelli, Jean-Yves Thibon:
Noncommutative symmetric functions and an amazing matrix. Adv. Appl. Math. 48(3): 528-534 (2012) - [j16]Matthieu Josuat-Vergès, Jean-Christophe Novelli, Jean-Yves Thibon:
The algebraic combinatorics of snakes. J. Comb. Theory A 119(8): 1613-1638 (2012) - 2011
- [j15]Jean-Christophe Novelli, Christophe Reutenauer, Jean-Yves Thibon:
Generalized descent patterns in permutations and associated Hopf algebras. Eur. J. Comb. 32(4): 618-627 (2011) - [j14]Gérard Henry Edmond Duchamp, Jean-Gabriel Luque, Jean-Christophe Novelli, Christophe Tollu, Frédéric Toumazet:
Hopf Algebras of Diagrams. Int. J. Algebra Comput. 21(6): 889-911 (2011) - 2010
- [j13]Jean-Christophe Novelli, Jean-Yves Thibon:
Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions. Discret. Math. 310(24): 3584-3606 (2010) - [j12]Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon:
Inversion of some series of free quasi-symmetric functions. Eur. J. Comb. 31(1): 29-33 (2010)
2000 – 2009
- 2009
- [j11]Jean-Christophe Novelli, Jean-Yves Thibon:
Superization and (q, t)-Specialization in Combinatorial Hopf Algebras. Electron. J. Comb. 16(2) (2009) - [j10]Jean-Christophe Novelli, Jean-Yves Thibon:
A one-parameter family of dendriform identities. J. Comb. Theory A 116(4): 864-874 (2009) - 2008
- [j9]Jean-Christophe Novelli, Jean-Yves Thibon:
Noncommutative symmetric functions and Lagrange inversion. Adv. Appl. Math. 40(1): 8-35 (2008) - [j8]Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon:
Trees, functional equations, and combinatorial Hopf algebras. Eur. J. Comb. 29(7): 1682-1695 (2008) - 2005
- [j7]Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon:
The algebra of binary search trees. Theor. Comput. Sci. 339(1): 129-165 (2005) - 2002
- [j6]Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating minimum cocolorings. Inf. Process. Lett. 84(5): 285-290 (2002) - 2001
- [j5]Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, Florent Hivert:
The Chinese Monoid. Int. J. Algebra Comput. 11(3): 301-334 (2001) - [j4]Jean-Christophe Novelli, Gilles Schaeffer, Florent Hivert:
Approximation of a Direction of Nd in Bounded Coordinates. Mob. Networks Appl. 6(6): 547-550 (2001) - [c3]François Boulier, Florent Hivert, Daniel Krob, Jean-Christophe Novelli:
Pseudo-Permutations II: Geometry and Representation Theory. DM-CCG 2001: 123-132 - [c2]Jean-Christophe Novelli, Dominique Rossin:
On the Toppling of a Sand Pile. DM-CCG 2001: 275-286 - [c1]Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating Minimum Cocolourings. FCT 2001: 118-125 - 2000
- [j3]Jean-Christophe Novelli:
On the hypoplactic monoid. Discret. Math. 217(1-3): 315-336 (2000)
1990 – 1999
- 1999
- [j2]Joël-Yann Fourré, Daniel Krob, Jean-Christophe Novelli:
On Extremal Permutations Avoiding omegaN = NN- 1 . . . 1. Eur. J. Comb. 20(8): 773-787 (1999) - 1997
- [j1]Jean-Christophe Novelli, Igor Pak, Alexander V. Stoyanovskii:
A direct bijective proof of the hook-length formula. Discret. Math. Theor. Comput. Sci. 1(1): 53-67 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
