Related papers: Twisted diagrams and homotopy sheaves
Let $k$ be a regular ring, and let $A,B$ be essentially finite type $k$-algebras. For any functor $F:{D}(A)\times\dots\times{D}(A)\to{D}(B)$ between their derived categories, we define its twist…
We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…
A hom-associative algebra is an algebra whose associativity is twisted by an algebra homomorphism. In this paper, we introduce a strongly homotopy version of hom-associative algebras ($HA_\infty$-algebras in short) on a graded vector space.…
The initial motivation of this work was to give a topological interpretation of two-periodic twisted de-Rham cohomology which is generalizable to arbitrary coefficients. To this end we develop a sheaf theory in the context of locally…
The aim of this paper is to develop the theory of Hom-coalgebras and related structures. After reviewing some key constructions and examples of quasi-deformations of Lie algebras involving twisted derivations and giving rise to the class of…
In the first part of this note, we review and compare various instances of the notion of twisted coefficient system, a.k.a. polynomial functor, appearing in the literature. This notion hinges on how one defines the degree of a functor from…
Knowledge graph embedding involves learning representations of entities -- the vertices of the graph -- and relations -- the edges of the graph -- such that the resulting representations encode the known factual information represented by…
Classical spectral theory gives a complete description of a single normal operator, but it fails for noncommuting operators, where no canonical joint spectrum or simultaneous diagonalization exists. Existing approaches provide only partial…
We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are…
Many important theorems in differential topology relate properties of manifolds to properties of their underlying homotopy types -- defined e.g. using the total singular complex or the \v{C}ech nerve of a good open cover. Upon embedding the…
This article is an expository account of the theory of twisted commutative algebras, which simply put, can be thought of as a theory for handling commutative algebras with large groups of linear symmetries. Examples include the coordinate…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political…
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 prove `twisted' versions of Kirchhoff's network theorem and Kirchhoff's matrix-tree theorem on connected finite graphs. Twisting here refers to chains with coefficients in a flat unitary line bundle.
The symmetric spectra introduced by Hovey, Shipley and Smith are a convenient model for the stable homotopy category with a nice associative and commutative smash product on the point set level and a compatible Quillen closed model…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
Data constraints are fundamental for practical data modelling, and a verifiable conformance of a data instance to a safety-critical constraint (satisfaction relation) is a corner-stone of safety assurance. Diagrammatic constraints are…
We describe explicitly the cohomology of the total complex of certain diagrams of invertible sheaves on normal toric varieties. These diagrams, called wheels, arise in the study of toric singularities associated to dimer models. Our main…