Related papers: Polyhedral joins and graph complexes

In this article, we discuss the vertex decomposability of three well-studied simplicial complexes associated to forests. In particular, we show that the bounded degree complex of a forest and the complex of directed trees of a multidiforest…

Two homotopy decompositions of supensions of spaces involving polyhedral products are given. The first decomposition is motivated by the decomposition of suspensions of polyhedral products by Bahri, Bendersky, Cohen, and Gitler, and is a…

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

Monoidal width was recently introduced by the authors as a measure of the complexity of decomposing morphisms in monoidal categories. We have shown that in a monoidal category of cospans of graphs, monoidal width and its variants can be…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

If $G$ is a compact connected Lie group and $T$ is a maximal torus, we give a wedge decomposition of $\Sigma G/T$ by identifying families of idempotents in cohomology. This is used to give new information on the self-maps of $G/T$.

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

For a connected graph $G=(V,E)$, a matching $M\subseteq E$ is a matching cut of $G$ if $G-M$ is disconnected. It is known that for an integer $d$, the corresponding decision problem Matching Cut is polynomial-time solvable for graphs of…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

We identify a family of $O(|E(G)|^2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

We investigate the triangulated structure of stable monomorphism categories (filtered chain categories) over a Frobenius category. The high degree of symmetry of linear quivers leads to a plethora of semiorthogonal decompositions into…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

We analyze a general family of fibrations which, after looping, have sections. Methods are developed to determine the homotopy type of the fibre and the homotopy classes of the map from the fibre to the base. The methods are driven by…

In this paper, we compute the homology group and cohomology algebra of various polyhedral product objects uniformly from the point of view of diagonal tensor product. As applications, we introduce the polyhedral product method into…

The article is devoted to homological complexes. Smashly graded modules and complexes are studied over nonassociative algebras with metagroup relations. Smashed tensor products of homological complexes are investigated. Their homotopisms…

We introduce an optimal transport based approach for comparing undirected graphs with non-negative edge weights and general vertex labels, and we study connections between the resulting linear program and the graph isomorphism problem. Our…

In this paper, we focus on contact structures supported by planar open book decompositions. We study right-veering diffeomorphisms to keep track of overtwistedness property of contact structures under some monodromy changes. As an…

We introduce filtrations in chiral homology complexes of smooth elliptic curves, exploiting the mixed Hodge structure on cohomology groups of configuration spaces. We use these to relate the chiral homology of a smooth elliptic curve with…