Related papers: Quasi-matroidal classes of ordered simplicial comp…
Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…
Toric differential inclusions play a pivotal role in providing a rigorous interpretation of the connection between weak reversibility and the persistence of mass-action systems and polynomial dynamical systems. We introduce the notion of…
In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…
In this paper, we investigate which classes of monomial ideals have a quasi-additive property of homological shift ideals. More precisely, for a monomial ideal $I$ we are interested to find out whether $HS_{i+j}(I)\subseteq HS_i(HS_j(I))$.…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
The main result is Theorem MAT 11 which states that every finite closure operator is the ground set of a matroid. Its base sets consist of nonredundant covers of of the closure. These are minimal subsets that determine the closure operator…
In 1977 Stanley conjectured that the $h$-vector of a matroid independence complex is a pure $O$-sequence. In this paper we use lexicographic shellability for matroids to motivate a combinatorial strengthening of Stanley's conjecture. This…
Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…
We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network. We exhibit a…
We show that, given a rank 3 affine root system $\Phi$ with Weyl group $W$, there is a unique oriented matroid structure on $\Phi$ which is $W$-equivariant and restricts to the usual matroid structure on rank 2 subsystems. Such oriented…
We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…
The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
We investigate global properties of the mappings entering the description of symmetries of integrable spin and vertex models, by exploiting their nature of birational transformations of projective spaces. We give an algorithmic analysis of…
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…
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…
We define a notion of a rotund quasi-uniform space and describe a new direct construction of a (right-continuous) quasi-pseudometric on a (rotund) quasi-uniform space. This new construction allows to give alternative proofs of several…