Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders

DOI10.1007/3-540-61332-3_140zbMath1529.68184OpenAlexW1496611045MaRDI QIDQ6142893

Kyoko Sekine, Kensyu Yoshida, Satoru Iwata, Hiroshi Imai

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_140

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Linear codes (general theory) (94B05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New trends in discrete and computational geometry
• Computing the number of mergings with constraints
• Matroid representation over GF(3)
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• A random polynomial-time algorithm for approximating the volume of convex bodies

This page was built for publication: Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders