TL;DR: A very simple exact algorithm of complexity O(m4n), being as fast as the first algorithm proposed for this problem, and it is proved that these greedy approaches fail for more specialized subclasses of directed cycle bases.
TL;DR: In this paper, it was shown that the Potts model of an iterated two-sum of uniform matroids satisfies the Rayleigh condition in four distinct senses, and hence that two-sums of matroid subsets of uniform sets of bases of a regular matroid are logarithmically submodular.
Abstract: Mason's Conjecture asserts that for an $m$--element rank $r$ matroid $\M$ the sequence $(I_k/\binom{m}{k}: 0\leq k\leq r)$ is logarithmically concave, in which $I_k$ is the number of independent $k$--sets of $\M$. A related conjecture in probability theory implies these inequalities provided that the set of independent sets of $\M$ satisfies a strong negative correlation property we call the \emph{Rayleigh condition}. This condition is known to hold for the set of bases of a regular matroid. We show that if $\omega$ is a weight function on a set system $\Q$ that satisfies the Rayleigh condition then $\Q$ is a convex delta--matroid and $\omega$ is logarithmically submodular. Thus, the hypothesis of the probabilistic conjecture leads inevitably to matroid theory. We also show that two--sums of matroids preserve the Rayleigh condition in four distinct senses, and hence that the Potts model of an iterated two--sum of uniform matroids satisfies the Rayleigh condition. Numerous conjectures and auxiliary results are included.
TL;DR: The main results of the paper unify and generalize several theorems of the literature on Tutte polynomials of matroids arising from graphs and vector spaces over finite fields.
TL;DR: In this paper, it was shown that two orientations of a regular matroid are equivalent if one can be obtained from the other by successive reorientations of positive circuits and/or positive cocir-cuits.
Abstract: We consider that two orientations of a regular matroid are equivalent if one can be obtained from the other by successive reorientations of positive circuits and/or positive cocir- cuits. We study the inductive deletion-contraction structure of these equivalence classes in the set of orientations, and we enumerate these classes as evaluations of the Tutte polynomial. This generalizes the results in digraphs from a previous paper.