相关论文: Substring compatibility of permutation statistics

The shuffle product has a connection with several useful permutation statistics such as descent and peak, and corresponds to the multiplication operation in the corresponding descent and peak algebras. In their recent work, Gessel and…

Since the early work of Richard Stanley, it has been observed that several permutation statistics have a remarkable property with respect to shuffles of permutations. We formalize this notion of a shuffle-compatible permutation statistic…

Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…

A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…

Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…

The notion of shuffle-compatible permutation statistics was implicit in Stanley's work on P-partitions and was first explicitly studied by Gessel and Zhuang. The aim of this paper is to prove that the triple ${\rm (udr, pk, des)}$ is…

This is a continuation of arXiv:1706.00750 by Gessel and Zhuang (but can be read independently from the latter). We study the shuffle-compatibility of permutation statistics -- a concept introduced in arXiv:1706.00750, although various…

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…

This article approaches the counting of subgraphs, in terms of signature-type functionals defined over combinatorial Hopf algebras of graphs. Well-known algebraic identities that arise in the context of counting subgraphs are then captured…

Let $\mathfrak g$ be a semisimple Lie algebra, $\mathfrak h\subset\mathfrak g$ a reductive subalgebra such that $\mathfrak h^\perp$ is a complementary $\mathfrak h$-submodule of $\mathfrak g$. In 1983, Bogoyavlenski claimed that one obtains…

For a commutative algebra the shuffle product is a morphism of complexes. We generalize this result to the quantum shuffle product, associated to a class of non-commutative algebras (for example all the Hopf algebras). As a first…

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…

We introduce a new Hopf algebra that operates on pairs of finite interval partitions and permutations of equal length. This algebra captures vincular patterns, which involve specifying both the permutation patterns and the consecutive…

In the context of the shuffle theorem, many classical integer sequences appear with a natural refinement by two statistics $q$ and $t$: for example the Catalan and Schr\"oder numbers. In particular, the bigraded Hilbert series of diagonal…

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…

Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…

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…

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…