Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 81 tok/s
Gemini 2.5 Pro 57 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 104 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Configuration spaces of graphs with certain permitted collisions (1703.05535v3)

Published 16 Mar 2017 in math.AT, math.CO, and math.RT

Abstract: If $G$ is a graph with vertex set $V$, let Conf$_n{\text{sink}}(G,V)$ be the space of $n$-tuples of points on $G$, which are only allowed to overlap on elements of $V$. We think of Conf$_n{\text{sink}}(G,V)$ as a configuration space of points on $G$, where points are allowed to collide on vertices. In this paper, we attempt to understand these spaces from two separate, but closely related, perspectives. Using techniques of combinatorial topology we compute the fundamental groups and homology groups of Conf$_n{\text{sink}}(G,V)$ in the case where $G$ is a tree. Next, we use techniques of asymptotic algebra to prove statements about Conf$_n{\text{sink}}(G,V)$, for general graphs $G$, whenever $n$ is sufficiently large. It is proven that, for general graphs, the homology groups exhibit generalized representation stability in the sense of previous work of the author.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)