All Questions
11 questions
7
votes
1
answer
440
views
Road map and references for combinatorial Hodge theory
I'm a PhD student. I'm familiar with graduate level algebraic geometry and toric varieties.
I wanted to know a road map for getting into combinatorial Hodge theory and other prerequisites that I'll ...
- 839
15
votes
3
answers
892
views
Log-concavity of matroids: characterization of equality?
Let $M$ be a (loopless) matroid of rank $r$.
The characteristic polynomial $\chi_M(x)$ is defined by $\chi_M(x)=\sum_{F \in \mathcal{L}(M)}\mu(\hat{0},F) \cdot x^{\mathrm{rk}(F)}$, where $ \mathcal{L}(...
- 24.2k
4
votes
1
answer
233
views
What's known about the matroid induced by the Plücker coordinates of the representation of a matroid?
Let $M$ be a linear matroid with ground set $E$ and independent subsets $\mathcal I$, represented by $\rho: E \rightarrow V$.
This induces a map
$$
\hat\rho: \mathcal I \rightarrow \mathbf P(\Lambda V)...
- 213
1
vote
0
answers
231
views
Cohomology of realization space of matroid
Do we know any thing about cohomology of realization space of matroid (the space of all set of vectors in $\mathbb{C}^k$ which captures the independence structure of matroid $M$), more simple, for ...
- 91
7
votes
1
answer
489
views
Combinatorial meaning of Kazhdan-Lusztig-Stanley polynomial
This question is motivated by
Why do combinatorial abstractions of geometric objects behave so well?
The algebraic geometry of Kazhdan-Lusztig-Stanley polynomials
Kazhdan-Lusztig-Stanley polynomials ...
- 5,230
5
votes
1
answer
277
views
Set-theoretic generation by circuit polynomials
Let $P$ be a prime ideal in $S=\mathbb{C}[x_1,\ldots , x_n],$ and write $[n] = \{ 1, \ldots , n \}.$ The algebraic matroid of $P$ can be defined according to circuit axioms as follows: $C\subset [n]$ ...
- 396
103
votes
3
answers
6k
views
Why do combinatorial abstractions of geometric objects behave so well?
This question is inspired by a talk of June Huh from the recent "Current Developments in Mathematics" conference.
Here are two examples of the kind of combinatorial abstractions of geometric ...
- 24.2k
5
votes
2
answers
639
views
Matroids relaxations of a given matroid
Let $\mathcal{M}$ be a rank-$d$ matroid on $[n]$. Say a matroid $\mathcal{N}$ is a relaxation of $\mathcal{M}$ if $\mathrm{rank}(\mathcal{N})=d$, $\mathrm{groundset}(\mathcal{N})=[n]$, and every ...
- 902
2
votes
0
answers
203
views
Schemes defined by a collection of Plücker coordinates
If $C \subset {[n]\choose k}$ is any collection of $k$-element sets, we can define a scheme $$ W(C) = \bigcap_{S\notin C} \{V \in Gr(k,n) : p_S(V)=0\} \qquad \subseteq Gr(k,n), $$ where $p_S$ is the ...
- 27.8k
6
votes
2
answers
531
views
Finding the matroids with a specified set of non-bases
I'm a grad student in algebraic geometry, and I've encountered a problem which requires me to produce an algorithm involving matroids. Since this isn't my area of expertise, I'm hoping someone knows ...
- 1,510
15
votes
1
answer
690
views
Smooth bases of matroids
Motivated by algebraic geometry, I've come up with a purely
combinatorial definition within the theory of matroids.
The question is: is this concept known?
If you like matroids but not algebraic ...
- 27.8k