Related papers: Brunnian links and Kontsevich graph complex I
We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…
Given a $d$-dimensional convex polytope $P$ and nonnegative integer $k$ not exceeding $d-1$, let $G_k (P)$ denote the simple graph on the node set of $k$-dimensional faces of $P$ in which two such faces are adjacent if there exists a…
Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with $n$ vertices in this model uses a (random) preference order on other $n-1$ vertices and each vertex…
By considering spaces of directed Jacobi diagrams, we construct a diagrammatic version of the Etingof-Kazhdan quantization of complex semisimple Lie algebras. This diagrammatic quantization is used to provide a construction of a directed…
We elaborate on the construction of the Evans chain complex for higher-rank graph $C^*$-algebras. Specifically, we introduce a block matrix presentation of the differential maps. These block matrices are then used to identify a wide family…
In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\mathbb{R} ^3$ rather than…
We introduce the notion of a conformally Fedosov structure and construct an associated Cartan connection. When an appropriate curvature vanishes, this allows us to construct a family of natural differential complexes akin to the BGG…
The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ with $|S|=k$. The generalized $k$-connectivity is a natural extension of the…
Gross-Pandharipande-Siebert have shown that the 2-dimensional Kontsevich-Soibelman scattering diagrams compute certain genus zero log Gromov-Witten invariants of log Calabi-Yau surfaces. We show that the $q$-refined 2-dimensional…
We generalise the concept of duality to systems of ordinary difference equations (or maps). We propose a procedure to construct a chain of systems of equations which are dual, with respect to an integral $H$, to the given system, by…
We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three…
We study the 2-loop part of the rational Kontsevich integral of a knot in an integer homology sphere. We give a general formula which explains how the 2-loop part of the Kontsevich integral of a knot changes after surgery on a single…
Kontsevich's formality theorem states that the differential graded Lie algebra of multidifferential operators on a manifold M is L-infinity-quasi-isomorphic to its cohomology. The construction of the L-infinity map is given in terms of…
We give a detailed explicit computation of weights of Kontsevich graphs which arise from connection and curvature terms within the globalization picture for the special case of symplectic manifolds. We will show how the weights for the…
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least $2k$ vertices is {\it $k$-linked} if, for every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of vertices, there…
The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also…
The based loop space of a configuration space of points in a Euclidean space can be viewed as a space of pure braids in a Euclidean space of one dimension higher. We continue our study of such spaces in terms of Kontsevich's CDGA of…
In this paper, I give a generalized analogue of the string topology results of Chas and Sullivan, and of Cohen and Jones. For a finite simplicial complex $X$ and $k \geq 1$, I construct a spectrum $Maps(S^k, X)^{S(X)}$, and show that the…