2022-01-18T00:46:23Zhttps://tsukuba.repo.nii.ac.jp/oaioai:tsukuba.repo.nii.ac.jp:000227332021-03-02T07:46:49ZMöbius functions on rooted forests and their applications to Faigle-Kern's dual greedy polyhedra安藤, 和敏Ando, KazutoshiA poset in called a rooted forest if element has at most one cover. We will show that the Mobius function on a rooted forest maps the (order) indeals to the antichains. Equipped with this linear mapping, the linear programming problem over Faigle-Kern's dual greedy polyhedra can be reduced to those over submodular polyheara in the ordinary sense. Here, Mobius function connects these problems in the space of linear programming dual. Using this framework, Intersection Theorem on dual greedy polyhedra can also be reduced to that on submodular polyhedra. Futhermore, we show a new min-max theorem concerning intersection of two such dual greedy polydeara.technical report2000application/pdfhttp://hdl.handle.net/2241/780https://tsukuba.repo.nii.ac.jp/record/22733/files/1.pdfjpnInstitute of Policy and Planning Sciences discussion paper series ~ no. 885