Related papers: The Euler characteristic of graph complexes via Fe…
In this article we introduce a new method for constructing implicit symplectic maps using special symplectic manifolds and Liouvillian forms. This method extends, in a natural way, the method of generating functions to 1-forms which are…
Graph complements G(n) of cyclic graphs are circulant, vertex-transitive, claw-free, strongly regular, Hamiltonian graphs with a Z(n) symmetry, Shannon capacity 2 and known Wiener and Harary index. There is an explicit spectral zeta…
We review certain classes of iterated integrals that appear in the computation of Feynman integrals that involve elliptic functions. These functions generalise the well-known class of multiple polylogarithms to elliptic curves and are…
We discuss a progress in calculations of Feynman integrals based on the Gegenbauer Polynomial Technique and the Differential Equation Method. We demonstrate the results for a class of two-point two-loop diagrams and the evaluation of most…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
In this work we study the tau-function $Z^{1D}$ of the KP hierarchy specified by the topological 1D gravity. As an application, we present two types of algorithms to compute the orbifold Euler characteristics of $\overline{\mathcal…
We study a family of Lie algebras {hO} which are defined for cyclic operads O. Using his graph homology theory, Kontsevich identified the homology of two of these Lie algebras (corresponding to the Lie and associative operads) with the…
In 1967 Kasteleyn introduced a powerful method for enumerating the 1-factors of planar graphs. In fact his method can be extended to graphs which permit an orientation under which every alternating circuit is clockwise odd. Graphs with this…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
The hypergeometric function method naturally provides the analytic expressions of scalar integrals from concerned Feynman diagrams in some connected regions of independent kinematic variables, also presents the systems of homogeneous linear…
We continue our investigation of spaces of long embeddings (long embeddings are high-dimensional analogues of long knots). In previous work we showed that when the dimensions are in the stable range, the rational homology groups of these…
We introduce graph potentials, which are Laurent polynomials associated to (colored) trivalent graphs. We show that the birational type of the graph potential only depends on the homotopy type of the colored graph, and use this to define a…
The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…
It is well known that the Euler characteristic of the cohomology of a complex algebraic variety coincides with the Euler characteristic of its cohomology with compact support. An old result of G. Laumon asserts that a relative version of…
For each positive integer n, Khovanov and Rozansky constructed an invariant of links in the form of a doubly-graded cohomology theory whose Euler characteristic is the sl(n) link polynomial. We use Lagrangian Floer cohomology on some…
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
We consider graph complexes with a flow and compute their cohomology. More specifically, we prove that for a PROP generated by a Koszul dioperad, the corresponding graph complex gives a minimal model of the PROP. We also give another proof…
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…
In the 1930s, H. Hopf conjectured that a closed, even-dimensional manifold of positive sectional curvature has positive Euler characteristic. We show this under the additional assumption of an isometric $T^4$-action on the manifold,…