Reconnectads

arXiv2211.15754MaRDI QIDQ6418804FDOQ6418804

Authors: Vladimir Dotsenko, Adam Keilthy, Denis Lyskov 

Publication date: 28 November 2022

Abstract: We introduce a new operad-like structure that we call a reconnectad; the ``input of an element of a reconnectad is a finite simple graph, rather than a finite set, and ``compositions of elements are performed according to the notion of the reconnected complement of a subgraph. The prototypical example of a reconnectad is given by the collection of toric varieties of graph associahedra of Carr and Devadoss, with the structure operations given by inclusions of orbits closures. We develop the general theory of reconnectads, and use it to study the ``wonderful reconnectad assembled from homology groups of complex toric varieties of graph associahedra.

This page was built for publication: Reconnectads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418804)