Related papers: On graphic splitting of regular matroids
Mathematical morphology contributes many profitable tools to image processing area. Some of these methods considered to be basic but the most important fundamental of data processing in many various applications. In this paper, we modify…
This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…
Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…
In this work we study operator splitting methods for a certain class of coupled abstract Cauchy problems, where the coupling is such that one of the problems prescribes a "boundary type" extra condition for the other one. The theory of…
The theory of slice regular functions over the quaternions, introduced by Gentili and Struppa in [5], was born on domains that intersect the real axis. This hypothesis can be overcome using the theory of stem functions introduced by Ghiloni…
Basic path-matchings, introduced by Cunningham and Geelen (FOCS 1996), are a common generalization of matroid intersection and non-bipartite matching. The main results of this paper are a new algebraic characterization of basic…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
We define a class of discrete operators acting on infinite, finite or periodic sequences mimicking the standard properties of pseudo-differential operators. In particular we can define the notion of order and regularity, and we recover the…
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…
Let $A\subseteq B$ be a ring extension and $\mathcal{G}$ be a set of $A$-submodules of $B$. We introduce a class of closure operations on $\mathcal{G}$ (which we call \emph{multiplicative operations on $(A,B,\mathcal{G})$}) that generalizes…
Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree…
We introduce a notion of duality (due to Brylawski) that generalizes matroid duality to arbitrary rank functions. This generalized duality allows for generalized operations (deletion and contraction) and a generalized polynomial based on…
Marion Scheepers, in his studies of the combinatorics of open covers, introduced the property Split(U,V) asserting that a cover of type U can be split into two covers of type V. In the first part of this paper we give an almost complete…
Graphical domination was first introduced in [1] in the context of combinatorial threshold-linear networks (CTLNs). There it was shown that when a domination relationship exists between a pair of vertices in a graph, certain fixed points in…
We consider the strong Lefschetz property for standard graded Artinian Gorenstein algebras. Such an algebra has a presentation of the quotient algebra of the ring of the differential polynomials modulo the annihilator of some homogeneous…
We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…
We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the…
Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…
A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…
In this paper, we study dual quaternion and dual complex unit gain graphs and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications…