English
Related papers

Related papers: Morphism complexes of sets with relations

200 papers

The matching complex of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. In the last few years the matching complexes of grid graphs have gained much attention among the topological combinatorists. In 2017, Braun…

Combinatorics · Mathematics 2025-11-27 Shuchita Goyal , Samir Shukla , Anurag Singh

We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this…

Representation Theory · Mathematics 2011-08-31 Jacob T. Harper

We review the gauge and ghost cyle graph complexes as defined by Kreimer, Sars and van Suijlekom in "Quantization of gauge fields, graph polynomials and graph homology" and compute their cohomology. These complexes are generated by…

Mathematical Physics · Physics 2020-07-15 Marko Berghoff , Andre Knispel

Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…

Metric Geometry · Mathematics 2013-07-22 Rade T. Živaljević

We provide a recursive construction of an acyclic matching (also known as a gradient vector field, an equivalent notion to a discrete Morse function) on the independence complex of a graph with a simplicial vertex using given acyclic…

Combinatorics · Mathematics 2026-04-15 Sucharita Barik , Anupam Mondal , Sajal Mukherjee

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

Algebraic Topology · Mathematics 2020-10-01 Marko Berghoff

A multifiltration is a functor indexed by $\mathbb{N}^r$ that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural $\mathbb{N}^r$-graded $R[x_1,\ldots, x_r]$-module…

Algebraic Topology · Mathematics 2014-09-30 Wojciech Chacholski , Martina Scolamiero , Francesco Vaccarino

By Rickard's work, two rings are derived equivalent if there is a tilting complex, constructed from projective modules over the first ring such that the second ring is the endomorphism ring of this tilting complex. In this work I describe,…

Rings and Algebras · Mathematics 2007-05-23 Intan Muchtadi-Alamsyah

We prove an equivalence of categories from formal complex structures with formal holomorphic maps to homotopy algebras over a simple operad with its associated homotopy morphisms. We extend this equivalence to complex manifolds. A complex…

Algebraic Topology · Mathematics 2015-01-19 Joan Millès

Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…

Computational Complexity · Computer Science 2025-12-01 Michal Čertík , Andreas Emil Feldmann , Jaroslav Nešetřil , Paweł Rzążewski

We introduce the notion of \textit{star cluster} of a simplex in a simplicial complex. This concept provides a general tool to study the topology of independence complexes of graphs. We use star clusters to answer a question arisen from…

Combinatorics · Mathematics 2010-07-05 Jonathan Ariel Barmak

Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…

Combinatorics · Mathematics 2007-05-23 Axel Hultman

We present a method to compute integral cohomology of posets. This toolbox is applicable as soon as the sub-posets under each object possess certain structure. This is the case for simplicial complexes and simplex-like posets. The method is…

Algebraic Topology · Mathematics 2007-06-15 Antonio Diaz

We show that the independence complexes of generalised Mycielskian of complete graphs are homotopy equivalent to a wedge sum of spheres, and determine the number of copies and the dimensions of these spheres. We also prove that the…

Combinatorics · Mathematics 2022-04-29 Shuchita Goyal , Samir Shukla , Anurag Singh

We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…

Quantum Algebra · Mathematics 2018-02-14 Marko Živković

In this paper we provide concrete combinatorial formal deformation algorithms, namely sequences of elementary collapses and expansions, which relate various previously extensively studied families of combinatorially defined polyhedral…

Algebraic Topology · Mathematics 2007-05-23 Dmitry N. Kozlov

We compute numerically the homology of several graph complexes in low loop orders, extending previous results.

Quantum Algebra · Mathematics 2023-12-21 Simon Brun , Thomas Willwacher

We prove several results regarding the homology and homotopy type of images of real maps and their complexification. In particular, we study the local behavior of singular points after deformations. In this context, we prove a restrictive…

Algebraic Geometry · Mathematics 2024-11-11 Ignacio Breva Ribes , R. Giménez Conejero

Given an algebraic theory $\ct$, a homotopy $\ct$-algebra is a simplicial set where all equations from $\ct$ hold up to homotopy. All homotopy $\ct$-algebras form a homotopy variety. We give a characterization of homotopy varieties…

Category Theory · Mathematics 2007-05-23 J. Rosicky

In the deletion version of the list homomorphism problem, we are given graphs G and H, a list L(v) that is a subset of V(H) for each vertex v of G, and an integer k. The task is to decide whether there exists a subset W of V(G) of size at…

Data Structures and Algorithms · Computer Science 2013-08-06 Rajesh Chitnis , Laszlo Egri , Daniel Marx
‹ Prev 1 4 5 6 7 8 10 Next ›