相关论文: Substring compatibility of permutation statistics

Given a locally finite graded set A and a commutative, associative operation on A that adds degrees, we construct a commutative multiplication * on the set of noncommutative polynomials in A which we call a quasi-shuffle product; it can be…

The classical quasi-shuffle algebra for multiple zeta values have a well-known Hopf algebra structure. Recently, the shuffle algebra for multiple zeta values are also equipped with a Hopf algebra structure. This paper shows that these two…

The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…

This paper offers a Hopf algebraic interpretation of a functional equation of multiple zeta functions, motivated by the classical symmetry of the Riemann zeta function. Starting from the extended shuffle algebra that encodes multiple zeta…

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…

The algebra of multiple zeta values (MZVs) is encoded as a stuffle (quasi-shuffle) algebra and a shuffle algebra. The MZV stuffle algebra has a natural Hopf algebra structure. This paper equips a Hopf algebra structure to the MZV shuffle…

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…

We define the ``shift-match number'' for a binary string and we compute the probability of occurrence of a given string as a subsequence in longer strings in terms of its shift-match number. We thus prove that the string matching…

We consider multiple polylogarithms in a single variable at non-positive integers. Defining a connected graded Hopf algebra, we apply Connes' and Kreimer's algebraic Birkhoff decomposition to renormalize multiple polylogarithms at…

Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors of a similarity matrix. It often outperforms traditional clustering algorithms such as $k$-means when the structure of the individual…

A large family of relations among multiple zeta values may be described using the combinatorics of shuffle and quasi-shuffle algebras. While the structure of shuffle algebras have been well understood for some time now, quasi-shuffle…

For a set of permutation patterns $\Pi$, let $F^\text{st}_n(\Pi,q)$ be the st-polynomial of permutations avoiding all patterns in $\Pi$. Suppose $312\in\Pi$. For a class of permutation statistics which includes inversion and descent…

This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order…

We give shuffle algebra realization of positive part of quantum affine superalgebra $U_{v}(\widehat{\mathfrak{D}}(2,1;\theta))$ associated to any simple root systems. We also determine the shuffle algebra associated to…

Shannon's entropy is a definitive lower bound for statistical compression. Unfortunately, no such clear measure exists for the compressibility of repetitive strings. Thus, ad hoc measures are employed to estimate the repetitiveness of…

Using cocommutativity of the Hopf algebra of symmetric functions, certain skew Schur functions are proved to be equal. Some of these skew Schur function identities are new.

We present a proof of the compositional shuffle conjecture, which generalizes the famous shuffle conjecture for the character of the diagonal coinvariant algebra. We first formulate the combinatorial side of the conjecture in terms of…

This is a study on pattern Hopf algebras in combinatorial structures. We introduce the notion of combinatorial presheaf, by adapting the algebraic framework of species to the study of substructures in combinatorics. Afterwards, we consider…

Hopf algebras, most generally in a semisimple abelian symmetric monoidal category, are here supposed to be commutative but not to be of finite-type, and their (equivariant) smoothness are discussed. Given a Hopf algebra $H$ in a category…

A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…