Generating linear extensions of posets by transpositions
From MaRDI portal
Publication:2368024
DOI10.1016/0095-8956(92)90067-8zbMATH Open0772.06004OpenAlexW2052085947MaRDI QIDQ2368024FDOQ2368024
Publication date: 18 August 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(92)90067-8
Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Total orders (06A05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating binary trees by transpositions
- Lexicographic permutations with restrictions
- Some Hamilton Paths and a Minimal Change Algorithm
- Optimal Linear Extensions by Interchanging Chains
- Generation of Permutations by Adjacent Transposition
- Minimizing bumps in linear extensions of ordered sets
- Transposition generation of alternating permutations
- Gray codes with restricted density
- A structured program to generate all topological sorting arrangements
- One hundred problems in elementary mathematics. With a foreword by Martin Gardner
- Adjacent interchange generation of combinations
- An algorithm to generate all topological sorting arrangements
- On the generation of all topological sortings
- Generating the Linear Extensions of Certain Posets by Transpositions
- The Jump Number of Dags and Posets: An Introduction
- Minimizing bumps for posets of width two
- Permutation by Adjacent Interchanges
- Solution of some multi-dimensional lattice path parity difference recurrence relations
Cited In (20)
- Iterative properties of birational rowmotion. I: Generalities and skeletal posets.
- Constructing greedy linear extensions by interchanging chains
- Binary bubble languages and cool-lex order
- Gray code enumeration of families of integer partitions
- Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections
- Sign-balanced posets
- Gray codes from antimatroids
- On the probability that a random subtree is spanning
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- On the sign-imbalance of skew partition shapes
- Signed differential posets and sign-imbalance
- Mining posets from linear orders.
- On arrangements of roots for a real hyperbolic polynomial and its derivatives
- Signed Mahonians
- Distinct fringe subtrees in random trees
- Some remarks on sign-balanced and maj-balanced posets
- Finding parity difference by involutions
- Title not available (Why is that?)
- On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
- Bender-Knuth involutions on linear extensions of posets
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)
