arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.11985math.CO
收藏

关于单图上粒子系统诱导的Johnson $\mathcal{J}(n,k)$图的子图

On sub-graphs of the Johnson $\mathcal{J}(n,k)$ graph induced by particle systems on simple graphs

Jens Walter Fischer

摘要:

对于具有连续状态空间的动力系统来说,理解状态空间的拓扑已被证明是极其有效的。另一方面,对于有限单图上的粒子系统,由于组合障碍和现有有效的谱理论方法来分析经典粒子系统,它尚未受到深入的研究。在具有粒子的异质相互作用的复杂系统的背景下,这些技术可能由于难以处理而失败。本文的工作提供了一个工具箱的结果的拓扑结构的状态空间的粒子系统的唯一条件下,只有一个粒子的时间移动,没有两个粒子可以在同一时间占据同一个顶点。Johnson的$\mathcal{J}(n,k)$图产生的总体结构,我们证明了任何粒子系统的排斥性质和单粒子运动可以嵌入作为一个动力系统的子图的$\mathcal{J}(n,k)$。

英文摘要:

Understanding the topology of the state space has proven to be extremely efficient for dynamical systems with a continuous state space. On the other hand, for particle systems on finite simple graphs, it has not yet been subject to deep investigation due to combinatorial hurdles and existing efficient spectral theoretic approaches to the analysis of classical particle systems. In the context of complex systems with heterogeneous interactions of particles, these techniques can break down due to intractability. This work provides a tool box of results on the topology of state spaces of particles systems under the sole conditions that exactly one particle moves at a time and no two particles may occupy the same vertex at the same time. The Johnson $\mathcal{J}(n,k)$ graph yields the overarching structure and we prove that any particle system with exclusion property and single particle movements may be embedded as a dynamical system on a sub-graph of $\mathcal{J}(n,k)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