Search arXivSearch

arXiv · 2106.04348

Quasi-Stirling Permutations on Multisets

Abstract

A permutation $π$ of a multiset is said to be a {\em quasi-Stirling } permutation if there does not exist four indices $i<j<k<\ell$ such that $π_i=π_k$ and $π_j=π_{\ell}$. Define $$ \overline{Q}_{\mathcal{M}}(t,u,v)=\sum_{π\in \overline{\mathcal{Q}}_{\mathcal{M}}}t^{des(π)}u^{asc(π)}v^{plat(π)},$$ where $\overline{\mathcal{Q}}_{\mathcal{M}}$ denotes the set of quasi-Stirling permutations on the multiset $\mathcal{M}$, and $asc(π)$ (resp. $des(π)$, $plat(π)$) denotes the number of ascents (resp. descents, plateaux) of $π$. Denote by $\mathcal{M}^σ$ the multiset $\{1^{σ_1}, 2^{σ_2}, \ldots, n^{σ_n}\}$, where $σ=(σ_1, σ_2, \ldots, σ_n)$ is an $n$-composition of $K$ for positive integers $K$ and $n$. In this paper, we show that $\overline{Q}_{\mathcal{M}^σ}(t,u,v)=\overline{Q}_{\mathcal{M}^τ}(t,u,v)$ for any two $n$-compositions $σ$ and $τ$ of $K$. This is accomplished by establishing an $(asc, des, plat)$-preserving bijection between $\overline{\mathcal{Q}}_{\mathcal{M}^σ}$ and $\overline{\mathcal{Q}}_{\mathcal{M}^τ}$. As applications, we obtain generalizations of several results for quasi-Stirling permutations on $\mathcal{M}=\{1^k,2^k, \ldots, n^k\}$ obtained by Elizalde and solve an open problem posed by Elizalde.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sherry H. F. Yan, Lihong Yang, Yunwei Huang, Xue Zhu. 2021-06-08. Quasi-Stirling Permutations on Multisets. https://arxiv.org/abs/2106.04348

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO