betaFeedback

WorksMathematics

Maximum number of cells in a matroid subdivision of hypersimplex

Abstract

David Speyer proved that the maximum number of cells in a regular matroid subdivision of the hypersimplex Δ(m,t)Δ(m,t) is (t−2m−1)\binom{t-2}{m-1} , using the language of tropical geometry and properties of the Tutte polynomial of a matroid \cite[Theorem 6.1]{Speyer}. In this paper, we prove this result in general, i.e. for arbitrary matroid subdivisions including the non-regular ones. We perform a different combinatorial way using our results in \cite{HHH} and independent of tropical language.

Introduction

Triangulations and subdivisions are among the most important notions in convex geometry as well as in algebraic geometry and topology. For example in toric geometry, we can associate an algebraic variety to a triangulation of a special polytope. More generally we can consider face-fitting decompositions, in which we do not need the smaller polytopes to be simplices anymore. One of the most important special cases is a subdivision of hypersimplex

Δ(m,t)={(x1,x2,…,xt)∈Rt:x1+…+xt=m,0≤xi≤1}\Delta(m,t) = \{(x_1, x_2, \ldots, x_t) \in\mathbb{R}^t : x_1 + \ldots+ x_t = m, 0 \le x_i \le1\}

by matroid polytopes. In fact, the hypersimplex is itself the polytope of the uniform matroid Um,tU_{m,t} and its subdivision is also considered in matroid theory [12]. On the other hand one can construct toric varieties from matroid polytopes involved in a matroid subdivision and attach them to get the so called stable varieties or ”shas”(stable hyperplane arrangements) as explained in [7]. A natural question is what is the maximum number of irreducible components in a ”shas” obtained by a matroid subdivision of hypersimplex Δ(m,t)\Delta(m,t)? Or, in another words, what is the maximum number of polytopes in a matroid subdivision of the hypersimplex? We will recall some definitions from matroid theory:

Definition 1.1. A matroid is a pair P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma), where Γ\Gamma is a collection of subsets of {1,…,t}\{1,\ldots,t\} satisfying the properties below:

  1. ∅∈Γ\varnothing\in\Gamma

  2. If I∈ΓI \in\Gamma and J⊆IJ \subseteq I, then J∈ΓJ \in\Gamma

  3. If I,J∈ΓI,J \in\Gamma and ∣I∣<∣J∣|I| < |J|, there exists j∈J−Ij \in J-I such that I∪{j}∈ΓI \cup\{j\} \in\Gamma.

We also denote the matroid simply by Γ\Gamma.

Definition 1.2. If the pair P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) is a matroid, the elements of Γ\Gamma are called independent sets of the matroid.

Matroids can also be defined via their bases:

Definition 1.3. Let the pair P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) be a matroid, a subset I⊆{1,…,t}I \subseteq\{1,\ldots,t\} is called a basis if it is a maximal independent set. We denote the set of all bases by β(P)\beta(P) or β(Γ)\beta(\Gamma).

Definition 1.4. The matroid polytope of a matroid P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) is the convex hull of the points eIe_I with I∈β(P)I \in\beta(P). It is a polytope in Rt\mathbb{R}^t and is denoted by MPM_P or MΓM_\Gamma.

Two operations can be performed on matroids, one is deletion and the other is contraction:

Definition 1.5. Let P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) be a matroid and X⊆{1,…,t}X \subseteq\{1,\ldots,t\}. Put

Γ∣X={I⊆X:I∈Γ}\Gamma|X = \{I \subseteq X : I \in\Gamma\}

Then the pair (X,Γ∣X)(X,\Gamma|X) is also a matroid, called the deletion of XcX^c and is denoted by P∣XP|X.

Definition 1.6. Let P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) be a matroid and X⊆{1,…,t}X \subseteq\{1,\ldots,t\}. Put

Γ/X={I⊆Xc:P∣X has a basis B such that B∪I∈Γ}\Gamma/X = \{I \subseteq X^c : P|X \text{ has a basis } B \text{ such that } B \cup I \in\Gamma\}

Then the pair (Xc,Γ/X)(X^c,\Gamma/X) is also a matroid, called the contraction of XX and is denoted by P/XP/X.

