Lazard's Theorem for S ‐posets
By S. Bulman-Fleming, Valdis Laan. 2005
63 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/2b2634c292508c5a900aa5eb8d175e45473b732e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
In Computational Theory and Mathematics
Citations in the corpus
- Flatness Properties of S-Posets (2006, background): “Further investigations along these lines have lain dormant until the recent appearance of the articles Shi et al. (2005), Bulman-Fleming and Laan (2005), and Shi (2005).”
- Strongly Flat and PO-Flat S-Posets (2005, methodology): “In S-posets, Condition (P) and Condition (E) were introduced in Shi et al. (2005) and Bulman-Fleming and Laan (2005).”
- The Category of S-Posets (2005, methodology): “More explicitly, the free S -poset on a set X is X × S with the order given by (x, s) ≤ (y, t) ifand only if x = y and s ≤ t , and the action given by (x, s)t =( x, st), for x ∈ X , s, t ∈ S . This result has already been used extensively in [11] and [ 4 ].”