Searcharxiv⌕ Search

arXiv subjects

Jean-Christophe Novelli

Publications and source records attributed to Jean-Christophe Novelli.

At least 37 records · Page 2Linked to original sources
arXiv2017

Free cumulants, Schröder trees, and operads

The functional equation defining the free cumulants in free probability is lifted successively to the noncommutative Faà di Bruno algebra, and then to the group of a free operad over Schröder trees. This leads to new combinatorial expressions, which remain valid for operator-valued free probability. Specializations of these expressions give back Speicher's formula in terms of noncrossing partitions, and its interpretation in terms of characters due to Ebrahimi-Fard and Patras.

math.CO↗
arXiv2017

Rayleigh-Schrödinger series and Birkhoff decomposition

We derive new expressions for the Rayleigh-Schrödinger seriesdescribing the perturbation of eigenvalues of quantumHamiltonians. The method, somehow close to the so-called dimensionalrenormalization in quantum field theory, involves the Birkhoffdecomposition of some Laurent series built up out of explicit fullynon-resonant terms present in the usual expression of theRayleigh-Schrödinger series. Our results provide new combinational formulae and a new way \ff{of deriving} perturbation series in Quantum Mechanics. More generally we prove that such a decomposition provides solutions of general normal form problems in Lie algebras.

math.AP↗
arXiv2016

Combinatorics of Poincaré's and Schröder's equations

We investigate the combinatorial properties of the functional equation $ϕ[h(z)]=h(qz)$ for the conjugation of a formal diffeomorphism $ϕ$ of $\mathbb{C}$ to its linear part $z\mapsto qz$. This is done by interpreting the functional equation in terms of symmetric functions, and then lifting it to noncommutative symmetric functions. We describe explicitly the expansion of the solution in terms of plane trees and prove that its expression on the ribbon basis has coefficients in ${\mathbb N}[q]$ after clearing the denominators $(q)_n$. We show that the conjugacy equation can be lifted to a quadratic fixed point equation in the free triduplicial algebra on one generator. This can be regarded as a $q$-deformation of the duplicial interpretation of the noncommutative Lagrange inversion formula. Finally, these calculations are interpreted in terms of the group of the operad of Stasheff polytopes, and are related to Ecalle's arborified expansion by means of morphisms between various Hopf algebras of trees.

math.CO↗
arXiv2015

On composition polynomials

We provide a combinatorial interpretation of the reduced composition polynomials of Ardila and Doker [Adv. Appl. Math. 50 (2013), 607], and relate them to the $(1-q)$-transform of noncommutative symmetric functions.

math.CO↗
arXiv2014

Quasi-symmetric functions as polynomial functions on Young diagrams

We determine the most general form of a smooth function on Young diagrams, that is, a polynomial in the interlacing or multirectangular coordinates whose value depends only on the shape of the diagram. We prove that the algebra of such functions is isomorphic to quasi-symmetric functions, and give a noncommutative analog of this result.

math.CO↗
arXiv2014

Super quasi-symmetric functions via Young diagrams

We consider the multivariate generating series $F_P$ of $P$-partitions in infinitely many variables $x_1, x_2 , \dots$. For some family of ranked posets $P$, it is natural to consider an analog $N_P$ with two infinite alphabets. When we collapse these two alphabets, we trivially recover $F_P$. Our main result is the converse, that is, the explicit construction of a map sending back $F_P$ onto $N_P$. We also give a noncommutative analog of the latter. An application is the construction of a basis of WQSym with a non-negative multiplication table, which lifts a basis of QSym introduced by K. Luoto.

math.CO↗
arXiv2014

m-dendriform algebras

The Fuss-Catalan numbers are a generalization of the Catalan numbers. They enumerate a large class of objects and in particular m-Dyck paths and m+1-ary trees. Recently, F. Bergeron defined an analogue for generic m of the Tamari order on classical Dyck words. The author and J.-Y. Thibon showed that the combinatorial Hopf algebras related to these m-Tamari orders are defined thanks to the same monoid, the sylvester monoid, as in the m=1 case and that all related Hopf algebras also have m analogues. We present here the m-generalization of another construction on Catalan sets: the dendriform algebras. These algebras are presented in two different ways: first by relations between the m+1 operations, relations that are very similar to the classical relations; and then by explicit operations splitting the classical dendriform operations defined on words into new operations. We then investigate their dual and show they are Koszul.

