Related papers: Matroidal structure of rough sets based on serial …
Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
Soft set theory and rough set theory are mathematical tools to deal with uncertainties. In [3], authors combined these concepts and introduced soft rough sets. In this paper, we introduce the concepts of soft rough graphs, vertex and edge…
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…
Traditional robots have rigid links and structures that limit their ability to interact with the dynamics of their immediate environment. For example, conventional robot manipulators with rigid links can only manipulate objects using…
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".
Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same ground set, the matroid intersection problem is to find the maximum cardinality common independent set. In the weighted version of the problem, the goal is to find a…
We study the approximation properties of convolutional architectures applied to time series modelling, which can be formulated mathematically as a functional approximation problem. In the recurrent setting, recent results reveal an…
We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid. We establish the existence of such an embedding for binary…
Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…
In this paper we introduce and study some mathematical structures on top of transitive Lie algebroids in order to formulate gauge theories in terms of generalized connections and their curvature: metrics, Hodge star operator and integration…
The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…
We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
An access structure is said to be multipartite, if the set of participants is divided into several parts and all participants in the same part play an equivalent role. The search for ideal secret sharing schemes for some special interesting…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
We examine non-dual relational extensions of rough set approximations and find an extension which satisfies surprisingly many of the usual rough set properties. We then use this definition to give an explanation for an observation made by…
In this article, we investigate the multi-parametric matroid problem. The weights of the elements of the matroid's ground set depend linearly on an arbitrary but fixed number of parameters, each of which is taken from a real interval. The…