The notion of rank function for a matroid is essential in our study:

Definition 1.7. Let P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) be a matroid and X⊆{1,…,t}X \subseteq\{1,\ldots,t\}. The rank of XX, denoted by rP(X)r_P(X), is defined to be the cardinality of a basis of P∣XP|X.

We will work with two kinds of matroids:

Definition 1.8. A matroid P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) of rank mm is linear if there are vectors f1,…,ftf_1,\ldots,f_t in Cm\mathbb{C}^m such that a subset I⊆{1,…,t}I \subseteq\{1,\ldots,t\} is independent if and only if the set {fi:i∈I}\{f_i:i \in I\} is linearly independent over C\mathbb{C}.

There is a notion of connectedness in matroid theory which is useful for our aim.

Definition 1.9. A matroid P=({1,…,t},Γ)P = (\{1,\ldots,t\},\Gamma) is connected if one cannot decompose the ground set

{1,…,t}=E1∪E2\{1,\ldots,t\}=E_1\cup E_2

such that a subset I⊆{1,…,t}I\subseteq\{1,\ldots,t\} is independent if and only if

I=I1∪I2I=I_1\cup I_2

where I1⊆E1I_1\subseteq E_1, I2⊆E2I_2\subseteq E_2 and I1,I2I_1,I_2 are independent.

Definition 1.10. A collection of maximal matroid polytopes {Qj:j∈J}\{Q_j:j\in J\} in Rt\mathbb{R}^t is a matroid decomposition of Δ(m,t)\Delta(m,t) if ⋃j∈JQj=Δ(m,t)\bigcup_{j\in J}Q_j=\Delta(m,t) and they intersect face-fittingly; i.e., for each pair QiQ_i and QjQ_j, Qi∩QjQ_i\cap Q_j is either empty or a face of both QiQ_i and QjQ_j.

It is proven by Herrmann, Jensen, Joswig, and Sturmfels that the maximum number of cells in a matroid subdivision of the hypersimplex Δ(3,t)\Delta(3,t) is not bounded by a constant [10]. Valery Alexeev also proved that this number is bounded by (t−3)2(t-3)^2 for Δ(3,t)\Delta(3,t) [7]. Finally, David Speyer proved that for all m,tm,t the maximum number of cells in a regular matroid subdivision of Δ(m,t)\Delta(m,t) is (t−2m−1)\binom{t-2}{m-1}. In this article we extend this result to all arbitrary (including non-regular) matroid subdivisions of Δ(m,t)\Delta(m,t) via the ideas written in [13]. We hope our new approach also helps us to answer a question about the Dressian fan in tropical geometry, denoted by Dr(m,t)Dr(m,t). We briefly state the question below:

Every element in the Dressian fan Dr(m,t)Dr(m,t) determines a matroid subdivision for Δ(m,t)\Delta(m,t). The number, spread of an element in the Dressian, is the number of maximal cells in the corresponding matroid subdivision of hypersimplex. Question 35 in [11] states:

  • What is the maximal spread of a ray of Dr(m,t)Dr(m,t) (at least for m=3m=3)?

In the question above, rays correspond to subdivisions that cannot be coarsened, i.e. if you want to coarsen it, you will only get the whole hypersimplex Δ(m,t)\Delta(m,t). We hope that the recursive process that we used for the previous problem can also be used to solve the problem above.

Relation to inverse limit of point configurations

The notion of inverse limit for an action of an algebraic group on an algebraic variety was studied in [5] using Geometric Invariant Theory [9] and its variation [4, 3]. For a reference concerning this matter and the special case of point configurations see [2].

Definition 2.1. A point configuration with parameters m,tm,t is a tuple (p1,…,pt)(p_1,\ldots,p_t) such that pi∈Pm−1p_i\in\mathbb{P}^{m-1} for every i=1,…,ti=1,\ldots,t. We also assume that we have at least m+1m+1 general points in this configuration.

