Related papers: Affine hom-complexes
In mixed characteristic and in equal characteristic $p$ we define a filtration on topological Hochschild homology and its variants. This filtration is an analogue of the filtration of algebraic $K$-theory by motivic cohomology. Its graded…
The edges of the characteristic imset polytope, $\operatorname{CIM}_p$, were recently shown to have strong connections to causal discovery as many algorithms could be interpreted as greedy restricted edge-walks, even though only a strict…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
Making the first steps towards a classification of simple partial comodules, we give a general construction for partial comodules of a Hopf algebra \(H\) using central idempotents in right coideal subalgebras and show that any…
This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index of the main products of graphs. Here, we obtain several…
Hom-Lie algebras are non-associative algebras generalizing Lie algebras by twisting the Jacobi identity by an endomorphism. The main examples are algebras of twisted derivations (i.e., linear maps with a generalized Leibniz rule). Such…
Recent work by Forsg{\aa}rd indicates that not every convex lattice polygon arises as the characteristic polygon of an affine dimer or, equivalently, an admissible oriented line arrangement on the torus in general position. We begin the…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
We show P\'eter Csorba's conjecture that the graph homomorphism complex Hom(C_5,K_{n+2}) is homeomorphic to a Stiefel manifold, the space of unit tangent vectors to the n-dimensional sphere. For this a general tool is developed that allows…
We introduce the Double leaves basis, a combinatorial basis for the Hom spaces between two Bott-Samelson-Soergel bimodules. As an application we give a combinatorial algorithm to find, for any given Weyl or affine Weyl group, the set of…
The article primarily surveys work that followed from the formulas discovered by Avramov and Iyengar in 2008, which permit one to compute certain Hochschild homology and cohomology modules as expressions involving dualizing complexes. One…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope,…
In this paper we give several criteria for the edge polytope of a fundamental FHM-graph to possess a regular unimodular triangulation in terms of some simple data of the the graph. We further apply our criteria to several examples of graphs…
Simple optics are defined using actions of monoidal categories. Compound optics arise, for instance, as natural transformations between polynomial functors. Since a monoidal category is a special case of a bicategory, we formulate complex…
While motivated by structural problems in mathematical music theory, this article introduces a novel combinatorial framework that advances the classification of cyclic cubic bipartite graphs. We extend the classical study of Levi graphs by…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…