Pages that link to "Item:Q2386294"
From MaRDI portal
The following pages link to The number of weak orderings of a finite set (Q2386294):
Displayed 9 items.
- Generating Gray codes for weak orders in constant amortized time (Q785788) (← links)
- Counting combinatorial choice rules (Q876881) (← links)
- Random preorders and alignments (Q960973) (← links)
- Social choice rules with vetoers (Q1927426) (← links)
- Applications of Apostol-type numbers and polynomials: approach to techniques of computation algorithms in approximation and interpolation functions (Q2080506) (← links)
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
- On representations of ternary order relations in numeric strings (Q2363988) (← links)
- A lower bound for Cusick’s conjecture on the digits of <i>n</i> + <i>t</i> (Q5019791) (← links)
- The number of preference orderings: a recursive approach (Q5364971) (← links)