One can consider finitely many quotients of the natural action of PGL(m)PGL(m) on (Pm−1)t(\mathbb{P}^{m-1})^t, provided by Geometric Invariant Theory, and consider their inverse limit. In fact, for every weight θ∈Δ(m,t)\theta\in\Delta(m,t), we have a corresponding moduli space MθM^\theta parametrizing θ\theta-semistable representations up to SS-equivalence. Based on the Geometric Invariant Theory literature, they form an inverse system and we denote this inverse limit by M‾(m,t)\overline{M}(m,t).

In fact, the walls WIlW_I^l for I⊂{1,…,t}I \subset\{1,\ldots,t\}, 1≤l<m1 \le l < m decompose the hypersimplex Δ(m,t)\Delta(m,t) into finitely many chambers. For each chamber in this decomposition, we have a distinct moduli space. We can specify a representative θ\theta for each chamber; this representative determines the corresponding moduli space MθM^\theta. The inverse limit M‾(m,t)\overline{M}(m,t) is a closed subvariety of ∏θ∈C(m,t)Mθ\prod_{\theta\in C(m,t)} M^\theta, where C(m,t)C(m,t) is the set which has exactly one weight as a representative from each chamber. In this way, we can denote each element of the inverse limit M‾(m,t)\overline{M}(m,t) as (φθ)θ∈C(m,t)(\varphi_\theta)_{\theta\in C(m,t)} such that φθ∈Mθ\varphi_\theta\in M^\theta.

We need to establish some notations:

Notation 2.1. Let e1,…,ete_1,\ldots,e_t be the standard basis vectors of Rt\mathbb{R}^t. Suppose I⊂{1,…,t}I \subset\{1,\ldots,t\}, 0≤l<m0 \le l < m and θ=(θ1,…,θt)∈Rt\theta= (\theta_1,\ldots,\theta_t) \in\mathbb{R}^t.

eI=∑i∈Iei(1)e_I = \sum_{i \in I} e_i \tag*{(1)}
θ(I)=θI=∑i∈Iθi(2)\theta(I) = \theta_I = \sum_{i \in I} \theta_i \tag*{(2)}
WIl={(θ1,…,θt)∈Rt:∑i∈Iθi=l}(3)W_I^l = \left\{(\theta_1,\ldots,\theta_t) \in\mathbb{R}^t : \sum_{i \in I} \theta_i = l\right\} \tag*{(3)}

In the above notations, the particular case I={i}I = \{i\} is of interest to us. In this case we have

  • W{i}0≅Δ(m,t−1)W_{\{i\}}^0 \cong\Delta(m,t-1)

  • W{i}1≅Δ(m−1,t−1)W_{\{i\}}^1 \cong\Delta(m-1,t-1)

We will work with both of them multiple times.

In the paper [13], we construct algebraic morphisms

M‾(m,t)⟶M‾(m,t−1)\overline{M}(m,t) \longrightarrow\overline{M}(m,t-1)
M‾(m,t)⟶M‾(m−1,t−1)\overline{M}(m,t) \longrightarrow\overline{M}(m-1,t-1)

for every 1≤i≤t1 \le i \le t which are called deletion and contraction maps. They are analogous to the well-known maps of the Kapranov-Chow quotients of Grassmannians [6]. One can combine the deletion and contraction maps for a fixed 1≤i≤t1 \le i \le t simultaneously to get the natural morphism

M‾(m,t)⟶M‾(m,t−1)×M‾(m−1,t−1).\overline{M}(m,t) \longrightarrow\overline{M}(m,t-1) \times\overline{M}(m-1,t-1).

If we have a point of the inverse limit M‾(m,t)\overline{M}(m,t), this gives us a matroid decomposition of the hypersimplex Δ(m,t)\Delta(m,t) for m=2,3m = 2,3 by [13 Theorem 1.14], we can apply the morphisms above to get elements in M‾(m,t−1)\overline{M}(m,t-1) and M‾(m−1,t−1)\overline{M}(m-1,t-1) and decompositions for Δ(m,t−1)\Delta(m,t-1) and Δ(m−1,t−1)\Delta(m-1,t-1) respectively.

In fact these morphisms are derived from natural maps:

