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

DOI10.1007/3-540-61332-3_140MaRDI QIDQ6142893zbMATH OpenOpenAlexFDO

Authors Hideki Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida

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) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorics of partially ordered sets (06A07) Linear codes (general theory) (94B05)

Recommendations

• Some problems on approximate counting in graphs and matroids
• Counting linear extensions
• Counting polynomials for linear codes, hyperplane arrangements, and matroids
• On the Complexity of Some Enumeration Problems for Matroids
• Algorithms and Computation

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1555978 (Why is no real title available?)
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Computing the number of mergings with constraints
• Matroid representation over GF(3)
• NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
• New trends in discrete and computational geometry
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6142893)