I will just add that the information I've mentioned in comments on that question is related to merging in general. I am not really sure whether the specific questions which are linked in the meta post are suitable for merging. In fact, it seems that most users that looked into it did not even vote to close it as duplicate: mathoverflow.net/review/close/109093
Let $X$ be a smooth irreducible complex projective variety. As we know, if $\alpha,\beta$ are two cycles intersecting properly in $X$, we can define, via Serre's Intersection Formula, their intersection $\alpha\cdot\beta$. Let
$$\Omega:=\lbrace (\alpha,\beta)\in\mathcal{C}_p(X)\times\mathcal{C}...
In set theory, a tree usually defined as a partial order such that the set of elements below any given one is well-ordered. I am interested in the class of partial orders $P$ such that for every $p \in P$, the set of $q \leq p$ is just linearly ordered. Does this have a name?
new-tagmeta Probably this is not really necessary - but just to make this easier to find, I'll write in a message with a tag that the tag merging was created. (As discussed above.)
The tag limitcycle was created (and extensively used) by one user (most occurrences are by him and a few more come from edits of other posts by this very user). I have nothing against its use, but it does not not comply to the graphic (implicit?) convention which separates words with a dash, and ...
Let $X$ be a smooth irreducible complex projective variety. As we know, if $\alpha,\beta$ are two cycles intersecting properly in $X$, we can define, via Serre's Intersection Formula, their intersection $\alpha\cdot\beta$. Let
$$\Omega:=\lbrace (\alpha,\beta)\in\mathcal{C}_p(X)\times\mathcal{C}...
In set theory, a tree usually defined as a partial order such that the set of elements below any given one is well-ordered. I am interested in the class of partial orders $P$ such that for every $p \in P$, the set of $q \leq p$ is just linearly ordered. Does this have a name?
