Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2001.00280

Permutations, moments, measures

Natasha Blitvić·Einar Steingrímsson
View original source ↗Read source document ↗Export metadata ↓

Abstract

Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in terms of combinatorial statistics on the symmetric groups. Special cases include several classical and noncommutative probability laws, along with a substantial subset of the orthogonalizing measures in the q-Askey scheme, now given a new combinatorial interpretation in terms of elementary permutation statistics. This framework further captures a variety of interesting combinatorial sequences including, notably, the moment sequences associated to distributions of the numbers of occurrences of (classical and vincular) permutation patterns of length three. This connection between pattern avoidance and broader ideas in classical and noncommutative probability is among several intriguing new corollaries, which generalize and unify results previously appearing in the literature, while opening up new lines of inquiry. The fourteen combinatorial statistics further generalize to signed and colored permutations, and, as an infinite family of statistics, to the k-arrangements: permutations with k-colored fixed points, introduced here along with several related results and conjectures.

Explore related subjects

math.COmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Natasha Blitvić, Einar Steingrímsson. 2020-10-07. Permutations, moments, measures. https://arxiv.org/abs/2001.00280

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