Related papers: On graphic splitting of regular matroids
A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain graphs, called frame matroids and lift matroids, and investigated linear representations of them. Each matroid…
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…
It is well known that the optical branches of the dispersion curves of ionic crystals exhibit a polaritonic feature, i.e., a splitting about the electromagnetic dispersion line $\omega=ck$. This phenomenon is considered to be due to the…
We introduce and study a natural variant of matroid amalgams. For matroids M(A) and N(B) such that M/(A-B)=N(B-A), we define a splice of M and N to be a matroid L on the union of A and B with L(B-A)=M and L/(A-B)=N. We show that splices…
The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…
This is the first part of a series devoting to the generalizations and applications of common theorems in variational bifurcation theory. Using parameterized versions of splitting theorems in Morse theory we generalize some famous…
We study valuated matroids, their tropical incidence relations, flag matroids and total positivity. This leads to a characterization of permutahedral subdivisions, namely subdivisions of regular permutahedra into generalized permutahedra.…
In this work, we explore the use of operator splitting algorithms for solving regularized structural topology optimization problems. The context is the classical structural design problems (e.g., compliance minimization and compliant…
In this paper a general theory of semi-classical matrix orthogonal polynomials is developed. We define the semi-classical linear functionals by means of a distributional equation $D(u A) = u B,$ where $A$ and $B$ are matrix polynomials.…
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm. In this…
The handle slide operation, originally defined for ribbon graphs, was extended to delta-matroids by I. Moffatt and E. Mphako-Bandab, who show that, using a delta-matroid analogue of handle slides, every binary delta-matroid in which the…
The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".
The paper deals with ring extensions $R\subseteq S$ and their lattices $[R,S]$ of subextensions and is mainly devoted to FCP extensions (extensions whose lattices are Artinian and Noetherian). The object of the paper is the introduction and…
In this article we classify normal forms and unfoldings of linear maps in eigenspaces of (anti)-automorphisms of order two. Our main motivation is provided by applications to linear systems of ordinary differential equations, general and…
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)…
In the recent years we have witnessed a rapid development of new algorithmic techniques for parameterized algorithms for graph separation problems. We present experimental evaluation of two cornerstone theoretical results in this area:…
One of the classic problems in online decision-making is the *secretary problem* where to goal is to maximize the probability of choosing the largest number from a randomly ordered sequence. A natural extension allows selecting multiple…
The paper establishes the property of splittability of billiard boundary sequences in n dimensional cube into subsequences of fractional parts. This reveals a new property of integrable and weak perturbated Hamilton systems: under a simple…
Spectral graph theory is well known and widely used in computer vision. In this paper, we analyze image segmentation algorithms that are based on spectral graph theory, e.g., normalized cut, and show that there is a natural connection…
The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…