Uniform Semimodular Lattice & Valuated Matroid
Hiroshi Hirai University of Tokyo [email protected]
JSIAM, Osaka University Osaka, March 15, 2018
1 Contents
1. Matroid v.s. geometric lattice 2. Valuated matroid 3. Result: uniform semimoduler lattice • examples • valuated matroid uniform semimodular lattice • uniform semimodular lattice valuated matroid 4. Concluding remarks
2 Matroid
: base family
[EXC] ,
3 Representable Matroid
is a basis } ): matroid
4 Lattice
Lattice := partially ordered set s. t. join & meet exist
atom
5 Geometric Lattice := atomistic semimodular lattice semimodular: atomistic: { atom }
is geometric lattice ordered by 6 Matroid v.s. Geometric Lattice Birkoff 1940 : matroid
The family of flats
is a geometric lattice.
geometric lattice of height , the set of atoms
) is a (simple) matroid
7 Valuated Matroid Dress-Wenzel 1990 Valuated matroid on matroid :
• Greedy algorithm • M-convexity, Discrete convex analysis (Murota 1996~) • Tropical Plucker vector (Speyer-Sturmfels 2004, Speyer 2008)
8 Representable Valuated Matroid
is a basis }
is a valuated matroid
[VEXC] = Tropicalization of Grassmann-Plucker identity
9 Tree Metric
tree
Four-point condition =VEXC
is a valuated matroid
10 Result
Matroid Geometric Lattice
integer-valued Uniform Valuated Matroid Semimodular Lattice
11 Definition
Geometric lattice = atomistic semimodular lattice semimodular: atomistic: { atom }
Uniform semimodular lattice semimodular: uniform: is automorphism
is geometric lattice 12 Example 1: Integer Lattice
is uniform (semi)modular lattice = min, = max,
13 Example 2.
is uniform (semi)modular lattice corresponding to tree metric 14 Example 3. Lattice of Lattice
Lattice = rank free -submodule of