ηi:∏θ∈C(m,t)Mθ⟶∏θ∈C(m,t−1)Mθ\eta_i:\prod_{\theta\in C(m,t)} M^\theta\longrightarrow\prod_{\theta\in C(m,t-1)} M^\theta
(φθ)↦(φθDi)(\varphi_\theta) \mapsto(\varphi_\theta^{D_i})
γi:∏θ∈C(m,t)Mθ⟶∏θ∈C(m−1,t−1)Mθ\gamma_i:\prod_{\theta\in C(m,t)} M^\theta\longrightarrow\prod_{\theta\in C(m-1,t-1)} M^\theta
(φθ)↦(φθCi)(\varphi_\theta) \mapsto(\varphi_\theta^{C_i})

where φθDi\varphi_{\theta}^{D_i} and φθCi\varphi_{\theta}^{C_i} are obtained from the representation φθ\varphi_{\theta} by applying the deletion and contraction process over point ii for each 1≤i≤t1 \leq i \leq t as explained in [13 Definition 3.14,Definition 3.15]. In this definition, chambers of the hypersimplices Δ(m,t−1)\Delta(m,t-1) and Δ(m−1,t−1)\Delta(m-1,t-1) are obtained with intersecting of chambers of Δ(m,t)\Delta(m,t) with W{i}0,W{i}1W_{\{i\}}^{0},W_{\{i\}}^{1} respectively. So if we have a point of the inverse limit (φθ)θ∈C(m,t)(\varphi_{\theta})_{\theta\in C(m,t)} in M‾(m,t)\overline{M}(m,t) the images would be tuples of the form (φθDi)θ∈C(m,t−1)(\varphi_{\theta}^{D_i})_{\theta\in C(m,t-1)} and (φθCi)θ∈C(m−1,t−1)(\varphi_{\theta}^{C_i})_{\theta\in C(m-1,t-1)} respectively.

For a point inside the inverse limit M‾(m,t)\overline{M}(m,t), we denote the maximum number of cells in the corresponding subdivision of hypersimplex Δ(m,t)\Delta(m,t) by K(m,t)K(m,t). Then we can get a recursive formula if we prove the items below:

  1. Every component of (φθDi)θ∈C(m,t−1)(\varphi_{\theta}^{D_i})_{\theta\in C(m,t-1)} and (φθCi)θ∈C(m−1,t−1)(\varphi_{\theta}^{C_i})_{\theta\in C(m-1,t-1)} is obtained from one component of (φθ)θ∈C(m,t)(\varphi_{\theta})_{\theta\in C(m,t)}.

  2. Every component of the initial element of (φθ)θ∈C(m,t)(\varphi_{\theta})_{\theta\in C(m,t)} in M‾(m,t)\overline{M}(m,t) appears in at least one(or both) of the components of the images (φθDi)θ∈C(m,t−1)(\varphi_{\theta}^{D_i})_{\theta\in C(m,t-1)} and (φθCi)θ∈C(m−1,t−1)(\varphi_{\theta}^{C_i})_{\theta\in C(m-1,t-1)} in M‾(m,t−1)\overline{M}(m,t-1) and M‾(m−1,t−1)\overline{M}(m-1,t-1) respectively.

If we prove these two facts, then we have:

  • K(m,t−1)+K(m−1,t−1)≥K(m,t)K(m,t-1)+K(m-1,t-1)\geq K(m,t)

To see why this is true, take a tuple with K(m,t)K(m,t) maximal cells which is a point of the inverse limit M‾(m,t)\overline{M}(m,t), the items (1), (2) in the previous paragraph show that we can decompose the cells of this tuple into union of two sets A∪BA\cup B such that AA and BB are the maximal cells of the images in M‾(m,t−1)\overline{M}(m,t-1) and M‾(m−1,t−1)\overline{M}(m-1,t-1) respectively, so

K(m,t)=∣A∪B∣≤∣A∣+∣B∣K(m,t)=|A\cup B|\leq|A|+|B|

Thus using induction on m+tm+t and Pascal identity, we get

K(m,t)≤(t−3m−1)+(t−3m−2)=(t−2m−1)K(m,t)\leq\binom{t-3}{m-1}+\binom{t-3}{m-2}=\binom{t-2}{m-1}

