English
Related papers

Related papers: Morphism complexes of sets with relations

200 papers

In this paper we study implications of folds in both parameters of Lov\'asz' Hom(-,-) complexes. There is an important connection between the topological properties of these complexes and lower bounds for chromatic numbers. We give a very…

Combinatorics · Mathematics 2007-05-23 Dmitry N. Kozlov

We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…

Algebraic Topology · Mathematics 2026-05-18 Melissa Wei

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

Computational Complexity · Computer Science 2020-11-17 Balagopal Komarath , Anurag Pandey , C. S. Rahul

In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…

Combinatorics · Mathematics 2013-05-14 Alexander Grigor'yan , Yong Lin , Yuri Muranov , Shing-Tung Yau

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Computational Complexity · Computer Science 2012-10-30 Nicolas de Rugy-Altherre

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

Algebraic Topology · Mathematics 2018-01-03 Shiquan Ren , Chengyuan Wu , Stephane Bressan , Jie Wu

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

Computational Complexity · Computer Science 2020-11-24 Tomas Feder , Jeff Kinne , Ashwin Murali , Arash Rafiey

Let $f \colon X \to Y$ be a morphism of concentrated schemes. We characterize $f$-perfect complexes $\mathcal{E}$ as those such that the functor $\mathcal{E} \otimes^{\mathbf{L}}_X \mathbf{L} f^*-$ preserves bounded complexes. We prove, as…

Algebraic Geometry · Mathematics 2023-09-15 Leovigildo Alonso , Ana Jeremias , Fernando Sancho

We introduce a new family of pure simplicial complexes, called the $r$-co-connected complex of $G$ with respect to $A$, $\Sigma_r(A,G)$, where $r\geq 1$ is a natural number, $G$ is a simple graph, and $A$ is a subset of vertices.…

Combinatorics · Mathematics 2026-02-04 Priyavrat Deshpande , Amit Roy , Rutuja Sawant

Given a commutative ring $R$ and finitely generated ideal $I$, one can consider the classes of $I$-adically complete, $L_0^I$-complete and derived $I$-complete complexes. Under a mild assumption on the ideal $I$ called weak pro-regularity,…

Commutative Algebra · Mathematics 2025-05-29 Luca Pol , Jordan Williamson

Given a CW-complex A we define an `A-shaped' homology theory which behaves nicely towards A-homotopy groups allowing the generalization of many classical results. We also develop a relative version of the Federer spectral sequence for…

Algebraic Topology · Mathematics 2014-05-12 Miguel Ottina

An $r$-regular graph is an $r$-graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Let $G$ and $H$ be $r$-graphs. An $H$-coloring of $G$ is a mapping $f\colon E(G) \to E(H)$ such that each $r$ adjacent…

Combinatorics · Mathematics 2023-05-16 Yulai Ma , Davide Mattiolo , Eckhard Steffen , Isaak H. Wolf

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

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

Algebraic Topology · Mathematics 2020-03-24 Sylvain Douteau

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…

Combinatorics · Mathematics 2007-05-23 Carsten Schultz

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

Category Theory · Mathematics 2014-03-20 Adam J. Przezdziecki

We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…

Computational Complexity · Computer Science 2022-08-19 J. A. Gregor Lagodzinski , Andreas Göbel , Katrin Casel , Tobias Friedrich

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

Combinatorics · Mathematics 2022-10-21 Florian Frick , Andrew Newman

We find families of simplicial complexes where the simplicial chromatic polynomials defined by Cooper--de Silva--Sazdanovic \cite{CdSS} are Hilbert series of Stanley--Reisner rings of auxiliary simplicial complexes. As a result, such…

Combinatorics · Mathematics 2022-09-19 Soohyun Park

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

Logic · Mathematics 2020-01-09 Samuel Coskey , Paul Ellis
‹ Prev 1 3 4 5 6 7 10 Next ›