Related papers: A Counter Example to the Shuffle Compatiblity Conj…
Stirling permutations were introduced by Gessel and Stanley, who used their enumeration by the number of descents to give a combinatorial interpretation of certain polynomials related to Stirling numbers. Quasi-Stirling permutations, which…
We study the shifted convolution sums associated to completely multiplicative functions taking values in $\{\pm 1\}$ and give combinatorical proofs of two recent results in the direction of Chowla's conjecture. We also determine the…
It is known that there are infinitely many singularities of multiple zeta functions and the special values at non-positive integer points are indeterminate. In order to give a suitable rigorous meaning of the special values there, Furusho,…
We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…
We here construct an explicit isomorphism between any commutative Hopf algebra which underlying coalgebra is the tensor coalgebra of a space $V$ and the shuffle algebra based on the same space. This isomorphism uses the commutative…
The study of toppling on permutations with an extra labeled chip was initiated by the first author with D. Hathcock and P. Tetali (arXiv:2010.11236), where the extra chip was added in the middle. We extend this to all possible locations $p$…
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.…
A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…
We develop a connection between mixture and envelope representations of objective functions that arise frequently in statistics. We refer to this connection using the term "hierarchical duality." Our results suggest an interesting and…
The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also…
We construct a new operation among representations of the symmetric group that interpolates between the classical internal and external products, which are defined in terms of tensor product and induction of representations. Following…
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…
A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…
Using a characterization of Mutual Complete Dependence copulas, we show that, with respect to the Sobolev norm, the MCD copulas can be approximated arbitrarily closed by shuffles of Min. This result is then used to obtain a characterization…
We develop a numerical approach for computing the additive, multiplicative and compressive convolution operations from free probability theory. We utilize the regularity properties of free convolution to identify (pairs of) `admissible'…
The metric-adjusted skew information establishes a connection between the geometrical formulation of quantum statistics and the measures of quantum information. We study uncertainty relations in product and summation forms of…
We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…
We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
Multiple Dedekind zeta values were recently defined by the second author. In a separate paper, the second author constructed double shuffle relations in some cases as a response to questions asked by Richard Hain and Alexander Goncharov. In…