The maximal length of a k-separator permutation

zbMATH Open1300.05013MaRDI QIDQ405306FDOQ405306

Authors: Benjamin Gunby 

Publication date: 4 September 2014

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p19

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

Recommendations

• The enumeration of permutations whose posets have a maximum element
• On \(k\)-neighbor separated permutations
• scientific article; zbMATH DE number 1222152
• On the number of permutations on \(n\) objects with greatest cycle length \(k\)
• Permutations in two dimensions that maximally separate neighbors
• Maximum size of reverse-free sets of permutations
• The \(k\)-separator problem
• On the distribution of the mth maximal cycle lengths of random A-permutations
• scientific article; zbMATH DE number 1811347
• K-permutivity

zbMATH Keywords

permutationspattern containment

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20)

Cites Work

• Title not available (Why is that?)
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Asymptotic bounds for permutations containing many different patterns
• Permutations all of whose patterns of a given length are distinct

Cited In (5)

• Modified Galerkin method for the second order equation of mixed type and estimate of its error
• Maximal total absolute displacement of a permutation
• Prolific permutations and permuted packings: downsets containing many large patterns
• On \(k\)-neighbor separated permutations
• Permutations all of whose patterns of a given length are distinct

This page was built for publication: The maximal length of a \(k\)-separator permutation

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