tailieunhanh - Báo cáo toán học: "Computing parametric rational generating functions with a primal Barvinok algorithm"

Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: Computing parametric rational generating functions with a primal Barvinok algorithm. | Computing parametric rational generating functions with a primal Barvinok algorithm Matthias Koppe Otto-von-Guericke-Universitat Magdeburg Department of Mathematics Institute for Mathematical Optimization IMO Universitatsplatz 2 39106 Magdeburg Germany mkoeppe@ Sven Verdoolaege Leiden Institute of Advanced Computer Science LIACS Universiteit Leiden Niels Bohrweg 1 2333 CA Leiden The Netherlands sverdool@ Submitted Aug 27 2007 Accepted Oct 5 2007 Published Jan 21 2008 Mathematics Subject Classifications 05A15 52C07 68W30 Abstract Computations with Barvinok s short rational generating functions are traditionally being performed in the dual space to avoid the combinatorial complexity of inclusion-exclusion formulas for the intersecting proper faces of cones. We prove that on the level of indicator functions of polyhedra there is no need for using inclusion-exclusion formulas to account for boundary effects All linear identities in the space of indicator functions can be purely expressed using partially open variants of the full-dimensional polyhedra in the identity. This gives rise to a practically efficient parametric Barvinok algorithm in the primal space. 1 Introduction We consider a family of polytopes Pq x 2 Rd Ax q g parameterized by a righthand side vector q 2 Q c Rm where the set of right-hand sides is restricted to some The first author was supported by a 2006 2007 Feodor Lynen Research Fellowship from the Alexander von Humboldt Foundation. He also acknowledges the hospitality of Jesus De Loera and the Department of Mathematics of the University of California Davis where a part of this work was completed. THE ELECTRONIC JOURNAL OF COMBINATORICS 15 2008 R16 1 polyhedron Q. For this family of polytopes we define the parametric counting function c Q N by c q Pq Zd 1 Note that this includes vector partition functions c A x 2 Nd A0x A g as a special case. It is well-known that the counting function 1 is a piecewise quasipolynomial

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.