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 46140
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
Accepted
Find a finite semimodular poset such that
In GraphViz notation,
digraph {
rankdir="BT";
edge [arrowhead=none];
0 -> a; 0 -> b; 0 -> c;
a -> ab; a -> ac; a -> d;
b -> ab; b -> bc; b -> d;
c -> ac; c -> bc; c -> d;
a …
- 7,226
9
votes
Matrices of combinatorial sequences that are inverse in two ways
Gjergji Zaimi's answer appears to completely address question 1, but that leaves question 2. On the assumption that OEIS is a good place to look for known matrices of combinatorial significance, I wro …
- 7,226