Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with posets
Search options not deleted
user 19729
A poset or partially ordered set is a set endowed with a partial order, meaning a binary relation $\leq$ which is reflexive ($x \leq x$ for all $x$), antisymmetric ($x\leq y$ and $y\leq x$ implies $x=y$), and transitive ($x\leq y$ and $y\leq z$ implies $x \leq z$).
0
votes
When does a graph underlie the Hasse diagram of a poset?
I think at one point he also had some course notes posted on it; it's also in his book on dimension theory of posets. See also this post on CSTheory stackexchange. …
- 3,407
5
votes
Is an Eulerian lattice shellable?
I think that the answer to your question ought to be "not always".
There are examples of non-shellable balls and spheres. A very readable account of these, together with some of the history, can b …
- 3,407
10
votes
What is the Möbius function for the lattice of partial partitions?
Hersh, Hanlon, and Shareshian characterize the Möbius function of this lattice in a never-published preprint:
A $\operatorname{GL}_n(q)$ analogue of the partition lattice.
It is often 0, but/and agree …
- 3,407