相关论文: Canonical binary $\Delta$-matroids

We prove the existence and the essential uniqueness of canonical models for the forward (resp. backward) iteration of a holomorphic self-map $f$ of a cocompact Kobayashi hyperbolic complex manifold, such as the ball $\mathbb{B}^q$ or the…

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…

We show that the symmetric difference distance measure for set systems, and more specifically for delta-matroids, corresponds to the notion of nullity for symmetric and skew-symmetric matrices. In particular, as graphs (i.e., symmetric…

Aizenbud and Lapid recently introduced a binary operation on the crystal graph $B(-\infty)$ associated to a symmetric Cartan matrix. We extend their construction to symmetrizable Cartan matrices.

We initiate the study of a type $C_n$ generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection with lattice paths which are symmetric along the main…

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…

This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like…

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Gross, Mansour and Tucker introduced the partial-dual polynomial of a ribbon graph and asked under what conditions such a polynomial is even-interpolating, odd-interpolating, or both. In this paper, we provide an answer to this open…

In 2004, Ehrenfeucht, Harju, and Rozenberg showed that any graph on a vertex set $V$ can be obtained from a complete graph on $V$ via a sequence of the operations of complementation, switching edges and non-edges at a vertex, and local…

Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

This paper concerns homological mirror symmetry for the pair-of-pants surface (A-side) and the non-isolated surface singularity $xyz=0$ (B-side). Burban-Drozd classified indecomposable maximal Cohen-Macaulay modules on the B-side. We prove…

A continuous quadratic form ("quadratic form", in short) on a Banach space $X$ is: (a) delta-semidefinite (i.e., representable as a difference of two nonnegative quadratic forms) if and only if the corresponding symmetric linear operator…

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

The multiplicative Hamiltonian flow on the phase space for a system with 1 degree of freedom was constituted from infinite hierarchy Hamiltonian flows. A new type of canonical transformation associated with the multiplicative Hamiltonian…

This is a chapter for the upcoming book "Handbook of Combinatorial Algebraic Geometry". Comments are welcome! We cover symmetric function identities tied to delta operators, as well as representation-theoretic and geometric avatars of these…

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are…

Several matroids can be defined on the edge set of a graph. Although historically the cycle matroid has been the most studied, in recent times, the bicircular matroid has cropped up in several places. A theorem of Matthews from late 1970s…

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…