Related papers: Elementary Lift and Single Element Coextension of …
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…
Zaslavsky introduced the concept of lifted-graphic matroid. For binary matroids, a binary elementary lift can be defined in terms of the splitting operation. In this paper, we give a method to get a forbidden-minor characterization for the…
Splitting operation in Matroid Theory does not preserve graphicness, connectedness, cographicness, etc. Also, the splitting of binary gammoid does not necessarily be binary gammoid after splitting. We have characterized a class of graphic…
Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected.
The element splitting operation on a graphic matroid, in general may not yield a cographic matroid. In this paper, we give a necessary and sufficient condition for the graphic matroid to yield cographic matroid under the element splitting…
The r-fold-n-point-splitting operation is an important operation in Graph Theory defined by Slater [15]. Later, Ghafari [6] extended 3-fold-n-point-splitting operation in binary matroids and obtained the result for Eulerian matroids whose…
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 $L(G)$ are the edge sets of those subgraphs of $G$ that contain at least two cycles, and…
Let $A$ be a non-commutative, non-unital $\mathrm{C}^\ast$-algebra. Given a set of commuting positive elements in the corona algebra $Q(A)$, we study some obstructions to the existence of a commutative lifting of such set to the multiplier…
Given two pushdown systems, the bisimilarity problem asks whether they are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIME-hardness, which was the previously best…
We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…
Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…
We show that every finite ring has a partition, where each block corresponds to one idempotent. Remarkably, this partition provides a way to \emph{lift} a wide variety of special elements such as idempotents, nilpotents, unipotents, roots…
Let G be a closed subgroup of the isometry group of a proper CAT(0)-space X. We show that if G is non-elementary and contains a rank-one element then its second bounded cohomology group with coefficients in the regular representation is…
A partial field is an algebraic object that allows one to simultaneously abstract several different representability properties of matroids. In this paper we study partial fields as algebraic objects in their own right. We characterize the…
Let $\mathrm{G}$ be a symplectic or a split orthogonal group over a local non-archimedean field $\mathrm{F}$. A prime $\ell$ is called banal with respect to $\mathrm{G}$ if it does not divide the cardinality of the $k$-points of…
Associated to each simplicial complex is a binary hierarchical model. We classify the simplicial complexes that yield unimodular binary hierarchical models. Our main theorem provides both a construction of all unimodular binary hierarchical…
For an oriented matroid M, and given a generic single element extension and a generic single element lifting of M, the main result of [1] provides a bijection between bases of M and certain reorientations of M induced by the…
In general, the splitting operation on binary matroids does not preserve the graphicness and cographicness properties of binary matroids. In this paper, we obtain a characterization of the class of graphic matroids whose splitting with…
For a weakly mixing bounded rank-one construction the disjointness of its powers is proved. For non-rigid constructions we get minimal self-joinings. Examples of non-mixing rank one actions with explicit weak closure are proposed.
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…