Search arXivSearch

arXiv · 1809.07465

Joint Distributions of Permutation Statistics and the Parabolic Cylinder Functions

Abstract

In this paper, we introduce a context-free grammar $G\colon x \rightarrow xy,\, y \rightarrow zu,\, z \rightarrow zw,\, w \rightarrow xv,\, u \rightarrow xyz^{-1}v,\, v \rightarrow x^{-1}zwu$ over the variable set $V=\{x,y,z,w,u,v\}$. We use this grammar to study joint distributions of several permutation statistics related to descents, rises, peaks and valleys. By considering the pattern of an exterior peak, we introduce the exterior peaks of pattern 132 and of pattern 231. Similarly, peaks can also be classified according to their patterns. Let $D$ be the formal derivative operator with respect to the grammar $G$. By using a grammatical labeling, we show that $D^n(z)$ is the generating function of the number of permutations on $[n]=\{1,2,\ldots,n\}$ with given numbers of exterior peaks of pattern 132 and of pattern 231, and proper double descents. By solving a cylinder differential equation, we obtain an explicit formula of the generating function of $D^n(z)$, which can be viewed as a unification of the results of Elizalde-Noy, Barry, Basset, Fu and Gessel. Specializations lead to the joint distributions of certain consecutive patterns in permutations, as studied by Elizalde-Noy and Kitaev. By a different labeling with respect to the same grammar $G$, we derive the joint distribution of peaks of pattern 132 and of pattern 231, double descents and double rises, with the generating function also expressed by the parabolic cylinder functions. This formula serves as a refinement of the work of Carlitz-Scoville. Furthermore, we obtain the joint distribution of exterior peaks of pattern 132 and of pattern 231 over alternating permutations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amy M. Fu, Frank Z. K. Li. 2018-09-20. Joint Distributions of Permutation Statistics and the Parabolic Cylinder Functions. https://arxiv.org/abs/1809.07465

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