English
Related papers

Related papers: Total cut complexes and their duals

200 papers

We consider the calculation of the master integrals of the three-loop massive banana graph. In the case of equal internal masses, the graph is reduced to three master integrals which satisfy an irreducible system of three coupled linear…

High Energy Physics - Phenomenology · Physics 2018-11-26 Amedeo Primo , Lorenzo Tancredi

We show that the dominance complex $\mathcal{D}(G)$ of a graph $G$ coincides with the combinatorial Alexander dual of the neighborhood complex $\mathcal{N}(\overline{G})$ of the complement of $G$. Using this, we obtain a relation between…

Combinatorics · Mathematics 2024-11-01 Takahiro Matsushita , Shun Wakatsuki

In this paper, we determine the homotopy type of the Morse complex of certain collections of simplicial complexes by studying dominating vertices or strong collapses. We show that if $K$ contains two leaves that share a common vertex, then…

Algebraic Topology · Mathematics 2021-07-19 Connor Donovan , Maxwell Lin , Nicholas A. Scoville

We explicitly compute the 2-group of self-equivalences and (homotopy classes of) chain homotopies between them for any {\it split} chain complex $A_{\bullet}$ in an arbitrary $\kb$-linear abelian category ($\kb$ any commutative ring with…

K-Theory and Homology · Mathematics 2013-08-13 Josep Elgueta

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Computational Complexity · Computer Science 2014-12-02 Christian Engels

The dual complex can be associated to any resolution of singularities whose exceptional set is a divisor with simple normal crossings. It generalizes to higher dimensions the notion of the dual graph of a resolution of surface singularity.…

Algebraic Geometry · Mathematics 2007-05-23 D. A. Stepanov

Given an undirected graph $G = (V,E)$, the cut polytope $\mathrm{CUT}(G)$ is defined as the convex hull of the incidence vectors of all cuts in $G$. The 1-skeleton of $\mathrm{CUT}(G)$ is a graph whose vertex set is the vertex set of the…

Combinatorics · Mathematics 2024-06-27 Andrei V. Nikolaev

We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…

Combinatorics · Mathematics 2025-07-22 Nevena Marić

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…

Combinatorics · Mathematics 2022-08-10 Luigi Caputi , Carlo Collari , Sabino Di Trani , Jason P. Smith

In the paper we describe the almost split sequences in the homotopy category of perfect complexes over a gentle algebra.

Representation Theory · Mathematics 2009-03-31 Grzegorz Bobinski

The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an…

Combinatorics · Mathematics 2019-03-06 Markus Chimani , Martina Juhnke-Kubitzke , Alexander Nover , Tim Römer

We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is…

Combinatorics · Mathematics 2011-10-27 Christine Bachoc , Arnaud Pêcher , Alain Thiéry

It was conjectured by Goyal, Shukla and Singh that the independence complex of the categorical product $K_2\times K_3\times K_n$ has the homotopy type of a wedge of $(n-1)(3n-2)$ spheres of dimension $3$. Here we prove this conjecture by…

Algebraic Topology · Mathematics 2025-07-29 Omar Antolín Camarena , Andrés Carnero Bravo

We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.

Combinatorics · Mathematics 2024-11-18 Demet Taylan

In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…

Combinatorics · Mathematics 2013-10-22 Anton Ayzenberg

We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…

Algebraic Topology · Mathematics 2026-01-06 Ruizhi Huang

The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…

Mathematical Physics · Physics 2020-01-29 Freddy Cachazo , Karen Yeats , Samuel Yusim

We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…

Combinatorics · Mathematics 2011-02-22 Michal Adamaszek

We define two model structures on the category of bicomplexes concentrated in the right half plane. The first model structure has weak equivalences detected by the totalisation functor. The second model structure's weak equivalences are…

Algebraic Topology · Mathematics 2023-02-09 Fernando Muro , Constanze Roitzheim

Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that…

Combinatorics · Mathematics 2016-09-07 Eric Babson , Anders Björner , Svante Linusson , John Shareshian , Volkmar Welker