Have a personal or library account? Click to login
Using large random permutations to partition permutation classes Cover

Using large random permutations to partition permutation classes

Pure Mathematics and Applications
Volume 30 (2022): Issue 1 (June 2022)
By: Christian Bean,  Émile Nadeau,  Jay Pantone and  Henning Ulfarsson  
Open Access
|Jun 2022

References

  1. [1] M. H. Albert, M. D. Atkinson and R. Brignall, The enumeration of permutations avoiding 2143 and 4231, Pure Math. Appl. (PU.M.A), 22 (2011) 87_98.
    Search in Google ScholarBack to article
  2. [2] M. H. Albert, C. Bean, A. Claesson, É. Nadeau, J. Pantone and H. Ulfarsson, Combinatorial Exploration: An algorithmic framework for enumeration, arXiv: 2202.07715.
    Search in Google ScholarBack to article
  3. [3] M. D. Atkinson, Restricted permutations, Discrete Math., 195 (1999) 27–38.
    Search in Google ScholarBack to article
  4. [4] J. West, Generating trees and forbidden subsequences, Discrete Math., 157 (1996) 363–374.
    Search in Google ScholarBack to article
DOI: https://doi.org/10.2478/puma-2022-0006 | Journal eISSN: 1788-800X
Journal RSS Feed
Language: English
Page range: 31 - 36
Submitted on: Mar 31, 2022
Accepted on: May 15, 2022
Published on: Jun 18, 2022
Published by: Corvinus University of Budapest
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
permutation pattern,
random sampling,
clustering
Related subjects:
Computer sciences,
Theoretical computer sciences,
Business and economics,
Mathematics and statistics for economists,
Mathematics,
Mathematics,
Analysis,
Differential equations and dynamical systems

© 2022 Christian Bean, Émile Nadeau, Jay Pantone, Henning Ulfarsson, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 30 (2022): Issue 1 (June 2022)Next article