相关论文: Canonical binary $\Delta$-matroids
Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…
In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Specifically, we provide a polynomial-time algorithm which…
Let X be a minimal complex surface of general type such that its image via the canonical map is a surface; we denote by d the degree of the canonical map. In this expository work, first of all we recall the known possibilities for the…
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
Semi-log canonical varieties are a higher-dimensional analogue of stable curves. They are the varieties appearing as the boundary $\Delta$ of a log canonical pair $(X,\Delta)$, and also appear as limits of canonically polarized varieties in…
We give necessary and sufficient conditions for two matroids on the same ground set to be the upper and lower matroid of a $\Delta$-matroid.
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
Lin and Sjamaar have used symplectic Hodge theory to obtain canonical equivariant extensions for Hamiltonian actions on closed symplectic manifolds that have the strong Lefschetz property. Here we obtain canonical equivariant extensions…
We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids. Using combinatorial properties of multimatroids rather than…
A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…
We define and study q-delta-matroids, and q-g-matroids. These objects are analogues, for finite-dimensional vector spaces over finite fields, of delta-matroids and g-matroids arising from finite sets. We compare axiomatic descriptions with…
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…
The mapping class group $\Gamma$ of the complement of a Cantor set in the plane arises naturally in dynamics. We show that the ray graph, which is the analog of the complex of curves for this surface of infinite type, has infinite diameter…
The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
A canonical model, analogous to the one for contraction operators, is introduced for bi-isometries, two commuting isometries on a Hilbert space. This model involves a contractive analytic operator-valued function on the unit disk. Various…
In 1961, Dirac showed that chordal graphs are exactly the graphs that can be constructed from complete graphs by a sequence of clique-sums. In an earlier paper, by analogy with Dirac's result, we introduced the class of $GF(q)$-chordal…
We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…