Generating linear extensions of posets by transpositions
From MaRDI portal
Publication:2368024
Cites work
- scientific article; zbMATH DE number 3896963 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 4128814 (Why is no real title available?)
- A structured program to generate all topological sorting arrangements
- Adjacent interchange generation of combinations
- An algorithm to generate all topological sorting arrangements
- Generating binary trees by transpositions
- Generating the Linear Extensions of Certain Posets by Transpositions
- Generation of Permutations by Adjacent Transposition
- Gray codes with restricted density
- Lexicographic permutations with restrictions
- Minimizing bumps for posets of width two
- Minimizing bumps in linear extensions of ordered sets
- On the generation of all topological sortings
- One hundred problems in elementary mathematics. With a foreword by Martin Gardner
- Optimal Linear Extensions by Interchanging Chains
- Permutation by Adjacent Interchanges
- Solution of some multi-dimensional lattice path parity difference recurrence relations
- Some Hamilton Paths and a Minimal Change Algorithm
- The Jump Number of Dags and Posets: An Introduction
- Transposition generation of alternating permutations
Cited in
(20)- Sign-balanced posets
- Gray code enumeration of families of integer partitions
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- On the sign-imbalance of skew partition shapes
- Gray codes from antimatroids
- On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
- Finding parity difference by involutions
- On arrangements of roots for a real hyperbolic polynomial and its derivatives
- Iterative properties of birational rowmotion. I: Generalities and skeletal posets.
- scientific article; zbMATH DE number 65462 (Why is no real title available?)
- Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections
- Some remarks on sign-balanced and maj-balanced posets
- On the probability that a random subtree is spanning
- Mining posets from linear orders.
- Signed Mahonians
- Signed differential posets and sign-imbalance
- Constructing greedy linear extensions by interchanging chains
- Bender-Knuth involutions on linear extensions of posets
- Binary bubble languages and cool-lex order
- Distinct fringe subtrees in random trees
This page was built for publication: Generating linear extensions of posets by transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368024)
