Related papers: Symplectic Matroids, Circuits, and Signed Graphs

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

This note contains a short proof of a classical result: any rational symplectic matrix can be put in diagonal form after right and left multiplication by integral symplectic matrices.

Zaslavsky introduced the concept of lifted-graphic matroid. For binary matroids, a binary elementary lift can be defined in terms of the splitting operation. In this paper, we give a method to get a forbidden-minor characterization for the…

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,…

Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…

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,…

For a symplectic manifold $(M,\om)$ with exact symplectic form we construct a 2-cocycle on the group of symplectomorphisms and indicate cases when this cocycle is not trivial.

A matroid is Gorenstein if its toric variety is. Hibi, Laso\'n, Matsuda, Micha\l{}ek, and Vodi\v{c}ka provided a full graph-theoretic classification of Gorenstein matroids associated to simple graphs. We extend this classification to…

Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…

In this article, we derive and discuss the properties of the symplectic group Sp(2), which arises in Hamiltonian dynamics and ray optics. We show that a symplectic matrix can be written as the product of a symmetric dilation matrix and a…

We study the closure operators of polymatroids from a lattice theoretic point of view. We show that polymatroid closure operators relate to lattices enriched with a generating set in the same way that matroids relate to geometric lattices.…

The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…

We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…

This study aims to shed light on new (sub)classes of matroids originating from cluster algebras and investigate their properties. We focus on what we call cluster matroids and build some results on them. Then, we point out a relationship…

We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress…

The way circuits, relative to a basis, are affected as a result of exchanging a basis element, is studied. As consequences, it is shown that three consecutive symmetric exchanges exist for any two bases of a matroid, and that a full serial…

Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…

Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{\'a}tal et al. Note: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics, 256, 445-448, 2002]. We…