Related papers: Two remarks concerning balanced matroids

Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

We present two characterizations of regular matroids among orientable matroids and use them to give a measure of "how far" an orientable matroid is from being regular.

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Pairwise comparisons between alternatives are a well-known method for measuring preferences of a decision-maker. Since these often do not exhibit consistency, a number of inconsistency indices has been introduced in order to measure the…

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that may fail, we ask for a robust solution that, after the failing elements are revealed, can…

Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…

Sparse matrix ordering is a vital optimization technique often employed for solving large-scale sparse matrices. Its goal is to minimize the matrix bandwidth by reorganizing its rows and columns, thus enhancing efficiency. Conventional…

This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…

Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…

We present a new algorithm for computing the volume of an arbitrary matroid base polytope. We provide two applications of this approach: a relation between the volume of the base polytope of a matroid $\M$ and its relaxation $\M'$, and a…

A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…

Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…

Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…

Motivated by a property of linear resistive electrical networks, we introduce the class of Rayleigh matroids. This is a subclass of the balanced matroids introduced by Feder and Mihail [FM] in 1992. We prove a variety of results relating…

The Chow class of the closure of the torus orbit of a point in a Grassmannian only depends on the matroid associated to the point. The Chow class can be extended to a matroid invariant of arbitrary matroids. We call the coefficients…