Related papers: $k$-fold circuits and coning in rigidity matroids

We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…

We construct a collection of higher Chow cycles on certain surfaces which degenerate to an arrangement of planes in general position. When its degree is 4, this construction gives a new explicit proof of the Hodge-D-Conjecture for a certain…

Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…

A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…

We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…

A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can be seen as a matroidal generalization of a biased graph. We…

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…

The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been extensive interest in rigid…

Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…

We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic…

We develop a new framework to study minimum $d$-degree conditions in $k$-uniform hypergraphs, which guarantee the existence of a tight Hamilton cycle. Our main theoretical result deals with the typical absorption, path cover and connecting…

Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…

We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs.

The vortex core structure in a d-wave superconductor is analyzed on the basis of the quasi-classical Eilenberger theory beyond the Ginzburg-Landau framework. The current and magnetic field distributions around an isolated vortex break…

We show that a generic framework $(G,p)$ on the cylinder is globally rigid if and only if $G$ is a complete graph on at most four vertices or $G$ is both redundantly rigid and $2$-connected. To prove the theorem we also derive a new…

In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…

Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid $M$ is Hamiltonian if it has a spanning circuit. A matroid $M$ is nested if and only if its Hamiltonian flats…

Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…