On a family of conjectures of Joel Lewis on alternating permutations
The word permutation is used in its classical sense -- for a string of designated symbols (here integers \(1, 2, \dots\)) without repetitions. A permutation \(p=p_1p_2\dots p_n\) of length \(n\) avoids a permutation \(q=q_1q_2\dots q_k\) of length \(k\) if there are no \(k\) indices \(i_1<i_2<\cdots<i_k\) so that \(p_{i_a}<p_{i_b}\) iff \(q_a<q_b\) \((a,b\in\{1,2,\dots,k\})\); \(p=p_1p_2\dots p_n\) is alternating if \(p_i<p_{i+1}\) iff \(i\) is odd. \(A_n(q)\) denotes the number of alternating permutations of length \(n\) that avoid a permutation \(q\). Theorem 1: Let \(k\geq3\) be an integer, and let \(n\) be an even positive integer. Then we have \(A_n(1,2,\dots,k-2,k-1,k)=A_n(1,2,\dots,k-2,k,k-1)\). This theorem generalizes a conjecture of \textit{J. B. Lewis} [Electron. J. Comb. 19, No. 1, Research Paper P21, 21 p. (2012; Zbl 1243.05011)] that, for all positive integers \(n\), \(A_{2n}(1234)=A_{2n}(1243)\) and \(A_{2n}(12345)=A_{2n}(12354)\). From \S 3: ``Finally, we use a slightly modified version of our argument to prove \(\dots\) Theorem 2: Let \(n\) be any positive integer. Then, for all \(k\), we have \(A_n(1,2,3,\dots,k)=A_n(2,1,3,\dots,k)\). (Unlike Theorem 1, this theorem has no parity restriction on \(n\).)
- Counting 1324, 4231-avoiding permutations
- Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns
- Counting 1324-avoiding permutations
- The number of permutations avoiding a set of generalized permutation patterns
- A new upper bound for 1324-avoiding permutations
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- On (shape-)Wilf-equivalence for words
- scientific article; zbMATH DE number 1504635
- Using functional equations to enumerate 1324-avoiding permutations
- Alternating, pattern-avoiding permutations
- A conjecture of Stanley on alternating permutations
- Even permutations not representable in the form of a product of two permutations of given order
- On a refinement of Wilf-equivalence for permutations
- (q, t)-Catalan numbers: gamma expansions, pattern avoidances, and the (-1)-phenomenon
- On pattern avoiding alternating permutations
- Ascent-descent Young diagrams and pattern avoidance in alternating permutations
- Pattern avoiding alternating involutions
- On refinements of Wilf-equivalence for involutions
- Equidistribution of set-valued statistics on standard Young tableaux and transversals
- Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
- Ordinal and disjoint sums of partially ordered patterns
This page was built for publication: On a family of conjectures of Joel Lewis on alternating permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014704)
