arXiv math/05122272005-12math.COmath.RA

Trees, set compositions and the twisted descent algebra

Frederic Patras, Manfred Schocker

备注：: 32 pages, 14 figures, references added

英文摘要：

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the linear span of set compositions (the twisted descent algebra). Among others, a number of enveloping algebra structures are introduced and studied in detail. For example, it is shown that the linear span of trees carries an enveloping algebra structure and embeds as such in an enveloping algebra of increasing trees. All our constructions arise naturally from the general theory of twisted Hopf algebras.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Twisted descent algebras and the Solomon-Tits algebra

The purpose of the present article is to define and study a new class of descent algebras, called twisted descent algebras. These algebras are associated to the Barratt-Joyal theory of twisted bialgebras in the same way than classical descent algebras are associated to classical bialgebras. The formal properties of twisted descent algebras seem particularly meaningful in view of applications to discrete probabilities, to the geometry of Coxeter groups and buildings, and to symmetric group combinatorics.

2003-10-20math.COmath.RT

Construction and Composition of Rooted Trees via Descent Functions

We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions. Moreover, in this way, we are able to compose rooted trees with each other. Such a new composition of rooted trees is a very powerful tool applied in this paper in order to obtain important results as the creation of new rational and Pythagorean trees.

2014-09-22math.COmath.NT

Sawtooth models and asymptotic independence in large compositions

In this paper we improve the probabilistic approach to compositions of Ehrenborg, Levin and Readdy by introducing a simpler but more general probabilistic model. As consequence we get some new estimates on the behavior of a uniform random permutation $σ$ having a fixed descent set. In particular we show that independently of the shape of the descent set, $σ(i)$ and $σ(j)$ become independent when $i-j$ tends to $+\infty$.

2015-01-26math.COmath.PR

The Hopf algebras of signed permutations, of weak quasi-symmetric functions and of Malvenuto-Reutenauer

This paper builds on two covering Hopf algebras of the Hopf algebra QSym of quasi-symmetric functions, with linear bases parameterized by compositions. One is the Malvenuto-Reutenauer Hopf algebra SSym of permutations, mapped onto QSym by taking descents of permutations. The other one is the recently introduced Hopf algebra RQSym of weak quasi-symmetric functions, mapped onto QSym by extracting compositions from weak compositions. We extend these two surjective Hopf algebra homomorphisms into a commutative diagram by introducing a Hopf algebra HSym, linearly spanned by signed permutations from…

2019-12-29math.COmath.RA

Permuted composition tableaux, 0-Hecke algebra and labeled binary trees

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our primary motivation for studying permuted composition tableaux is to enumerate all possible ordered pairs of permutations $(σ_1,σ_2)$ that can be obtained by standardizing the entries in two adjacent columns of an arbitrary composition tableau. We refer to such pairs as compatible pairs. To study compatible pairs in depth, we define a $0$-Hecke action on permut…

2018-08-28math.CO

Descent sets on 321-avoiding involutions and hook decompositions of partitions

We show that the distribution of the major index over the set of involutions in S_n that avoid the pattern 321 is given by the q-analogue of the n-th central binomial coefficient. The proof consists of a composition of three non-trivial bijections, one being the Robinson-Schensted correspondence, ultimately mapping those involutions with major index m into partitions of m whose Young diagram fits inside an n/2 by n/2 box. We also obtain a refinement that keeps track of the descent set, and we deduce an analogous result for the comajor index of 123-avoiding involutions.

2014-07-24math.CO

更多相关论文收起更多论文

Top to random and reverse：一种新下降代数洗牌的分析

Top to random and reverse: analysis of a new descent algebra shuffle

Drexel University（德雷塞尔大学）；University of Georgia（佐治亚大学）

研究下降代数中 B-basis 元素与置换 $w_0$ 复合的性质，证明其极小多项式可分解为对应 signed knapsack numbers 的线性因子，并给出 top-to-random-and-reverse shuffle 的极小多项式。

2026-10-01math.CO

The topology of restricted partition posets

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with descent composition $\vec{c}$. Furthermore, the action of the symmetric group on the top homology is isomorphic to the Specht module $S^{B}$ where $B$ is a border strip associated to the composition. We also study the filter of pointed set partitions generated by a knapsack integer partition and show the analogous results on homotopy type and action on the top homol…

2013-12-06math.CO