for m≥t+1m\geq t+1 and m≥2m\geq2 and the bound is achieved. The base of induction is also clear (m=2,t=4)(m=2,t=4).

It is quite easy to see that both of (1), (2) are satisfied for point configurations or linear matroids. With this motivation we prove (1),(2) for general matroids in theorem 3.5 and state this bound for every matroid decomposition of hypersimplex Δ(m,t)\Delta(m,t) independent of inverse limit and regularity concept.

Proof that the bound is working

We first establish some notation and lemmas, specially the lemma below, which is well-known in matroid theory.

Lemma 3.1. Let ({1,…,t},Γ)\left(\{1,\ldots,t\},\Gamma\right) be an abstract matroid, the matroid polytope MΓM_{\Gamma} is of maximal dimension if and only if the matroid Γ\Gamma is connected.

Proof. Dimension of the matroid polytope can be computed using [14 Proposition 2.4], i.e

dim⁡(MΓ)=t−C(Γ)\dim(M_{\Gamma})=t-C(\Gamma)

where C(Γ)C(\Gamma) is the number of connected components of the matroid Γ\Gamma. Notice that a matroid Γ\Gamma is connected if and only of C(Γ)=1C(\Gamma)=1. Since the matroid polytope MΓM_{\Gamma} is a sub-polytope of the hypersimplex Δ(m,t)\Delta(m,t) and dim⁡(Δ(m,t))=t−1\dim(\Delta(m,t))=t-1 the result is driven.

Notation 3.1. If P=({1,…,t},Γ)P=(\{1,\ldots,t\},\Gamma) is a matroid and 1≤i≤t1\leq i\leq t, we can operate the Deletion and Contraction process, over point ii and get two new matroids ΓDi\Gamma^{D_i} and ΓCi\Gamma^{C_i} with indices {1,2,…,i−1,i+1,…,t}\{1,2,\ldots,i-1,i+1,\ldots,t\}.

We also need the definition of isomorphism between matroids:

