Related papers: Matroidal structure of generalized rough sets base…
Neural network models are one of the most successful approaches to machine learning, enjoying an enormous amount of development and research over recent years and finding concrete real-world applications in almost any conceivable area of…
One generalization of ordinary matroids is symplectic matroids. While symplectic matroids were initially defined by their collections of bases, there has been no cryptomorphic definition of symplectic matroids in terms of circuits. We give…
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed…
Over the past years several authors have used the approach of generalized modeling to study the dynamics of food chains and food webs. Generalized models come close to the efficiency of random matrix models, while being as directly…
In this paper, a new kind of soft sets related with some common decision making problems in real life called central soft sets is introduced. Properties of some basic operations on central soft sets are shown. It is investigated that some…
We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…
In 1980, Las Vergnas defined a notion of discrete convexity for oriented matroids, which Edelman subsequently related to the theory of anti-exchange closure functions and convex geometries. In this paper, we use generalized matroid activity…
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…
This paper pursues a twofold goal. First, we introduce and study in detail a new notion of variational analysis called generalized metric subregularity, which is a far-going extension of the conventional metric subregularity conditions. Our…
This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…
In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid,…
It is well-understood that the robustness of mechanical and robotic control systems depends critically on minimizing sensitivity to arbitrary application-specific details whenever possible. For example, if a system is defined and performs…
Recent advances in the study of networked systems have highlighted that our interconnected world is composed of networks that are coupled to each other through different "layers" that each represent one of many possible subsystems or types…
We present an approach to generalized Riordan arrays which is based on operations in one large group of lower triangular matrices. This allows for direct proofs of many properties of weighted Sheffer sequences, and shows that all the groups…
In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…
We study a generalization of the concept of harmonic conjugation from projective geometry and full algebraic matroids to a larger class of matroids called \emph{harmonic matroids}. We use harmonic conjugation to construct a projective plane…
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…