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 123506
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$).
4
votes
1
answer
298
views
Not sure whether I find a counterexample to poset fiber theorem
But when I implement the theorem to the following example, the result seems inconsistent with my knowledge:
The posets are as shown in their Hasse diagrams and how the map is defined is: fixing $3,6,9,10 …
- 461
5
votes
Accepted
Not sure whether I find a counterexample to poset fiber theorem
I corrected my computation and it turns out the assumptions required by Theorem 1.1 in the paper are not satisfied. Many thanks to everyone, who spent time reading my long writing. Cheers.
- 461