An asymptotic equivalent for the number of total preorders on a finite set
From MaRDI portal
Publication:1145144
DOI10.1016/0012-365X(80)90159-4zbMath0445.05011OpenAlexW2039531081WikidataQ29012984 ScholiaQ29012984MaRDI QIDQ1145144
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(80)90159-4
Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Total orders (06A05)
Related Items (12)
Counting combinatorial choice rules ⋮ Independent set and matching permutations ⋮ Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints ⋮ The number of preference orderings: a recursive approach ⋮ A complementary construction using mutually unbiased bases ⋮ Counting finite posets and topologies ⋮ Random preorders and alignments ⋮ Face numbers of Engström representations of matroids ⋮ The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes ⋮ The vertices of primitive zonotopes ⋮ Generating Gray codes for weak orders in constant amortized time ⋮ Ground joinability and connectedness in the superposition calculus
Cites Work
This page was built for publication: An asymptotic equivalent for the number of total preorders on a finite set
