✦ LIBER ✦

Subcyclic sets of linear orders

✍ Scribed by Peter C. Fishburn

Publisher: Springer
Year: 2005
Tongue: English
Weight: 282 KB
Volume: 24
Category: Article
ISSN: 0176-1714
DOI: 10.1007/s00355-003-0268-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic sets of linear orders

✍ Peter Fishburn 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 213 KB

Acyclic sets of linear orders via the Br

Acyclic sets of linear orders via the Bruhat orders

✍ Ádám Galambos; Victor Reiner 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 576 KB

Acyclic sets of linear orders: A progres

Acyclic sets of linear orders: A progress report

✍ Peter C. Fishburn 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 121 KB

Orders of Indescribable Sets

✍ Alex Hellsten 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 166 KB

Stability of explicit subcycling time in

Stability of explicit subcycling time integration with linear interpolation for first-order finite element semidiscretizations

✍ Patrick Smolinski; Yi-Sheng Wu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 782 KB

An explicit subcycling time integration algorithm based on an element partition is presented for first-order finite element systems. This method uses linear interpolation to compute intermediate values at nodes in the subdomains integrated with the larger time steps. Stability of the algorithm for t

Semirigid sets of diamond orders

✍ Vaktang Lashkia; Masahiro Miyakawa; Akihiro Nozaki; Grant Pogosyan; Ivo G. Rosen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 328 KB

An order relation ~<~b on a set A is a diamond provided x<~,,hy holds exactly if x = a or y = b. A set R of diamonds on A is semirigid if the identity map on A and all constant self-maps of A are the only self-maps of A that are (jointly) isotone for all diamonds from R. The study of such sets is mo