The initial involution patterns of permutations

MaRDI QIDQ870051zbMATH OpenFDO

Authors Dongsu Kim, Jang Soo Kim

Publication date 12 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127265, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r2.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generating function

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Review text

Summary: For a permutation \(\pi=\pi_1\pi_2\cdots\pi_n \in S_n\) and a positive integer \(i\leq n\), we can view \(\pi=\pi_1\pi_2\cdots\pi_i\) as an element of \(S_i\) by order-preserving relabeling. The \(j\)-set of \(\pi\) is the set of \(i\)'s such that \(\pi=\pi_1\pi_2\cdots\pi_i\) is an involution in \(S_i\). We prove a characterization theorem for \(j\)-sets, give a generating function for the number of different \(j\)-sets of permutations in \(S_n\). We also compute the number of permutations in \(S_n\) with a given \(j\)-set and prove some properties of them.

Recommendations

• Permutation statistics on involutions
• Characteristic Numbers of Permutations
• scientific article; zbMATH DE number 5904287
• Refined restricted involutions
• Involutions and their progenies

Cited in

(1)

• \(q\)-analog of tableau containment

This page was built for publication: The initial involution patterns of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870051)