Related papers: A note on connectivity preserving splitting operat…
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…
We consider the following Stochastic Boolean Function Evaluation problem, which is closely related to several problems from the literature. A matroid $\mathcal{M}$ (in compact representation) on ground set $E$ is given, and each element…
For a matroid, we define a new simplicial complex whose facets are indexed by its independent sets. This complex contains the external activity complex as a subcomplex. We call our complex the augmented external activity complex since its…
This paper continues the study of certain two-dimensional Galois representations attached to modular forms (mod p) via a construction due to Deligne. In particular, we prove a criterion for determining when the representation is split when…
We consider Hamiltonian PDEs that can be split into a linear unbounded operator and a regular non linear part. We consider abstract splitting methods associated with this decomposition where no discretization in space is made. We prove a…
In this paper, we prove that slice polyanalytic functions on quaternions can be considered as solutions of a power of some special global operator with nonconstant coefficients as it happens in the case of slice hyperholomorphic functions.…
In the matroid partitioning problem, we are given $k$ matroids $\mathcal{M}_1 = (V, \mathcal{I}_1), \dots , \mathcal{M}_k = (V, \mathcal{I}_k)$ defined over a common ground set $V$ of $n$ elements, and we need to find a partitionable set $S…
In this paper we describe splitting methods for solving Levitron, which is motivated to simulate magnetostatic traps of neutral atoms or ion traps. The idea is to levitate a magnetic spinning top in the air repelled by a base magnet. The…
Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. A pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an…
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…
A matroid $N$ is a lift of a binary matroid $M$, if $N=Q\backslash X$ when $Q/X=M$ for some binary matroid $Q$ and $X \subseteq E(Q)$ and is called an elementary lift of $M$, if $|X|=1$. A splitting operation on a binary matroid can result…
A new isomorphism invariant of matroids is introduced, in the form of a quasisymmetric function. This invariant (1) defines a Hopf morphism from the Hopf algebra of matroids to the quasisymmetric functions, which is surjective if one uses…
We show split property of gapped ground states for Fermion systems on a one-dimensional lattice and clarify mathematical meaning of string order of fermions.
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of…
There are three main results in this paper. First, we find an easily computable and simple condition which is necessary and sufficient for a commuting tuple of contractions to possess a non-zero Toeplitz operator. This condition is just…
We model $p$-state Fock parafermions on a lattice in one dimension (with occupation per orbital of $0,1 , \ldots ,p-1$). For $p$ a composite number, they may be mapped to $q_m$-state parafermions where $q_m$ are the prime factors of $p$.…
We present some Euler-type recurrences for the partition function $p(n)$.
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…
There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…