Definition 3.2. Two abstract matroids ({1,…,t},Γ)(\{1,\ldots,t\},\Gamma) and ({1,…,t},Γ′)(\{1,\ldots,t\},\Gamma') are isomorphic if there is a bijective map f:{1,…,t}→{1,…,t}f:\{1,\ldots,t\}\to\{1,\ldots,t\} such that for every subset I⊆{1,…,t}I\subseteq\{1,\ldots,t\}, I∈ΓI\in\Gamma if and only if f(I)∈Γ′f(I)\in\Gamma'.

Definition 3.3. We say two matroid subdivisions

{MΓ1,…,MΓq}\left\{M_{\Gamma_1},\ldots,M_{\Gamma_q}\right\}

and

{MΓ1′,…,MΓq′}\left\{M_{\Gamma'_1},\ldots,M_{\Gamma'_q}\right\}

are isomorphic if there is a bijection between their cells, i.e there are isomorphisms of matroids fi:Γi→Γi′f_i:\Gamma_i\to\Gamma'_i for 1≤i≤q1\leq i\leq q.

Let D(m,t)D(m,t) be the set of all matroid subdivisions of the hypersimplex Δ(m,t)\Delta(m,t) up to the notion of isomorphism defined in the above. We will construct the map below analogous the inverse limit one:

D(m,t)⟶D(m,t−1)×D(m−1,t−1)D(m,t)\longrightarrow D(m,t-1)\times D(m-1,t-1)
(MΓs)s=1q⟼((MΓs∩Δ(m,t−1))s=1q,(MΓs∩Δ(m−1,t−1))s=1q)(M_{\Gamma_s})_{s=1}^{q}\longmapsto\left((M_{\Gamma_s}\cap\Delta(m,t-1))_{s=1}^{q},(M_{\Gamma_s}\cap\Delta(m-1,t-1))_{s=1}^{q}\right)

Here we should notice that since the decomposition (MΓs)s=1q∈D(m,t)(M_{\Gamma_s})_{s=1}^{q}\in D(m,t) is face-fitting, after intersecting with Δ(m,t−1)\Delta(m,t-1) and Δ(m−1,t−1)\Delta(m-1,t-1), it will remain face-fitting. We should also prove that both of the components MΓs∩Δ(m,t−1)M_{\Gamma_s}\cap\Delta(m,t-1) and MΓs∩Δ(m−1,t−1)M_{\Gamma_s}\cap\Delta(m-1,t-1) are matroid polytopes. We will prove this in the proposition below:

Proposition 3.4. If ({1,…,t},Γ)(\{1,\ldots,t\},\Gamma) is an abstract matroid such that MΓM_{\Gamma} is of maximal dimension and 1≤i≤t1\leq i\leq t, then

  • MΓ∩W{i}0≅MΓDiM_{\Gamma}\cap W^{0}_{\{i\}}\cong M_{\Gamma^{D_i}}

  • MΓ∩W{i}1≅MΓCiM_{\Gamma}\cap W^{1}_{\{i\}}\cong M_{\Gamma^{C_i}}

Proof. Definition of matroid polytope MΓM_{\Gamma} says:

MΓ∩W{i}0=conv⁡{eI:I∈β(Γ),i∉I}M_{\Gamma}\cap W^{0}_{\{i\}}=\operatorname{conv}\{e_I:I\in\beta(\Gamma),i\notin I\}
MΓ∩W{i}1=conv⁡{eI:I∈β(Γ),i∈I}.M_{\Gamma}\cap W^{1}_{\{i\}}=\operatorname{conv}\{e_I:I\in\beta(\Gamma),i\in I\}.

Based on the assumption the matroid polytope MΓM_{\Gamma} is of maximal dimension. Thus lemma 3.1 implies that the matroid Γ\Gamma is connected and the element ii is neither loop nor coloop. So we have

:::

β(ΓDi)={I∈β(Γ):i∉I}\beta(\Gamma^{D_i})=\{I\in\beta(\Gamma):i\notin I\}
β(ΓCi)={I−{i}:I∈β(Γ),i∈I}\beta(\Gamma^{C_i})=\{I-\{i\}:I\in\beta(\Gamma),i\in I\}

Now it is easy to see the isomporphisms. □

Now if we prove items (1), (2) of the theorem below, then we get the required bound by the same way as before.

Theorem 3.5. With the notations above, we have:

(1) Every maximal component of (MΓs∩Δ(m,t−1))s=1q(M_{\Gamma_s}\cap\Delta(m,t-1))_{s=1}^{q} and (MΓs∩Δ(m−1,t−1))s=1q(M_{\Gamma_s}\cap\Delta(m-1,t-1))_{s=1}^{q} is obtained from one component of (MΓs)s=1q(M_{\Gamma_s})_{s=1}^{q}.

(2) Every component of the initial decomposition (MΓs)s=1q(M_{\Gamma_s})_{s=1}^{q} in D(m,t)D(m,t) appears in at least one of the maximal components of the images (MΓs∩Δ(m,t−1))s=1q(M_{\Gamma_s}\cap\Delta(m,t-1))_{s=1}^{q} and (MΓs∩Δ(m−1,t−1))s=1q(M_{\Gamma_s}\cap\Delta(m-1,t-1))_{s=1}^{q} in D(m,t−1)D(m,t-1) and D(m−1,t−1)D(m-1,t-1) respectively.

Proof. Item (1) is clear. For (2) notice that the intersection MΓs∩Δ(m,t−1)M_{\Gamma_s}\cap\Delta(m,t-1) and MΓs∩Δ(m−1,t−1)M_{\Gamma_s}\cap\Delta(m-1,t-1) could be non-maximal, in this case they are not computed as a maximal component. We should prove that for every component MΓsM_{\Gamma_s} at least one of MΓs∩Δ(m,t−1)M_{\Gamma_s}\cap\Delta(m,t-1) or MΓs∩Δ(m−1,t−1)M_{\Gamma_s}\cap\Delta(m-1,t-1) is maximal. This is proven in the next proposition. □

Proposition 3.6. At least one of the polytopes MΓs∩Δ(m,t−1)M_{\Gamma_s}\cap\Delta(m,t-1) or MΓs∩Δ(m−1,t−1)M_{\Gamma_s}\cap\Delta(m-1,t-1) is maximal dimensional.

Proof. Based of proposition 3.4 we have to prove at least one of the polytopes MΓsDiM_{\Gamma_s^{D_i}} or MΓsCiM_{\Gamma_s^{C_i}} is of maximal dimensional. By lemma 3.1 we should prove that either ΓDi\Gamma^{D_i} or ΓCi\Gamma^{C_i} is connected. Since (MΓs)s=1q∈D(m,t)(M_{\Gamma_s})_{s=1}^{q}\in D(m,t), the matroid polytope MΓsM_{\Gamma_s} is of maximal dimension, so Γs\Gamma_s is connected. As known in matroid theory, Theorem 4.3.1 in Oxley book [8] implies that either ΓDi\Gamma^{D_i} or ΓCi\Gamma^{C_i} is connected. □

Corollary 3.7. Maximum number of maximal cells in an arbitrary matroid decomposition of hypersimplex Δ(m,t)\Delta(m,t) is (t−2m−1)\binom{t-2}{m-1}.

Acknowledgement

I would like to express my gratitude to my advisors, Prof. Lutz Hille and Prof. S. Mohammad Hadi Hedayatzadeh, for their constant support and invaluable guidance. In particular, I am grateful to Prof. Lutz Hille for introducing me to this interesting problem and the concept of inverse limit, which played a key role in shaping my research.

3 Department of Mathematics, IPM - Institute for Research in Fundamental Sciences, Tehran, Iran

Email address: [email protected]

References

  1. [2]M. Blume and L. Hille. Quivers and moduli spaces of pointed curves of genus zero, Algebr. Comb., 4(1):89–124, 2021 https://doi.org/10.5802/alco.152
  2. [3]I. Dolgachev, Y. Hu, Variation of geometric invariant theory quotients, Publ. Math. IHES 87 (1998), 5–51 https://doi.org/10.1007/BF02698859
  3. [4]M. Thaddeus, Geometric invariant theory and flips. Journal of the American Mathematical Society, vol. 9, no. 3, pp. 691–723, 1996. https://arxiv.org/pdf/alg-geom/9405004
  4. [5]M. Thaddeus, Complete collineations revisited. Math. Ann. 315 (1999), 469–495, https://doi.org/10.1007/s002080050324
  5. [6]M. Kapranov, Chow quotients of Grassmannians I, Adv. Soviet Math. 16 (1993), 29–110, https://arxiv.org/abs/alg-geom/9210002
  6. [7]Valery Alexeev, Moduli of Weighted Hyperplane Arrangements, Advanced Courses in Mathematics. CRM Barcelona, Springer , Basel, 2015. https://doi.org/10.1007/978-3-0348-0915-3
  7. [8]James Oxley. Matroid theory, Oxford University Press, 2011. https://www.math.ens.psl.eu/~benoist/refs/Oxley.pdf.
  8. [9]D. Mumford, J. Fogarty, F. Kirwan: Geometric invariant theory. Third edition. Ergebnisse der Mathematik und ihrer Grenzgebiete (2), 34. Springer-Verlag, Berlin, 1994. https://link.springer.com/book/9783540569633
  9. [10]Herrmann, Jensen, Joswig, Sturmfels, How to draw tropical planes, Electron. J. Combin. 16 (2009), no. 2, Special volume in honor of Anders Bjorner, Research Paper 6, 26. https://arxiv.org/pdf/0808.2383
  10. [11]S.Herrmann, M.Joswig, D.Speyer, Dressians, tropical Grassmannians, and their rays. Forum Math. 26(6), 2014. https://arxiv.org/pdf/1112.1278
  11. [12]M. Cleya, G.Loho, C. Yuen, Oriented matroids of triangulations of products of simplices, Selecta Mathematical, 2024, Springer. https://arxiv.org/pdf/2005.01787
  12. [13]M. Hedayatzadeh, M. Hasani, Inverse limit and Chow quotient of point configurations in projective spaces are not isomorphic, preprint, 2026.
  13. [14]E. Feichtner, B. Sturmfels, Matroid polytopes, nested sets and Bergman fans, Port. Math. (N.S.), 62 (2005), pp. 437–468.

Paper details

vlnc:W_zjjudt2c
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents