The asymptotic number of geometries
From MaRDI portal
Publication:1394344
DOI10.1016/0097-3165(74)90063-6zbMATH Open0278.05010OpenAlexW2057929994MaRDI QIDQ1394344FDOQ1394344
Authors: Donald E. Knuth 
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(74)90063-6
Exact enumeration problems, generating functions (05A15) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60)
Cites Work
Cited In (24)
- Random matroids
- Matroids from hypersimplex splits
- Coxeter submodular functions and deformations of Coxeter permutahedra
- Antimatroids induced by matchings
- Gross substitutability: an algorithmic survey
- Enumeration of extensions of the cycle matroid of a complete graph
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- On the number of matroids
- Secret sharing schemes for ports of matroids of rank 3.
- An entropy argument for counting matroids
- A method to construct all the paving matroids over a finite set
- On the number of bases of almost all matroids
- Positroids and non-crossing partitions
- On the problem of approximating the number of bases of a matroid
- The dependence graph for bases in matroids
- How many delta-matroids are there?
- Enumerating matroids and linear spaces
- The number of polytopes, configurations and real matroids
- On the complex-representable excluded minors for real-representability
- Counting matroids in minor-closed classes
- Representability of orthogonal matroids over partial fields
- Tight approximation for unconstrained XOS maximization
- Approximation limitations of pure dynamic programming
This page was built for publication: The asymptotic number of geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394344)
