Related papers: Non-Commutative Integrability of the Grassmann Pen…

The Kahan discretization of the Lotka-Volterra system, associated with any skew-symmetric graph $\Gamma$, leads to a family of rational maps, parametrized by the step size. When these maps are Poisson maps with respect to the quadratic…

Connection matrices were introduced by Freedman, Lovasz and Schrijver [1], who used them to characterize graph homomorphism functions. The goal of this note is to determine the exact rank of these matrices. The result can be rephrased in…

In this paper we study a so-called separatrix map introduced by Zaslaskii-Filonenko [ZF68] and studied by Treschev and Piftankin [Tre98, Tre02, Pif06, PT07]. We derive a second order expansion of this map for trigonometric perturbations. In…

Arrangement graphs were introduced for their connection to computational networks and have since generated considerable interest in the literature. In a pair of recent articles by Chen, Ghorbani and Wong, the eigenvalues for the adjacency…

In the past years, there have been tremendous advances in the field of planar N=4 super Yang-Mills scattering amplitudes. At tree-level they were formulated as Grassmannian integrals and were shown to be invariant under the Yangian of the…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

We investigate closed ideals in the Grassmann algebra serving as bases of Lie-invariant geometric objects studied before by E. Cartan. Especially, the E. Cartan theory is enlarged for Lax integrable nonlinear dynamical systems to be treated…

Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…

We give a constructive proof, to all orders, that each member of the non-commutative potential Korteweg-de Vries hierarchy is a Fredholm Grassmannian flow and is therefore linearisable. Indeed we prove this for any linear combination of…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984, which is a nice generalization of the classical connectivity. Recently, as a natural counterpart, Li et al. proposed the concept of…

We describe a class of integrable systems on Poisson submanifolds of the affine Poisson-Lie groups $\widehat{PGL}(N)$, which can be enumerated by cyclically irreducible elements the co-extended affine Weyl groups $(\widehat{W}\times…

We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…

In this paper we show that the homology of a certain natural compactification of the moduli space, introduced by Kontsevich in his study of Witten's conjectures, can be described completely algebraically as the homology of a certain…

This paper explores a particular statistical model on 6-valent graphs with special properties which turns out to be invariant with respect to certain Roseman moves if the graph is the singular point graph of a diagram of a 2-knot. The…

We provide a direct combinatorial proof of a Feynman graph identity which implies a wide generalization of a formality theorem by Kontsevich. For a Feynman graph $\Gamma$, we associate to each vertex a position $x_v \in \mathbb R$ and to…

The Mishchenko-Fomenko theorem on noncommutative integrability of Hamiltonian systems on a symplectic manifold is extended to the case of noncompact invariant submanifolds.

Kricker constructed a knot invariant Z^{rat} valued in a space of Feynman diagrams with beads. When composed with the so called "hair" map H, it gives the Kontsevich integral of the knot. We introduce a new grading on diagrams with beads…

Dual Seidel switching is a graph operation introduced by W.~Haemers in 1984. This operation can change the graph, however it does not change its bipartite double, and because of this, the operation leaves the squares of the eigenvalues…

We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…

In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. We show that these graph grammars can be embedded in a graph rewriting characterization of distributed systems that was…