Related papers: The excluded 3-minors for vf-safe delta-matroids
G\v avruta studied atomic systems in terms of frames for range of operators (that is, for subspaces), namely $K$-frames, where the lower frame condition is controlled by the Hilbert-adjoint of a bounded linear operator $K$. For a locally…
Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions of first-order logic such as FO+dp admit efficient model…
Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope classes, by their Grassmann necklaces. We give an explicit…
This is a revised version of our original paper (arXiv:1808.00489v2) incorporating the corrections published in a corrigendum (arXiv:1808.00489v3). Our main theorem as originally stated was missing the required assumption that matroids…
The affine vertex operator algebras for $\mathfrak{sl}_2$ and the Virasoro minimal models are related by Drinfeld-Sokolov reduction and by the Goddard-Kent-Olive coset construction. In this work, we propose another connection based on…
Two monolayers of graphene twisted by a small `magic' angle exhibit nearly flat bands leading to correlated electronic states and superconductivity, whose precise nature including possible broken symmetries, remain under debate. Here we…
We study complexified elliptic Calogero-Moser integrable systems. We determine the value of the potential at isolated extrema, as a function of the modular parameter of the torus on which the integrable system lives. We calculate the…
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…
Problems of segmentation, denoising, registration and 3D reconstruction are often addressed with the graph cut algorithm. However, solving an unconstrained graph cut problem is NP-hard. For tractable optimization, pairwise potentials have…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I, it was shown that graphs that are critical for embeddings into surfaces of Euler genus $k$ or for embeddings into nonorientable surface…
In this paper, we present a lattice-theoretic characterization for valuated matroids, which is an extension of the well-known cryptomorphic equivalence between matroids and geometric lattices ($=$ atomistic semimodular lattices). We…
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)…
We present representative sets-style statements for linear delta-matroids, which are set systems that generalize matroids, with important connections to matching theory and graph embeddings. Furthermore, our proof uses a new approach of…
A minimal separator in a graph is an inclusion-minimal set of vertices that separates some fixed pair of nonadjacent vertices. A graph class is said to be tame if there exists a polynomial upper bound for the number of minimal separators of…
Distributed network optimization algorithms, such as minimum spanning tree, minimum cut, and shortest path, are an active research area in distributed computing. This paper presents a fast distributed algorithm for such problems in the…
Hypergraph Horn functions were introduced as a subclass of Horn functions that can be represented by a collection of circular implication rules. These functions possess distinguished structural and computational properties. In particular,…
Let $M$ be a $3$-connected matroid. A pair $\{e,f\}$ in $M$ is detachable if $M \backslash e \backslash f$ or $M / e / f$ is $3$-connected. Williams (2015) proved that if $M$ has at least 13 elements, then at least one of the following…
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…
In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we…