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 |
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
8
votes
Accepted
A regular polytope
Your polytope is the marginal polytope of the complete bipartite graph $K_{m,n}$ and almost a cut
polytope. Let $G = (V,E)$ be an undirected graph. A cut is a bipartition of the vertex set into two s …
4
votes
0
answers
187
views
A non-matroidal notion of dependence on a set of ideals
Assume we are given a set of ideals $I_1, \dots, I_s$ in a commutative polynomial ring. Let's define a subset indexed by $A\subseteq [s] = \{ 1,2,\dots, s\}$ as dependent if there exists an $a\in A$ s …
1
vote
When is a power of an indeterminate in an ideal with 2 generators?
There is certainly some structure in your example, so maybe also to other ideals that you have in mind?
The first thing I would do is to make experiments and try to guess a formula. Here is Macaul …