Related papers: Symplectic Matroids, Circuits, and Signed Graphs
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
We provide a constructive characterisation of circuits in the simple (2,2)-sparsity matroid. A circuit is a simple graph G=(V,E) with |E|=2|V|-1 and the number of edges induced by any $X \subsetneq V$ is at most 2|X|-2. Insisting on…
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…
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…
Given two four-dimensional symplectic manifolds, together with knots in their boundaries, we define an ``anchored symplectic embedding'' to be a symplectic embedding, together with a two-dimensional symplectic cobordism between the knots…
An open problem in convex geometry asks whether two simplices $A,B\subseteq\mathbb{R}^d$, both containing the origin in their convex hulls, admit a polynomial-length sequence of vertex exchanges transforming $A$ into $B$ while maintaining…
We study cells in generalised Bott-Samelson varieties for type C. These cells are parametrised by certain galleries in the affine building. We define a set of readable galleries - we show that the closure in the affine Grassmannian…
In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graphic matroids is the same as that of characterizing matroids…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
This paper introduces Dirichlet matroids, a generalization of graphic matroids arising from electrical networks. We present four main theorems. First, we exhibit a matroid quotient involving geometric duals of networks embedded in surfaces…
We identify a family of torus representations such that the corresponding singular symplectic quotients at the $0$-level of the moment map are graded regularly symplectomorphic to symplectic quotients associated to representations of the…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…
Symplectic maps can provide a straightforward and accurate way to visualize and quantify the dynamics of conservative systems with two degrees of freedom. These maps can be easily iterated from the simplest computers to obtain trajectories…
Cotransversal matroids are a family of matroids that arise from planted graphs. We prove that two planted graphs give the same cotransversal matroid if and only if they can be obtained from each other by a series of local moves.
Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids…
We consider two categories related to symplectic manifolds: 1. Objects are symplectic manifolds and morphisms are symplectic embeddings. 2. Objects are symplectic manifolds endowed with compatible almost complex structure and morphisms are…
We introduce the notion of symplectic microfolds and symplectic micromorphisms between them. They form a monoidal category, which is a version of the "category" of symplectic manifolds and canonical relations obtained by localizing them…
We consider the homotopy type of maps between symplectic surface whose graphs form symplectic submanifolds of the product. We give a purely topological model for this space in terms of maps with constrained numbers of pre-images. We use…
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…