Related papers: Completing the $c_2$ completion conjecture for $p=…
P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…
We pick up a method originally developed by Cheng and Tsai for vacuum perturbation theory which allows to test the consistency of different sets of Feynman rules on a purely diagrammatic level, making explicit loop calculations superfluous.…
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…
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…
A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for…
We derive an inductive, combinatorial definition of a polynomial-valued regular isotopy invariant of links and tangled graphs. We show that the invariant equals the Reshetikhin-Turaev invariant corresponding to the exceptional simple Lie…
Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide. We use this…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a…
In this paper, we apply the Tian-Yau-Zelditch expansion of the Bergman kernel on polarized K\"ahler metrics to approximate plurisubharmonic functions and compute the $\alpha$-invariant of $CP^2#2\bar{CP^2}$, which is exactly 1/3. In…
Noncommutative invariant theory is a generalization of the classical invariant theory of the action of $SL(2,\IC)$ on binary forms. The dimensions of the spaces of invariant noncommutative polynomials coincide with the numbers of certain…
A new complete invariant for acyclic graphs is presented
We compute the relative orbifold Gromov-Witten invariants of $[\mathbb{C}^2/\mathbb{Z}_{n+1}]\times \mathbb{P}^1$, with respect to vertical fibers. Via a vanishing property of the Hurwitz-Hodge bundle, 2-point rubber invariants are…
We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…
This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…
Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the (imperfect completeness variant of) Khot's 2 to 2 games conjecture follows from a combinatorial hypothesis about the soundness of a certain "Grassmanian agreement…
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…
We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…
We consider the sampling problem for two-sided small Fock spaces $\mathcal{F}^p_{\alpha}$, for the full range $0 < p \le \infty$. We establish a geometric description of shift-invariant sampling sequences, i.e., sequences $\Lambda$ such…
In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of 2- factors that contain the the perfect matching as a subgraph. Consequently, we show that the…