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 94696
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
4
votes
Accepted
"Minimal" connected matroids
In general there does not seem to be a nice classification. You're asking for connected matroids of a given rank which are minimal in the "weak map order" (a weak map between matroids of the same rank …
- 1,046
4
votes
What's known about the matroid induced by the Plücker coordinates of the representation of a...
The matroid you're considering is the direct sum of the matroids where you take the $k$th wedge power, so it suffices to study those for each $k$.
The question of whether, for an abstract matroid $M$, …
- 1,046
4
votes
Accepted
Road map and references for combinatorial Hodge theory
Note that "combinatorial Hodge theory" can be in the context of fans (as in the work of Karu), Coxeter groups (as in the work of Elias and Williamson), or matroids. While there are certain common tech …
- 1,046
3
votes
Is matroid realizability computable?
A matroid being representable is equivalent to a certain locally closed subscheme of the Grassmannian, defined by the non-vanishing of the Plücker coordinates corresponding to bases and the vanishing …
- 1,046
0
votes
Set-theoretic generation by circuit polynomials
Daoji Huang and I proved here that if the circuit polynomials are squarefree, then they generate the ideal (and in fact are a universal Grobner basis).
- 1,046