Related papers: Contractors for flows
This work re-examines a classical construction of a 2-connected (simple) graph where every intermediate graph is 2-connected before detailing an analogous construction for 3-connected graphs which requires a graph equivalence relation…
The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform…
In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…
Morphisms in the linear category A of Jacobi diagrams in handlebodies give rise to interesting contravariant functors on the category gr of finitely-generated free groups, encoding part of the composition structure of the category A. These…
We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian…
The paper is devoted to generic translation flows corresponding to Abelian differentials on flat surfaces of arbitrary genus $g\ge 2$. These flows are weakly mixing by the Avila-Forni theorem. In genus 2, the H\"older property for the…
We present a new systematic method to construct Abelian functions on Jacobian varieties of plane, algebraic curves. The main tool used is a symmetric generalisation of the bilinear operator defined in the work of Baker and Hirota. We give…
The main goal of this paper is to find operator algebra variants of certain deep results of Stormer, Friedman and Russo, Choi and Effros, Effros and Stormer, Robertson and Youngson, Youngson, and others, concerning projections on…
We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is even consecutive. This implies that Ford and Fulkerson's…
Lov\'asz and Cherkassky discovered in the 1970s independently that if $ G $ is a finite graph with a given set $ T $ of terminal vertices such that $ G $ is inner Eulerian, then the maximal number of edge-disjoint paths connecting distinct…
In this paper we show that every non-cycle finite transitive directed graph has a Cuntz-Krieger family whose WOT-closed algebra is $B(\mathcal{H})$. This is accomplished through a new construction that reduces this problem to in-degree…
For a graph G embedded in an orientable surface \Sigma, we consider associated links L(G) in the thickened surface \Sigma \times I. We relate the HOMFLY polynomial of L(G) to the recently defined Bollobas-Riordan polynomial of a ribbon…
We note that the deep results of Grunewald and Segal on algorithmic problems for arithmetic groups imply the decidability of several matrix equivalence problems involving poset-blocked matrices over Z. Consequently, results of Eilers,…
Hadwiger's Conjecture states that every graph with chromatic number $k$ contains a complete graph on $k$ vertices as a minor. This conjecture is a tremendous strengthening of the Four-Colour Theorem and is regarded as one of the most…
For a topological flow $(V,\phi)$ - i.e., $V$ is a linearly compact vector space and $\phi$ a continuous endomorphism of $V$ - we gain a deep understanding of the relationship between $(V,\phi)$ and the Bernoulli shift: a topological flow…
In this second part of a sequence of two papers, we discuss the implementation of a curvature flow on weighted graphs based on the Bakry-\'Emery calculus. This flow can be adapted to preserve the Markovian property and its limits as time…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking…
We consider variational (density functional) models of fluids confined in parallel-plate geometries (with walls situated in the planes z=0 and z=L respectively) and focus on the structure of the pair correlation function G(r_1,r_2). We show…
We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic behavior of a class of measurement patterns defined over them. Dependent Pauli corrections are derived for all…