The following pages link to (Q5633999):
Displayed 25 items.
- Chords, trees and permutations (Q686151) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← links)
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations (Q1119592) (← links)
- A threshold property for intersections in a finite set (Q1133542) (← links)
- Sorting using networks of deques (Q1136225) (← links)
- The cycle structure of a linear transformation over a finite field (Q1160128) (← links)
- Primitive ideals and orbital integrals in complex classical groups (Q1166628) (← links)
- A new derivation of the counting formula for Young tableaux (Q1167169) (← links)
- On the determination of Green's relations in finite transformation semigroups (Q1173774) (← links)
- Paths in ordered structures of partitions (Q1216404) (← links)
- Complements and transitive closures (Q1218857) (← links)
- Enumeration of permutations with prescribed up-down and inversion sequences (Q1230628) (← links)
- Le nombre maximal de colorations d'un graphe Hamiltonien (Q1232417) (← links)
- A generalized \(\tau\)-invariant for the primitive spectrum of a semisimple Lie algebra (Q1250273) (← links)
- Enumeration des tableaux Standards (Q1255494) (← links)
- A stochastic theory for the emergence and the evolution of preference relations (Q1278552) (← links)
- On rankings generated by pairwise linear discriminant analysis of \(m\) populations (Q1364664) (← links)
- Sorting by means of swappings (Q1846423) (← links)
- Interaction transform of set functions over a finite set (Q1969694) (← links)
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre (Q2266711) (← links)
- Highly transitive imprimitivities. (Q2496849) (← links)
- Denombrement des arborescences dont le graphe de comparabilite est hamiltonien (Q2560259) (← links)
- Predecessors in Random Mappings (Q2785367) (← links)
- (Q4103538) (← links)
- (Q4288140) (← links)