English
Related papers

Related papers: Ordered forests and parking functions

200 papers

It is known that there is a Hopf algebra structure on the vector space with basis all heap-ordered trees. We give a new bialgebra structure on the space with basis all permutations and show that there is a direct bialgebra isomorphism…

Rings and Algebras · Mathematics 2007-11-14 R. L. Grossman , R. G. Larson

We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.

Rings and Algebras · Mathematics 2007-11-27 Robert L. Grossman , Richard G. Larson

We introduce two operads which own the set of planar forests as a basis. With its usual product and two other products defined by different types of graftings, the algebra of planar rooted trees H becomes an algebra over these operads. The…

Rings and Algebras · Mathematics 2009-01-16 Loïc Foissy

We introduce the notions of preordered and heap-preordered forests, generalizing the construction of ordered and heap-ordered forests. We prove that the algebras of preordered and heap-preordered forests are Hopf for the cut coproduct, and…

Combinatorics · Mathematics 2013-05-03 Anthony Mansuy

We introduce a graded Hopf algebra based on the set of parking functions (hence of dimension (n+1)^{n-1} in degree n). This algebra can be embedded into a noncommutative polynomial algebra in infinitely many variables. We determine its…

Combinatorics · Mathematics 2013-02-12 Jean-Christophe Novelli , Jean-Yves Thibon

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

Quantum Algebra · Mathematics 2020-03-12 Julien Bichon , Maeva Paradis

The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…

Combinatorics · Mathematics 2007-05-23 Frederic Chapoton

We construct an explicit Hopf algebra isomorphism from the algebra of heap-ordered trees to that of quasi-symmetric functions, generated by formal permutations, which is a lift of the natural projection of the Connes-Kreimer algebra of…

Combinatorics · Mathematics 2010-04-30 Loic Foissy , Jeremie Unterberger

We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and…

Combinatorics · Mathematics 2013-02-12 Jean-Christophe Novelli , Jean-Yves Thibon

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

Combinatorics · Mathematics 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…

Combinatorics · Mathematics 2011-09-22 L. Foissy , J. -C. Novelli , J. -Y. Thibon

We construct three new combinatorial Hopf algebras based on the Loday-Ronco operations on planar binary trees. The first and second algebras are defined on planar trees and labeled planar trees extending the Loday-Ronco and…

Combinatorics · Mathematics 2021-09-14 Nantel Bergeron , Rafael S. González D'León , Shu Xiao Li , C. Y. Amy Pang , Yannic Vargas

We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an…

Combinatorics · Mathematics 2015-03-17 Jean-Baptiste Priez

We introduce the operad Moor, dual of the operad NAP and the notion of Moor-bialgebras. We warn the reader that the compatibility relation linking the Moor-operation with the Moor-cooperation is not distributive in the sense of Loday.…

Quantum Algebra · Mathematics 2008-06-25 Leroux Philippe

Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…

Rings and Algebras · Mathematics 2022-09-21 Xing Gao , Li Guo , Yi Zhang

Consider the vector space $\mathbb{K}\mathcal{P}$ spanned by parking functions. By representing parking functions as labeled digraphs, Hivert, Novelli and Thibon constructed a cocommutative Hopf algebra PQSym$^{*}$ on…

Combinatorics · Mathematics 2015-04-08 Teresa Xueshan Li

Functors from (co)operads to bialgebras relate Hopf algebras that occur in renormalisation to operads, which simplifies the proof of the Hopf algebra axioms, and induces a characterisation of the corresponding group of characters and Lie…

Mathematical Physics · Physics 2007-05-23 Pepijn van der Laan

Bialgebras and Hopf (bi)modules are typical algebraic structures with several interacting operations. Their structural and homological study is therefore quite involved. We develop the machinery of braided systems, tailored for handling…

Quantum Algebra · Mathematics 2016-11-16 Victoria Lebed

Description of cocommutative Hopf algebras associated with families of trees. Applications include Cayley's theorem on the number of rooted trees with n nodes, and Catalan's theorem on the number of rooted ordered trees with n nodes.

Rings and Algebras · Mathematics 2007-11-27 R. L. Grossman , R. G. Larson
‹ Prev 1 2 3 10 Next ›