Jean-Christophe Novelli, Jean-Yves Thibon
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 contains the descent algebra as a left ideal.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula I_n(-1) = E_n, the number of alternating permutations. We give a combinatorial proof of these formulas based on the involution principle. We also give a geometric interpretation of these identities in terms of volumes of generalized chain polyto…
On some discrete statistics of parking functions
本文研究停车函数的上升、下降、持平及峰值等离散统计量，给出计数生成函数、递归公式、对称性及无峰无持平情形下的卡特兰数枚举，并刻画统计编码唯一性。
The Chow Polynomial of the Noncrossing Partition Lattice
该研究证明非交叉分拆格的周多项式等于无约束停车函数的下降生成函数，进而得到停车函数下降统计量的新结果。
Real-rootedness and interlacing for parking functions and Chow polynomials
该研究通过转换泊车函数与斯米尔诺夫字的关系，结合递推关系证明了非交叉分拆格Chow多项式等的实根性，解决了相关猜想并得到多个多项式的实根性结论。
We introduce analogs of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. When the color set is a semigroup, an internal product can be introduced. This leads to the construction of generalized descent algebras associated with wreath products $Γ\wr\SG_n$ and to the corresponding generalizations of quasi-symmetric functions. The associated Hopf algebras appear as natural analogs of McMahon's multisymmetric functions. As a consequence, we obtain an internal product on ordinary multi-symmetric functions. We extend these constructions to Hopf algebras …
If the moments of a probability measure on $\R$ are interpreted as a specialization of complete homogeneous symmetric functions, its free cumulants are, up to sign, the corresponding specializations of a sequence of Schur positive symmetric functions $(f_n)$. We prove that $(f_n)$ is the Frobenius characteristic of the natural permutation representation of $\SG_n$ on the set of prime parking functions. This observation leads us to the construction of a Hopf algebra of parking functions, which we study in some detail.
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 $\mathbb{K}\mathcal{P}$. The product and coproduct of PQSym$^{*}$ are analogous to the product and coproduct of the Hopf algebra NCSym of symmetric functions in noncommuting variables defined in terms of the power sum basis. In this paper, we view a parking function as a word. We shall construct a Hopf algebra PFSym on $\mathbb{K}\mathcal{P}$ with a formal basis $\{M_a\}$ analogo…
Parking functions with a fixed set of lucky cars
该研究刻画了固定幸运车集合的停车函数对应的停车结果集合，推导其数量公式，覆盖车位数等于或多于车辆数的情况，还给出弱递增停车函数的数量乘积公式。
Tiered tree, Parking function and Postnikov-Shapiro algebra
本文研究分层树、图论停车函数与 Postnikov-Shapiro 代数，建立平行四边形多联骨牌与图论停车函数的双射，并定义完全分层图上的 $\mathcal{S}_{G}$ 空间及用 Whitney 运算刻画分层图。
On statistics of prime parking functions, Łukasiewicz paths, and quasisymmetric functions
本文研究了素停车函数的统计特性，推导了位移平均值公式，并建立了Schur函数与拟对称函数之间的联系。
Shuffle-compatibility for combinatorial statistics on words, parking functions, and set partitions
研究单词、停车函数和集合划分上统计量的洗牌兼容性，推广排列统计量的洗牌兼容性概念。系统回顾相关统计量，定义洗牌代数，其与多种组合霍普夫代数相关，能给出霍普夫代数基新解释及新基。
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 structure, and show that it admits natural quotients and subalgebras whose graded components have dimensions respectively given by the Schroder numbers (plane trees), the Catalan numbers, and powers of 3. These smaller algebras are always bialgebras and belong to some family of di- or tri-algebras occuring in the works of Loday and Ronco. Moreover, the fundament…
We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products $Γ\wr\SG_n$ and the corresponding generalizations of quasi-symmetric functions. Also, we obtain Hopf algebras of colored parking functions, colored non-crossing partitions and parking functions of type $B$.
The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the Loday-Ronco Hopf algebra of planar binary trees. We introduce new combinatorial Hopf algebras based on (m+1)-ary trees, whose structure is described by the m-Tamari lattices. In the same way as planar binary trees can be interpreted as sylvester classes of permutations, we obtain (m+1)-ary trees as sylvester classes of what we call m-permutations. These obje…
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 Malvenuto-Reutenauer Hopf algebras respectively. We show that the latter is bidendriform which implies that is also free, cofree, and self-dual. The third algebra involves a new visualization of parking functions as decorated binary trees; it is also bidendriform, free, cofree, and self-dual, and therefore abstractly isomorphic to the algebra PQSym of Novelli and Thibon. We…
We introduce several associative algebras and series of vector spaces associated to these algebras. Using lattice vertex operators, we obtain dimension and character formulae for these spaces. In particular, we a series of representations of symmetric groups which turn out to be isomorphic to parking function modules. We also construct series of vector spaces whose dimensions are Catalan numbers and Fuss--Catalan numbers respectively. Conjecturally, these spaces are related to spaces of global sections of vector bundles on (zero fibres of) Hilbert schemes and representations of rational Chered…
On Cycles in Multiset Permutations, Parking Functions, and Related Structures
本文研究多重集排列和停车函数中的环，通过代数和分析方法给出精确与渐近结果，并揭示终端闭包与循环点之间的意外对应关系。
We provide operadic interpretations for two Hopf subalgebras of the algebra of parking functions. The Catalan subalgebra is identified with the free duplicial algebra on one generator, and the Schröder subalgebra is interpreted by means of a new operad, which we call triduplicial. The noncommutative Lagrange inversion formula is then interpreted in terms of duplicial structures. The generic solution of the noncommutative inversion problem appears as the formal sum of all parking functions. This suggests that combinatorial generating functions derived by functional inversion should be obtainabl…
Results on pattern avoidance in parking functions
本文研究停车函数中两种模式回避概念，计算回避长度为3模式的停车函数数量，提供新双射证明并改进公式，同时计算广义停车函数Hopf代数的分次维度。
The Dyck path algebra construction of Carlsson and Mellit from arXiv:1508.06239 is interpreted as a representation of "the positive part" of the group of toric braids. Then certain sums over $(m,n)$-parking functions are related to evaluations of this representation on some special braids. The compositional $(km,kn)$-shuffle conjecture of Bergeron, Garsia, Leven and Xin from arXiv:1404.4616 is then shown to be a corollary of this relation.
For a graph G, we construct two algebras, whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis elements correspond to G-parking functions that naturally came up in the abelian sandpile model. These ideals are instances of the general class of monotone monomial ideals and their deformations. We sh…
If $A$ is a subset of the set of reflections of a finite Coxeter group $W$, we define a sub-${\mathbb{Z}}$-module ${\mathcal{D}}_A(W)$ of the group algebra ${\mathbb{Z}} W$. We provide examples where this submodule is a subalgebra. This family of subalgebras includes strictly the Solomon descent algebra and, if $W$ if of type $B$, the Mantaci-Reutenauer algebra.
A Coxeter group of classical type $A_n$, $B_n$ or $D_n$ contains a chain of subgroups of the same type. We show that intersections of conjugates of these subgroups are again of the same type, and make precise in which sense and to what extent this property is exclusive to the classical types of Coxeter groups. As the main tool for the proof we use Solomon's descent algebra. Using Stirling numbers, we express certain basis elements of the descent algebra as polynomials and derive explicit multiplication formulas for a commutative subalgebra of the descent algebra.
Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon's descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types $A$,$B$,$C$, $H_3$, and rank two groups. Both notions have the same, simple eigenvalues. The hyperplane definition is especially natural and satisfies a positivity property when $W$ is crystallographic and the relevant parameter is a good prime. The hyperplane viewpoint suggests interesting connections with Lie theory and leads to a notion of riffle shuffling for arbitrary real hyperplane arrangeme…
Odd Shifted Parking Functions
本文引入奇移位停车函数，为 Stanley 的移位停车函数对称函数 $SH_n$ 的 $V$-基展开提供组合与表示论实现，并将其解释为射影表示的旋量特征。
Parking functions and chip-firing on hypergraphs
本文将图上的停车函数与筹码发射概念扩展至超图，定义了超图停车函数，证明其极大序列由无环定向刻画，且可由$q$-根生成树计数，并揭示了其与超图筹码发射超稳定构型的等价关系。
Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$. We outline an efficient bijective proof of this theorem, by studying a canonical finite abelian group attached to $G$ whose order is equal to the value of same matrix determinant. More specifically, we show how one can efficiently compute a bijection between the group elements and the spanning trees of the graph. The main ingredient for computing the bijection is an efficient algorithm for finding the unique $G$-parking function (reduce…
We prove that the group algebra of the hyperoctahedral group contains a subalgebra corresponding to the flag descent number of Adin, Brenti, and Roichman. This algebra is in fact the span of the basis elements of the type A and type B Eulerian descent algebras. We describe a set of orthogonal idempotents which spans the flag descent algebra and prove that it contains the type A Eulerian descent algebra as a two-sided ideal. Using a new colored analogue of Stanley's $P$-partitions, we prove the existence of a colored Eulerian descent algebra which is a subalgebra of the Mantaci-Reutenauer algeb…
We describe a presentation for the descent algebra of the symmetric group $\sym{n}$ as a quiver with relations. This presentation arises from a new construction of the descent algebra as a homomorphic image of an algebra of forests of binary trees which can be identified with a subspace of the free Lie algebra. In this setting, we provide a new short proof of the known fact that the quiver of the descent algebra of $\sym{n}$ is given by restricted partition refinement. Moreover, we describe certain families of relations and conjecture that for fixed $n\in\mathbb{N}$, the finite set of relation…
Using a new colored analogue of P-partitions, we prove the existence of a colored Eulerian descent algebra which is a subalgebra of the Mantaci-Reutenauer algebra. This algebra has a basis consisting of formal sums of colored permutations with the same number of descents (using Steingrímsson's definition of the descent set of a colored permutation). The colored Eulerian descent algebra extends familiar Eulerian descent algebras from the symmetric group algebra and the hyperoctahedral group algebra to colored permutation group algebras. We also describe a set of orthogonal idempotents that span…
The concept of descent algebras over a field of characteristic zero is extended to define descent algebras over a field of prime characteristic. Some basic algebraic structure of the latter, including its radical and irreducible modules, is then determined. The decomposition matrix of the descent algebras of Coxeter group types $A$, $B$, and $D$ are calculated, and used to derive a description of the decomposition matrix of an arbitrary descent algebra. The Cartan matrix of a variety of descent algebras over a finite field is then obtained.
We establish simple combinatorial descriptions of the radical and irreducible representations specifically for the descent algebra of a Coxeter group of type $D$ over any field.
Here we give a combinatorial interpretation of Solomon's rule for multiplication in the descent algebra of Weyl groups of type $D$, $ΣD_n$. From here we show that $ΣD_n$ is a homomorphic image of the descent algebra of the hyperoctahedral group, $ΣB_{n-2}$.
The descent algebra of the symmetric group, over a field of non-zero characteristic p, is studied. A homomorphism into the algebra of generalised p-modular characters of the symmetric group is defined. This is then used to determine the radical, and its nilpotency index. It also allows the irreducible representations of the descent algebra to be described.
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.
The number of alternating runs is a natural permutation statistic. We show it can be used to define some commutative subalgebras of the symmetric group algebra, and more precisely of the descent algebra. The Eulerian peak algebras naturally appear as subalgebras of our run algebras. We also calculate the orthogonal idempotents for run algebras in terms of noncommutative symmetric functions.
We construct a subalgebra of dimension $2.3^{n-1}$ of the group algebra of a Weyl group of type $B_n$ containing its Solomon descent's algebra but also the Solomon's descent algebra of the symmetric group. This lead us to a construction of the irreducible characters of the hyperoctahedral groups by using a generalized plactic equivalence.
Combinatorics of descent algebras and graph coverings
本文通过将下降类赋予弱序图结构并利用群乘积的覆盖映射性质，给出了对称群中下降类乘积为下降类之和的直接组合证明，并将几何论证推广到任意 Coxeter 群。
Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative symmetric functions and quasi-symmetric functions.
We refine a conjecture by Lehrer and Solomon on the structure of the Orlik-Solomon algebra of a finite Coxeter group $W$ and relate it to the descent algebra of $W$. As a result, we claim that both the group algebra of $W$, as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of element centralizers, one for each conjugacy class of elements of $W$. We give a uniform proof of the claim for symmetric groups. In addition, we prove that a relative version of the conjecture holds for every pair $(W, W_L)$, where $W$ is arbitrary and $W_…
Louis Solomon showed that the group algebra of the symmetric group $\mathfrak{S}_{n}$ has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In fact, he showed that every Coxeter group has something that can be called a descent algebra. There is also a commutative, semisimple subalgebra of Solomon's descent algebra generated by sums of permutations with the same number of descents: an "Eulerian" descent algebra. For any Coxeter group that is also a Weyl group, Paola Cellini proved the existence of a different Eulerian subalgebra based on a modi…
We study the quiver of the descent algebra of a finite Coxeter group W. The results include a derivation of the quiver of the descent algebra of types A and B. Our approach is to study the descent algebra as an algebra constructed from the reflection arrangement associated to W.
In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each conjugacy class of elements of $W$, and gave a uniform proof of this claim for symmetric groups. In this note we outline an inductive approach to our conjecture. As an application of this method, we prove the inductive version of the conjecture for finite Coxeter groups of rank up to 2.
Lascoux series, parking functions and noncrossing partitions
本文针对特定排列得到拉斯科多项式的组合解释，发现其与A_{n-1}型考克斯特群非交叉分拆格序复形的h多项式一致，据此提出任意有限考克斯特群h多项式的算子方法，解决了相关公开问题并得到k可除非交叉分拆h多项式的交错对称分解性质。
The Loewy length of the descent algebra of type D_{2m+1} is shown to be m+2, for m \geq 2, by providing an upper bound that agrees with the lower bound in \cite{BonnafePfeiffer2006}. The bound is obtained by showing that the length of the longest path in the quiver of the descent algebra of D_{2m+1} is at most m+1. To achieve this bound, the geometric approach to the descent algebra is used, in which the descent algebra of a finite Coxeter group is identified with an algebra associated to the reflection arrangement of the group.
Given a graph $G$, the $G$-parking function ideal $M_G$ is an artinian monomial ideal in the polynomial ring $S$ with the property that a linear basis for $S/M_G$ is provided by the set of $G$-parking functions. It follows that the dimension of $S/M_G$ is given by the number of spanning trees of $G$, which by the Matrix Tree Theorem is equal to the determinant of the reduced Laplacian of $G$. The ideals $M_G$ and related algebras were introduced by Postnikov and Shapiro where they studied their Hilbert functions and homological properties. The author and Sanyal showed that a minimal resolution…
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial ideal in the polynomial ring $S = {\mathbb K}[x_1, \dots, x_n]$ where a set of generators are indexed by the nonempty subsets of $[n] = \{1,2,\dots,n\}$. Motivated by constructions from the theory of chip-firing on graphs we study generalizations of parking functions determined by $M^{(k)}_n$, a subideal of $M_n$ obtained by allowing only generators correspo…
We compute the noncommutative Frobenius characteristic of the natural action of the 0-Hecke algebra on parking functions, and obtain as corollaries various forms of the noncommutative Lagrange inversion formula.
The descent algebra of finite Coxeter groups is studied by many famous mathematicians like Bergeron, Brown, Howlett, or Reutenauer. Blessenohl, Hohlweg, and Schocker, for example, proved a symmetry property of the descent algebra, when it is linked to the representation theory of its Coxeter group. The interest is particularly showed for the descent algebra of symmetric group. Thibon determined the eigenvalues and their multiplicities of the action on the group algebra of symmetric group of the descent algebra element, which is the sum over all permutations weighted by q^maj. And even the auth…
Introduced by Solomon in his 1976 paper, the descent algebra of a finite Coxeter group received significant attention over the past decades. As proved by Gessel, in the case of the symmetric group its structure constants give the comultiplication table for the fundamental basis of quasisymmetric functions. We show that this property actually implies several well known relations linked to the Robinson-Schensted-Knuth correspondence and some of its generalisations. We further use the theory of type B quasisymmetric functions introduced by Chow to provide analogue results when the Coxeter group i…
We show the existence of a unital subalgebra of the symmetric group algebra linearly spanned by sums of permutations with a common peak set, which we call the peak algebra. We show that this algebra is the image of the descent algebra of type B under the map to the descent algebra of type A which forgets the signs, and also the image of the descent algebra of type D. The peak algebra contains a two sided ideal which is defined in terms of interior peaks. This object was introduced in previous work by Nyman; we find that it is the image of certain ideals of the descent algebras of types B and D…
Extending the descent-to-peak map and its applications
本文通过下降到峰映射证明标准Young表的峰谷集等分布，并引入新的shuffle基，扩展了峰代数和下降到峰映射到shuffle、张量和对称代数。
The descent algebra of a finite Coxeter group $W$ is a basic algebra, and as such it has a presentation as quiver with relations. In recent work, we have developed a combinatorial framework which allows us to systematically compute such a quiver presentation for a Coxeter group of a given type. In this article, we use that framework to determine quiver presentations for the descent algebras of the Coxeter groups of exceptional or non-crystallographic type, i.e., of type $E_6$, $E_7$, $E_8$, $F_4$, $H_3$, $H_4$ or $I_2(m)$.
In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of a finite Coxeter group $W$ acting on the $p$th graded component of its Orlik-Solomon algebra as a sum of characters induced from linear characters of centralizers of elements of $W$. Our refined conjecture relates the character above to a component of a decomposition of the regular character of $W$ related to Solomon's descent algebra of $W$. The refined conjecture has been proved for symmetric and dihedral groups, as well as finite Coxeter groups of rank three and four. In this paper, the second in…
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 g…
The coinvariant algebra $R_n$ is a well-studied $\mathfrak{S}_n$-module that is a graded version of the regular representation of $\mathfrak{S}_n$. Using a straightening algorithm on monomials and the Garsia-Stanton basis, Adin, Brenti, and Roichman gave a description of the Frobenius image of $R_n$, graded by partitions, in terms of descents of standard Young tableaux. Motivated by the Delta Conjecture of Macdonald polynomials, Haglund, Rhoades, and Shimozono gave an extension of the coinvariant algebra $R_{n,k}$ and an extension of the Garsia-Stanton basis. Chan and Rhoades further extend th…
In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear characters of centralizers of elements of $W$. Our refined conjecture also relates the Orlik-Solomon characters above to the terms of a decomposition of the regular character of $W$ related to the descent algebra of $W$. A consequence of our conjecture is that both the regular character of $W$ and the character of the Orlik-Solomon algebra have parallel, graded de…
The descent algebra $Σ(W)$ is a subalgebra of the group algebra $\Q W$ of a finite Coxeter group $W$, which supports a homomorphism with nilpotent kernel and commutative image in the character ring of $W$. Thus $Σ(W)$ is a basic algebra, and as such it has a presentation as a quiver with relations. Here we construct $Σ(W)$ as a quotient of a subalgebra of the path algebra of the Hasse diagram of the Boolean lattice of all subsets of $S$, the set of simple reflections in $W$. From this construction we obtain some general information about the quiver of $Σ(W)$ and an algorithm for the constructi…
We develop the homology theory of the algebra of a regular semigroup, which is a particularly nice case of a quasi-hereditary algebra in good characteristic. Directedness is characterized for these algebras, generalizing the case of semisimple algebras studied by Munn and Ponizovksy. We then apply homological methods to compute (modulo group theory) the quiver of a right regular band of groups, generalizing Saliola's results for a right regular band. Right regular bands of groups come up in the representation theory of wreath products with symmetric groups in much the same way that right regul…
In the work of Varchenko, Zagier, Thibon, and Reiner, Saliola, Welker, linear algebraic properties of the multiplication map on the group algebra of the group algebra element are studied, which is the sum over all permutations weighted by q^{inv}, q^{maj}, inv. Here q is a variable, and inv and maj are the classical statistics inversion and major index. We define a multinomial descent statistic des_X and a multinomial inversion statistic inv_X. These new defined statistics are the multinomial expressions of the classical statistics descent des and inversion. We determine the spectrum and the m…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。