Counting and generating permutations in regular classes
DOI10.1007/S00453-016-0136-9zbMATH Open1352.05005OpenAlexW2301044752MaRDI QIDQ727971FDOQ727971
Authors: Nicolas Basset 
Publication date: 21 December 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0136-9
Recommendations
- Counting and Generating Permutations Using Timed Languages
- Generating permutations with given ups and downs
- scientific article; zbMATH DE number 3865284
- Generating restricted classes of involutions, Bell and Stirling permutations
- Signatures des permutations et des mots extraits. (Signatures of permutations and extracted words)
timed automataexponential generating functionBoltzmann samplingregular class of permutationssignature of a permutationuniform random sampling
Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Analytic combinatorics
- Introduction to algorithms.
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Two poset polytopes
- A theory of timed automata
- A survey of alternating permutations
- Title not available (Why is that?)
- Patterns in permutations and words.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consecutive patterns in permutations
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- A calculus for the random generation of labelled combinatorial structures
- Permutations ayant une forme donnée
- A spectral approach to consecutive pattern-avoiding permutations
- Uniform random generation of decomposable structures using floating-point arithmetic
- Multi-dimensional Boltzmann sampling of languages
- A new dichotomic algorithm for the uniform random generation of words in regular languages
- Title not available (Why is that?)
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
- Unimodular equivalence of order and chain polytopes
- Descent pattern avoidance
- On the frequencies of patterns of rises and falls
- Entropy of regular timed languages
- A linear algorithm for the random sampling from regular languages
- Generating Functions of Timed Languages
- Inverting Polynomials and Formal Power Series
- Counting and Generating Permutations Using Timed Languages
Cited In (11)
- Rollercoasters and caterpillars
- Permutation classes
- Regular languages of plus- and minus-(in)decomposable permutations
- A counting scheme and some algebraic properties of a class of special permutation patterns
- Finding and counting permutations via CSPs
- Finding regular insertion encodings for permutation classes
- Title not available (Why is that?)
- Young tableaux with periodic walls: counting with the density method
- Rollercoasters: Long Sequences without Short Runs
- Generating Countable Sets of Permutations
- Max-entropy sampling for deterministic timed automata under linear duration constraints
Uses Software
This page was built for publication: Counting and generating permutations in regular classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727971)
