相关论文: Two remarks concerning balanced matroids

We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the Weighted Diverse Bases problem…

In many applications it will be useful to know those patterns that occur with a balanced interval, e.g., a certain combination of phone numbers are called almost every Friday or a group of products are sold a lot on Tuesday and Thursday. In…

So far there has not been paid attention to frames that are balanced, i.e. those frames which sum is zero. In this paper we consider balanced frames, and in particular balanced unit norm tight frames, in finite dimensional Hilbert spaces.…

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

We use counting arguments to show that asymptotically almost all sparse paving matroids contain an $H$-minor, where $H$ falls into one of several simple classes of matroids. Furthermore the result holds for all $H$ in a larger class of…

At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…

Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

We introduce the parametric matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for…

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…

In a matroid secretary problem, one is presented with a sequence of objects of various weights in a random order, and must choose irrevocably to accept or reject each item. There is a further constraint that the set of items selected must…

Research in explorable uncertainty addresses combinatorial optimization problems where there is partial information about the values of numeric input parameters, and exact values of these parameters can be determined by performing costly…

We give a new perspective of the relationship between simple matroids of rank 3 and pairwise balanced designs, connecting Wilson's theorems and tools with the theory of truncated boolean representable simplicial complexes. We also introduce…

We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. We study the…

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

We present an algorithm to reduce the computational effort for the multiplication of a given matrix with an unknown column vector. The algorithm decomposes the given matrix into a product of matrices whose entries are either zero or integer…

In this paper, we study the problem of maximizing social welfare in combinatorial markets through pricing schemes. We consider the existence of prices that are capable to achieve optimal social welfare without a central tie-breaking…

A positroid is a special case of a realizable matroid that arose from the study of the totally nonnegative part of the Grassmannian by Postnikov. In this paper, we study the facets of its matroid polytope and the independent set polytope.…