𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of linear orders on a field

✍ Scribed by Yu. L. Ershov

Publisher
SP MAIK Nauka/Interperiodica
Year
1969
Tongue
English
Weight
444 KB
Volume
6
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Randomk-dimensional orders: Width and nu
Randomk-dimensional orders: Width and number of linear extensions
✍ Graham Brightwell πŸ“‚ Article πŸ“… 1992 πŸ› Springer Netherlands 🌐 English βš– 554 KB

We consider the width Wk(n) and number Lk(n) of linear extensions of a random k-dimensional order P,Jn). We show that, for each fixed k, almost surely w&n) lies between (G/2 -C)n' -'lk and 4kn' Ilk, for some constant C, and Lk(n) lies between (e -%' -"")n and (2kn' -"k)n. The bounds given also apply

The number of linear extensions of subse
The number of linear extensions of subset ordering
✍ Jichang Sha; D.J. Kleitman πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 520 KB

We find asymptotic upper and lower bounds on the number of linear extensions of the containment ordering of subsets of a finite set. These agree in their most significant non-trivial terms. A related open question is described. L > 2"((n + 1)log 2 -4 log 2m -5 + o(1 ln)).

A note on vertex orders for stability nu
A note on vertex orders for stability number
✍ Mahadev, N. V. R.; Reed, B. A. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 2 views

We investigate vertex orders that can be used to obtain maximum stable sets by a simple greedy algorithm in polynomial time in some classes of graphs. We characterize a class of graphs for which the stability number can be obtained by a simple greedy algorithm. This class properly contains previousl