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 co.combinatorics
Search options not deleted
user 54838
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
Accepted
Schur positivity on 2 letter alphabets implies Schur-positivity on n letters?
My intuition is that if $P$ is in three variables then your requirements only force $P$ to be unimodal in each pair of variables, while being Schur positive is much more restrictive. For example, take …
- 436
5
votes
1
answer
212
views
Reconstructing an oriented matroid from its deletion and contraction
Suppose that $\mathcal{M}_1$ and $\mathcal M_2$ are two oriented matroids on the same ground set $E$. Under what conditions on $\mathcal{M}_1$ and $\mathcal{M}_2$ is there an oriented matroid $\mathca …
- 436
3
votes
Accepted
Reconstructing an oriented matroid from its deletion and contraction
Found the answer in a paper by Ziegler & Richter-Gebert, see Theorem 4.1. Basically, they show that if two oriented matroids $\mathcal{M}_1$, $\mathcal{M}_2$ of ranks $r$ and $r-1$ respectively satis …
- 436
4
votes
Tableaux with limited rows and complementary skew shapes
Here is another solution, based on the paper "Robinson-schensted algorithms for skew tableaux" by Sagan and Stanley (Darij Grinberg was the one who suggested that this algorithm might work, I'm just f …
- 436