Related papers: Reverse Mathematics of Matroids
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…
This work explores fundamental modeling and algorithmic issues arising in the well-established MapReduce framework. First, we formally specify a computational model for MapReduce which captures the functional flavor of the paradigm by…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
In reverse mathematics, is is possible to have a curious situation where we know that an implication does not reverse, but appear to have no information on on how to weaken the assumption while preserving the conclusion. A main cause of…
Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…
We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…
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 Note we show that the notion of a basis of a finite-dimensional vector space could be introduced by an argument much weaker than Gauss' reduction method. Our aim is to give a short proof of a simply formulated lemma, which in fact…
The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
While an explicit basis is common in the study of Euclidean spaces, it is usually implied in the study of inertial relativistic systems. There are some conceptual advantages to including the basis in the study of special relativistic…
We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
Our main result is the proof of an inequality between the spectral numbers of a Lagrangian and the spectral numbers of its reductions, in the opposite direction to the classical inequality (see e.g [Vit92]). This has applications to the…
A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…
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…
This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…