39,437 research outputs found
The Linkage Problem for Group-labelled Graphs
This thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to "group-labelled graphs". Let be a group. A -labelled graph is an oriented graph with its edges labelled from , and is thus a generalization of a signed graph.
Our primary result is a generalization of the main result from Graph Minors XIII. For any finite abelian group , and any fixed -labelled graph , we present a polynomial-time algorithm that determines if an input -labelled graph has an -minor. The correctness of our algorithm relies on much of the machinery developed throughout the graph minors papers. We therefore hope it can serve as a reasonable introduction to the subject.
Remarkably, Robertson and Seymour also prove that for any sequence of graphs, there exist indices such that is isomorphic to a minor of . Geelen, Gerards and Whittle recently announced a proof of the analogous result for -labelled graphs, for finite abelian. Together with the main result of this thesis, this implies that membership in any minor closed class of -labelled graphs can be decided in polynomial-time. This also has some implications for well-quasi-ordering certain classes of matroids, which we discuss
Recipe theorems for polynomial invariants on ribbon graphs with half-edges
We provide recipe theorems for the Bollob\`as and Riordan polynomial
defined on classes of ribbon graphs with half-edges introduced in
arXiv:1310.3708[math.GT]. We also define a generalized transition polynomial
on this new category of ribbon graphs and establish a relationship between
and .Comment: 24 pages, 14 figure
Bicircular signed-graphic matroids
Several matroids can be defined on the edge set of a graph. Although
historically the cycle matroid has been the most studied, in recent times, the
bicircular matroid has cropped up in several places. A theorem of Matthews from
late 1970s gives a characterization of graphs whose bicircular matroids are
graphic. We give a characterization of graphs whose bicircular matroids are
signed-graphic.Comment: 8 page
Knot Graphs
We consider the equivalence classes of graphs induced by the unsigned
versions of the Reidemeister moves on knot diagrams.
Any graph which is
reducible by some finite sequence of these moves, to a graph with no
edges is called a knot graph. We show that the class of knot graphs
strictly contains the set of delta-wye graphs. We prove that the
dimension of the intersection of the cycle and cocycle spaces is an
effective numerical invariant of these classes
On perturbations of highly connected dyadic matroids
Geelen, Gerards, and Whittle [3] announced the following result: let be a prime power, and let be a proper minor-closed class of
-representable matroids, which does not contain
for sufficiently high . There exist integers
such that every vertically -connected matroid in is a
rank- perturbation of a frame matroid or the dual of a frame matroid
over . They further announced a characterization of the
perturbations through the introduction of subfield templates and frame
templates.
We show a family of dyadic matroids that form a counterexample to this
result. We offer several weaker conjectures to replace the ones in [3], discuss
consequences for some published papers, and discuss the impact of these new
conjectures on the structure of frame templates.Comment: Version 3 has a new title and a few other minor corrections; 38
pages, including a 6-page Jupyter notebook that contains SageMath code and
that is also available in the ancillary file
Classical Ising model test for quantum circuits
We exploit a recently constructed mapping between quantum circuits and graphs
in order to prove that circuits corresponding to certain planar graphs can be
efficiently simulated classically. The proof uses an expression for the Ising
model partition function in terms of quadratically signed weight enumerators
(QWGTs), which are polynomials that arise naturally in an expansion of quantum
circuits in terms of rotations involving Pauli matrices. We combine this
expression with a known efficient classical algorithm for the Ising partition
function of any planar graph in the absence of an external magnetic field, and
the Robertson-Seymour theorem from graph theory. We give as an example a set of
quantum circuits with a small number of non-nearest neighbor gates which admit
an efficient classical simulation.Comment: 17 pages, 2 figures. v2: main result strengthened by removing
oracular settin
- …