Search arXivSearch

arXiv · 1510.07190

Descent c-Wilf Equivalence

Abstract

Let $S_n$ denote the symmetric group. For any $σ\in S_n$, we let $\mathrm{des}(σ)$ denote the number of descents of $σ$, $\mathrm{inv}(σ)$ denote the number of inversions of $σ$, and $\mathrm{LRmin}(σ)$ denote the number of left-to-right minima of $σ$. For any sequence of statistics $\mathrm{stat}_1, \ldots \mathrm{stat}_k$ on permutations, we say two permutations $α$ and $β$ in $S_j$ are $(\mathrm{stat}_1, \ldots \mathrm{stat}_k)$-c-Wilf equivalent if the generating function of $\prod_{i=1}^k x_i^{\mathrm{stat}_i}$ over all permutations which have no consecutive occurrences of $α$ equals the generating function of $\prod_{i=1}^k x_i^{\mathrm{stat}_i}$ over all permutations which have no consecutive occurrences of $β$. We give many examples of pairs of permutations $α$ and $β$ in $S_j$ which are $\mathrm{des}$-c-Wilf equivalent, $(\mathrm{des},\mathrm{inv})$-c-Wilf equivalent, and $(\mathrm{des},\mathrm{inv},\mathrm{LRmin})$-c-Wilf equivalent. For example, we will show that if $α$ and $β$ are minimally overlapping permutations in $S_j$ which start with 1 and end with the same element and $\mathrm{des}(α) = \mathrm{des}(β)$ and $\mathrm{inv}(α) = \mathrm{inv}(β)$, then $α$ and $β$ are $(\mathrm{des},\mathrm{inv})$-c-Wilf equivalent.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Quang T. Bach, Jeffrey B. Remmel. 2017-02-28. Descent c-Wilf Equivalence. https://doi.org/10.46298/dmtcs.1312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO