Related papers: Algebraic structures on graph associahedra
Finite simple graphs are a playground for classical areas of mathematics. We illustrate this by looking at some theorems. These are slightly enhanced preparation notes for a talk given at the joint AMS meeting of January 16, 2014 in…
In this thesis we develop the cohomology of diagrams of algebras and then apply this to the cases of the $\lambda$-rings and the $\Psi$-rings. A diagram of algebras is a functor from a small category to some category of algebras. For an…
Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…
Goldman and Turaev constructed a Lie bialgebra structure on the free $\mathbb{Z}$-module generated by free homotopy classes of loops on a surface. Turaev conjectured that his cobracket $\Delta(\alpha)$ is zero if and only if $\alpha$ is a…
Let $\Sigma_{g,n}$ be a compact oriented surface of genus $g$ with $n$ open disks removed. The graph algebra $\mathcal{L}_{g,n}(H)$ was introduced by Alekseev--Grosse--Schomerus and Buffenoir--Roche and is a combinatorial quantization of…
In previous work, the authors showed that the C*-algebra C*(\Lambda) of a row-finite higher-rank graph \Lambda with no sources is simple if and only if \Lambda is both cofinal and aperiodic. In this paper, we generalise this result to…
We show that for most pairs of surfaces, there exists a finite subgraph of the flip graph of the first surface so that any injective homomorphism of this finite subgraph into the flip graph of the second surface can be extended uniquely to…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We define algebraic structures on graph cohomology and prove that they correspond to algebraic structures on the cohomology of the spaces of imbeddings of S^1 or R into R^n. As a corollary, we deduce the existence of an infinite number of…
Real-world graphs have inherently complex and diverse topological patterns, known as topological heterogeneity. Most existing works learn graph representation in a single constant curvature space that is insufficient to match the complex…
Let $\phi \colon \Gamma_2 \rightarrow \Gamma_1$ be a harmonic morphism of connected graphs. We show that an arithmetical structure on $\Gamma_1$ can be pulled back via $\phi$ to an arithmetical structure on $\Gamma_2$. We then show that…
The algebraic connectivity of a graph $G$ in a finite dimensional real normed linear space $X$ is a geometric counterpart to the Fiedler number of the graph and can be regarded as a measure of the rigidity of the graph in $X$. We analyse…
This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $\Gamma$ we denote by $\Gamma_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $\Gamma$…
Higher derivations on an associative algebra generalizes higher order derivatives. We call a tuple consisting of an algebra and a higher derivation on it by an AssHDer pair. We define a cohomology for AssHDer pairs with coefficients in a…
Motivated by the theory of cluster algebras, F. Chapoton, S. Fomin and A. Zelevinsky associated to each finite type root system a simple convex polytope called \emph{generalized associahedron}. They provided an explicit realization of this…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…
We define term rewriting systems on the vertices and faces of nestohedra, and show that the former are confluent and terminating. While the associated posets on vertices generalize Barnard--McConville's flip order for graph-associahedra,…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
For a locally finite, connected graph $\Gamma$, let $\operatorname{Map}(\Gamma)$ denote the group of proper homotopy equivalences of $\Gamma$ up to proper homotopy. Excluding sporadic cases, we show $\operatorname{Aut}(S(M_\Gamma)) \cong…