38 citations · 128 across the 24 of their papers we have counts for
4 papers · 1 filter
Asymptotics of Symmetry in Matroids
Rudi Pendavingh, Jorn van der Pol
We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asympto…
On the number of bases of almost all matroids
Rudi Pendavingh, Jorn van der Pol
For a matroid of rank on elements, let denote the fraction of bases of among the subsets of the ground set with cardinality . We show that $$Ω(1/n)\leq 1-…
Enumerating matroids of fixed rank
Rudi Pendavingh, Jorn van der Pol
It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that , where denotes the number of matroids on a fixed groundset of s…
Precision and Sensitivity in Detailed-Balance Reaction Networks
Tom F. A. de Greef, Saeed Masroor, Mark A. Peletier +1
We study two specific measures of quality of chemical reaction networks, Precision and Sensitivity. The two measures arise in the study of sensory adaptation, in which the reaction…