相关论文: Dissections, Hom-complexes and the Cayley trick

The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…

We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…

A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…

We give a simple axiomatic description of the degree 0 part of the polylogarithm on abelian schemes and show that its realisation in analytic Deligne cohomology can be described in terms of the Bismut-K\"ohler higher analytic torsion form…

The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…

Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…

Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…

We consider a class of quasi-Hopf algebras which we call \emph{generalized twisted quantum doubles}. They are abelian extensions $H = \mb{C}[\bar{G}] \bowtie \mb{C}[G]$ ($G$ is a finite group and $\bar{G}$ a homomorphic image), possibly…

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic Cayley graphs of the dihedral groups. Lubotzky, Samuels and…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

We present a general construction of hypersurfaces with vanishing hessian, starting from any irreducible non-degenerate variety whose dual variety is a hypersurface and based on the so called Dual Cayley Trick. The geometrical properties of…

We study a number of local and global classification problems in generalized complex geometry. In the first topic, we characterize the local structure of generalized complex manifolds by proving that a generalized complex structure near a…

Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…

We construct a direct quasi-isomorphism from Kontsevich's graph complex GC_n to the oriented graph complex OGC_{n+1}, thus providing an alternative proof that the two complexes are quasi-isomorphic. Moreover, the result is extended to the…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

In the counting Graph Homomorphism problem (#GraphHom) the question is: Given graphs G,H, find the number of homomorphisms from G to H. This problem is generally #P-complete, moreover, Cygan et al. proved that unless the ETH is false there…

Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…

The semi-classical data attached to stacks of algebroids in the sense of Kashiwara and Kontsevich are Maurer-Cartan elements on complex manifolds, which we call extended Poisson structures as they generalize holomorphic Poisson structures.…

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…