math.CO↗
arXiv2013

A set-operad of formal fractions and dendriform-like sub-operads

We introduce an operad of formal fractions, abstracted from the Mould operads and containing both the Dendriform and the Tridendriform operads. We consider the smallest set-operad contained in this operad and containing four specific elements of arity two, corresponding to the generators and the associative elements of the Dendriform and Tridendriform operads. We obtain a presentation of this operad (by binary generators and quadratic relations) and an explicit combinatorial description using a new kind of bi-colored trees. Similar results are also presented for related symmetric operads.

math.CO↗
arXiv2013

Binary shuffle bases for quasi-symmetric functions

We construct bases of quasi-symmetric functions whose product rule is given by the shuffle of binary words, as for multiple zeta values in their integral representations, and then extend the construction to the algebra of free quasi-symmetric functions colored by positive integers. As a consequence, we show that the fractions introduced in [Guo and Xie, Ramanujan Jour. 25 (2011) 307-317] provide a realization of this algebra by rational moulds extending that of free quasi-symmetric functions given in [Chapoton et al., Int. Math. Res. Not. IMRN 2008, no. 9, Art. ID rnn018].

math.CO↗
arXiv2012

Mould calculus, polyhedral cones, and characters of combinatorial Hopf algebras

We describe a method for constructing characters of combinatorial Hopf algebras by means of integrals over certain polyhedral cones. This is based on ideas from resurgence theory, in particular on the construction of well-behaved averages induced by diffusion processes on the real line. We give several interpretations and proofs of the main result in terms of noncommutative symmetric and quasisymmetric functions, as well as generalizations involving matrix quasi-symmetric functions. The interpretation of noncommutative symmetric functions as alien operators in resurgence theory is also discussed, and a new family of Lie idempotents of descent algebras is derived from this interpretation.

math.CO↗
arXiv2011

Supercharacters, symmetric functions in noncommuting variables, and related Hopf algebras

We identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in noncommuting variables. Each is a Hopf algebra and the two are isomorphic as such. This allows developments in each to be transferred. The identification suggests a rich class of examples for the emerging field of combinatorial Hopf algebras.

math.CO↗
arXiv2011

The algebraic combinatorics of snakes

Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main purpose is to show that several properties of the generating functions of snakes, such as differential equations or closed form as trigonometric functions, can be lifted at the level of noncommutative symmetric functions or free quasi-symmetric functions. The results take the form of algebraic identities for type B noncommutative symmetric functions, noncommutative supersymmetric functions and colored free quasi-symmetric functions.

math.CO↗
arXiv2011

Noncommutative symmetric functions with matrix parameters

We define new families of noncommutative symmetric functions and quasi-symmetric functions depending on two matrices of parameters, and more generally on parameters associated with paths in a binary tree. Appropriate specializations of both matrices then give back the two-vector families of Hivert, Lascoux, and Thibon and the noncommutative Macdonald functions of Bergeron and Zabrocki.

math.CO↗
arXiv2011

The # product in combinatorial Hopf algebras

We show that the # product of binary trees introduced by Aval and Viennot [arXiv:0912.0798] is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.

math.CO↗
arXiv2009

Representation theory of the higher order peak algebras

The representation theory (idempotents, quivers, Cartan invariants and Loewy series) of the higher order unital peak algebras is investigated. On the way, we obtain new interpretations and generating functions for the idempotents of descent algebras introduced in [F. Saliola, J. Algebra 320 (2008) 3866.]

math.CO↗
arXiv2009

Combinatorial Hopf algebras, noncommutative Hall-Littlewood functions, and permutation tableaux

We introduce a new family of noncommutative analogues of the Hall-Littlewood symmetric functions. Our construction relies upon Tevlin's bases and simple q-deformations of the classical combinatorial Hopf algebras. We connect our new Hall-Littlewood functions to permutation tableaux, and also give an exact formula for the q-enumeration of permutation tableaux of a fixed shape. This gives an explicit formula for: the steady state probability of each state in the partially asymmetric exclusion process (PASEP); the polynomial enumerating permutations with a fixed set of weak excedances according to crossings; the polynomial enumerating permutations with a fixed set of descent bottoms according to occurrences of the generalized pattern 2-31.

math.CO↗