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 480742
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$).
1
vote
Category = Groupoid x Poset?
This is a good question, and I have a similar idea/philosophy/direction of thought on categories.
To realize this idea, I introduce the notion of a minor category and a gauged minor category of a smal …
- 153
1
vote
0
answers
105
views
Causal-net category and poset category
There are two natural ways to represent order structures, by posets and by causal-nets (acyclic directed graph). …
- 153
1
vote
Characterization of edge posets
Proof:$(\Rightarrow)$ We prove that edge posets are N-free by contradiction. … The conrrespondence between N-free posets and acyclic directed graphs are one-to-many. …
- 153
1
vote
1
answer
95
views
Characterization of edge posets
My question is that how can we characterize those edge posets of acyclic directed graphs, or under exactly what conditions a poset can be represented as the edge poset of an acyclic directed graph? … But I do not agree with the statement that posets which are edge partial orders of graphs have been fully characterized, which is what my question concerns. …
- 153